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-ext/tree_of_cslls_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 21:46:33,100 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 21:46:33,101 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 21:46:33,113 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 21:46:33,113 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 21:46:33,114 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 21:46:33,115 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 21:46:33,116 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 21:46:33,118 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 21:46:33,118 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 21:46:33,119 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 21:46:33,119 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 21:46:33,120 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 21:46:33,121 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 21:46:33,121 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 21:46:33,123 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 21:46:33,124 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 21:46:33,126 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 21:46:33,127 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 21:46:33,127 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 21:46:33,129 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 21:46:33,129 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 21:46:33,129 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 21:46:33,130 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 21:46:33,131 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 21:46:33,132 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 21:46:33,132 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 21:46:33,132 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 21:46:33,133 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 21:46:33,133 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 21:46:33,133 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 21:46:33,134 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 21:46:33,154 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 21:46:33,155 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 21:46:33,156 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 21:46:33,156 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 21:46:33,156 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 21:46:33,156 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 21:46:33,156 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 21:46:33,156 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 21:46:33,156 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 21:46:33,156 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 21:46:33,156 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 21:46:33,157 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 21:46:33,157 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 21:46:33,157 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 21:46:33,157 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 21:46:33,157 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 21:46:33,157 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 21:46:33,157 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 21:46:33,157 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 21:46:33,157 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 21:46:33,158 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 21:46:33,158 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 21:46:33,158 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 21:46:33,158 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 21:46:33,184 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 21:46:33,192 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 21:46:33,194 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 21:46:33,195 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 21:46:33,196 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 21:46:33,196 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,557 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG06ed0a399 [2018-04-11 21:46:33,688 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 21:46:33,688 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 21:46:33,688 INFO L168 CDTParser]: Scanning tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,695 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 21:46:33,695 INFO L215 ultiparseSymbolTable]: [2018-04-11 21:46:33,695 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 21:46:33,695 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,695 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 21:46:33,695 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____fsfilcnt64_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,695 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__ino_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,695 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__int32_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,696 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pid_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,696 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__u_int64_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,696 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__TreeNode in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,696 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__gid_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,696 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__off_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,696 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__fsfilcnt_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,696 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____blkcnt64_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,696 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__ldiv_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,696 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____int8_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,696 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____ssize_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,696 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__timer_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,696 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____socklen_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,696 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__register_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,696 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____nlink_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,696 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_mutex_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,696 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__key_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,696 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____rlim_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,696 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____fsblkcnt64_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,697 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____swblk_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,697 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____int32_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,697 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____time_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,697 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__int8_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,697 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____suseconds_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,697 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__fsblkcnt_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,697 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____timer_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,697 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__u_int in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,697 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____rlim64_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,697 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____fsfilcnt_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,697 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_mutexattr_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,697 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____uint32_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,697 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__wchar_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,698 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_condattr_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,698 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__fd_set in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,698 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____clockid_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,698 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_attr_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,698 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____caddr_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,698 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__quad_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,698 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____dev_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,698 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__mode_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,698 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__lldiv_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,698 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__uid_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,698 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__int16_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,698 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__suseconds_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,699 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____sigset_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,699 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____u_short in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,699 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__size_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,699 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__u_int16_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,699 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__ulong in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,699 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_cond_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,699 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_once_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,699 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____intptr_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,699 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__div_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,699 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____u_long in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,699 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__blksize_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,699 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_spinlock_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,700 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__u_short in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,700 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__caddr_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,700 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____mode_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,700 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____ino_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,700 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__clock_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,700 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__daddr_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,700 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____fsid_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,700 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____int16_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,700 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_rwlockattr_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,700 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__u_long in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,701 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__u_char in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,701 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_barrier_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,701 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____off_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,701 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__blkcnt_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,701 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__ListNode in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,701 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____pthread_list_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,701 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_barrierattr_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,701 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____loff_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,701 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__int64_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,701 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____WAIT_STATUS in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,701 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__u_int32_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,702 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__fsid_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,702 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__ushort in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,702 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__u_quad_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,702 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____u_quad_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,702 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____clock_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,702 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____u_char in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,702 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____uint8_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,702 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____blksize_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,702 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____gid_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,702 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____off64_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,702 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____quad_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,703 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____pid_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,703 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____uint16_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,703 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____qaddr_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,703 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____daddr_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,703 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__loff_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,703 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__id_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,703 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__uint in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,703 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__u_int8_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,703 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_rwlock_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,703 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____u_int in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,703 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____useconds_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,703 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__dev_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,703 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__nlink_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,703 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____fd_mask in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,703 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____id_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,704 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____key_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,704 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____int64_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,704 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,704 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__time_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,704 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__clockid_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,704 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__pthread_key_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,704 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____fsblkcnt_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,704 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____sig_atomic_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,704 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__fd_mask in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,704 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____uint64_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,704 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____blkcnt_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,704 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____uid_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,704 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__ssize_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,704 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i____ino64_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,705 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_of_cslls_true_valid_memsafety_i__sigset_t in tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:33,718 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG06ed0a399 [2018-04-11 21:46:33,721 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 21:46:33,722 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 21:46:33,723 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 21:46:33,723 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 21:46:33,727 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 21:46:33,728 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 09:46:33" (1/1) ... [2018-04-11 21:46:33,730 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35e85a27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:46:33, skipping insertion in model container [2018-04-11 21:46:33,730 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 09:46:33" (1/1) ... [2018-04-11 21:46:33,744 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 21:46:33,770 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 21:46:33,924 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 21:46:33,963 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 21:46:33,968 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 110 non ball SCCs. Number of states in SCCs 110. [2018-04-11 21:46:34,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:46:34 WrapperNode [2018-04-11 21:46:34,001 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 21:46:34,001 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 21:46:34,001 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 21:46:34,001 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 21:46:34,012 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:46:34" (1/1) ... [2018-04-11 21:46:34,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:46:34" (1/1) ... [2018-04-11 21:46:34,024 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:46:34" (1/1) ... [2018-04-11 21:46:34,024 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:46:34" (1/1) ... [2018-04-11 21:46:34,035 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:46:34" (1/1) ... [2018-04-11 21:46:34,040 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:46:34" (1/1) ... [2018-04-11 21:46:34,042 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:46:34" (1/1) ... [2018-04-11 21:46:34,046 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 21:46:34,046 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 21:46:34,046 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 21:46:34,046 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 21:46:34,047 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:46:34" (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 21:46:34,168 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 21:46:34,169 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 21:46:34,169 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 21:46:34,169 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 21:46:34,169 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-11 21:46:34,169 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 21:46:34,169 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 21:46:34,169 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 21:46:34,169 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 21:46:34,169 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 21:46:34,170 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 21:46:34,170 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 21:46:34,170 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 21:46:34,170 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 21:46:34,170 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 21:46:34,170 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 21:46:34,170 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 21:46:34,170 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 21:46:34,170 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 21:46:34,170 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 21:46:34,170 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 21:46:34,170 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 21:46:34,171 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 21:46:34,171 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 21:46:34,171 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 21:46:34,171 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 21:46:34,171 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 21:46:34,171 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 21:46:34,171 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 21:46:34,171 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 21:46:34,171 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 21:46:34,171 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 21:46:34,172 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 21:46:34,172 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 21:46:34,172 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 21:46:34,172 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 21:46:34,172 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 21:46:34,172 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 21:46:34,172 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 21:46:34,172 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 21:46:34,172 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 21:46:34,172 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 21:46:34,173 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 21:46:34,173 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 21:46:34,173 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 21:46:34,173 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 21:46:34,173 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 21:46:34,173 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 21:46:34,173 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 21:46:34,173 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 21:46:34,173 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 21:46:34,173 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 21:46:34,174 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 21:46:34,174 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 21:46:34,174 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 21:46:34,174 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 21:46:34,174 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 21:46:34,174 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 21:46:34,174 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 21:46:34,174 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 21:46:34,174 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 21:46:34,174 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 21:46:34,175 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 21:46:34,175 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 21:46:34,175 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 21:46:34,175 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 21:46:34,175 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 21:46:34,175 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 21:46:34,175 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 21:46:34,175 INFO L128 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-04-11 21:46:34,175 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 21:46:34,175 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 21:46:34,175 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 21:46:34,175 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 21:46:34,175 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 21:46:34,176 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 21:46:34,176 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 21:46:34,176 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 21:46:34,176 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 21:46:34,176 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 21:46:34,176 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 21:46:34,176 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 21:46:34,176 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 21:46:34,176 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 21:46:34,176 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 21:46:34,176 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 21:46:34,176 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 21:46:34,176 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 21:46:34,176 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 21:46:34,176 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 21:46:34,176 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 21:46:34,176 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 21:46:34,176 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 21:46:34,177 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 21:46:34,177 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 21:46:34,177 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 21:46:34,177 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 21:46:34,177 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 21:46:34,177 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 21:46:34,177 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 21:46:34,177 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 21:46:34,177 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 21:46:34,177 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 21:46:34,177 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 21:46:34,177 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 21:46:34,177 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 21:46:34,177 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 21:46:34,178 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 21:46:34,178 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-11 21:46:34,178 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-11 21:46:34,178 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 21:46:34,178 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 21:46:34,178 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 21:46:34,669 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 21:46:34,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 09:46:34 BoogieIcfgContainer [2018-04-11 21:46:34,670 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 21:46:34,670 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 21:46:34,670 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 21:46:34,672 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 21:46:34,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 09:46:33" (1/3) ... [2018-04-11 21:46:34,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27abd03e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 09:46:34, skipping insertion in model container [2018-04-11 21:46:34,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 09:46:34" (2/3) ... [2018-04-11 21:46:34,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27abd03e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 09:46:34, skipping insertion in model container [2018-04-11 21:46:34,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 09:46:34" (3/3) ... [2018-04-11 21:46:34,674 INFO L107 eAbstractionObserver]: Analyzing ICFG tree_of_cslls_true-valid-memsafety.i [2018-04-11 21:46:34,679 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 21:46:34,684 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 101 error locations. [2018-04-11 21:46:34,706 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 21:46:34,707 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 21:46:34,707 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 21:46:34,707 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 21:46:34,707 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 21:46:34,707 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 21:46:34,707 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 21:46:34,707 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 21:46:34,707 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 21:46:34,708 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 21:46:34,719 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states. [2018-04-11 21:46:34,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-11 21:46:34,726 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:46:34,727 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:46:34,727 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:46:34,730 INFO L82 PathProgramCache]: Analyzing trace with hash 268960233, now seen corresponding path program 1 times [2018-04-11 21:46:34,731 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:46:34,731 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:46:34,759 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:46:34,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:46:34,760 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:46:34,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:46:34,787 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:46:34,825 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 21:46:34,827 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:46:34,827 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 21:46:34,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 21:46:34,836 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 21:46:34,836 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 21:46:34,838 INFO L87 Difference]: Start difference. First operand 226 states. Second operand 4 states. [2018-04-11 21:46:35,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:46:35,182 INFO L93 Difference]: Finished difference Result 339 states and 363 transitions. [2018-04-11 21:46:35,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 21:46:35,183 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-11 21:46:35,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:46:35,191 INFO L225 Difference]: With dead ends: 339 [2018-04-11 21:46:35,191 INFO L226 Difference]: Without dead ends: 335 [2018-04-11 21:46:35,192 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 21:46:35,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-04-11 21:46:35,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 214. [2018-04-11 21:46:35,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-04-11 21:46:35,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 230 transitions. [2018-04-11 21:46:35,225 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 230 transitions. Word has length 8 [2018-04-11 21:46:35,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:46:35,225 INFO L459 AbstractCegarLoop]: Abstraction has 214 states and 230 transitions. [2018-04-11 21:46:35,225 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 21:46:35,225 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 230 transitions. [2018-04-11 21:46:35,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-11 21:46:35,225 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:46:35,225 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:46:35,226 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:46:35,226 INFO L82 PathProgramCache]: Analyzing trace with hash 268960234, now seen corresponding path program 1 times [2018-04-11 21:46:35,226 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:46:35,226 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:46:35,226 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:46:35,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:46:35,227 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:46:35,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:46:35,237 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:46:35,273 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 21:46:35,273 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:46:35,273 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 21:46:35,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 21:46:35,274 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 21:46:35,275 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 21:46:35,275 INFO L87 Difference]: Start difference. First operand 214 states and 230 transitions. Second operand 4 states. [2018-04-11 21:46:35,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:46:35,426 INFO L93 Difference]: Finished difference Result 212 states and 228 transitions. [2018-04-11 21:46:35,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 21:46:35,427 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-11 21:46:35,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:46:35,427 INFO L225 Difference]: With dead ends: 212 [2018-04-11 21:46:35,428 INFO L226 Difference]: Without dead ends: 212 [2018-04-11 21:46:35,428 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 21:46:35,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-04-11 21:46:35,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2018-04-11 21:46:35,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-04-11 21:46:35,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 228 transitions. [2018-04-11 21:46:35,433 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 228 transitions. Word has length 8 [2018-04-11 21:46:35,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:46:35,434 INFO L459 AbstractCegarLoop]: Abstraction has 212 states and 228 transitions. [2018-04-11 21:46:35,434 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 21:46:35,434 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 228 transitions. [2018-04-11 21:46:35,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-04-11 21:46:35,434 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:46:35,434 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:46:35,434 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:46:35,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1814695774, now seen corresponding path program 1 times [2018-04-11 21:46:35,434 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:46:35,434 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:46:35,435 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:46:35,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:46:35,435 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:46:35,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:46:35,448 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:46:35,489 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 21:46:35,489 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:46:35,489 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 21:46:35,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 21:46:35,490 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 21:46:35,490 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-04-11 21:46:35,490 INFO L87 Difference]: Start difference. First operand 212 states and 228 transitions. Second operand 5 states. [2018-04-11 21:46:35,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:46:35,745 INFO L93 Difference]: Finished difference Result 371 states and 399 transitions. [2018-04-11 21:46:35,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 21:46:35,745 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-04-11 21:46:35,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:46:35,747 INFO L225 Difference]: With dead ends: 371 [2018-04-11 21:46:35,747 INFO L226 Difference]: Without dead ends: 371 [2018-04-11 21:46:35,747 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-04-11 21:46:35,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-04-11 21:46:35,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 205. [2018-04-11 21:46:35,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-04-11 21:46:35,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 221 transitions. [2018-04-11 21:46:35,757 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 221 transitions. Word has length 11 [2018-04-11 21:46:35,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:46:35,758 INFO L459 AbstractCegarLoop]: Abstraction has 205 states and 221 transitions. [2018-04-11 21:46:35,758 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 21:46:35,758 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 221 transitions. [2018-04-11 21:46:35,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-11 21:46:35,758 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:46:35,758 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:46:35,759 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:46:35,759 INFO L82 PathProgramCache]: Analyzing trace with hash -848494062, now seen corresponding path program 1 times [2018-04-11 21:46:35,759 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:46:35,759 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:46:35,760 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:46:35,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:46:35,760 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:46:35,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:46:35,772 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:46:35,801 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 21:46:35,802 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:46:35,802 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 21:46:35,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 21:46:35,802 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 21:46:35,802 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 21:46:35,802 INFO L87 Difference]: Start difference. First operand 205 states and 221 transitions. Second operand 5 states. [2018-04-11 21:46:35,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:46:35,991 INFO L93 Difference]: Finished difference Result 284 states and 306 transitions. [2018-04-11 21:46:35,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 21:46:35,991 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-04-11 21:46:35,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:46:35,993 INFO L225 Difference]: With dead ends: 284 [2018-04-11 21:46:35,993 INFO L226 Difference]: Without dead ends: 284 [2018-04-11 21:46:35,993 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-11 21:46:35,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-04-11 21:46:35,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 204. [2018-04-11 21:46:35,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-04-11 21:46:35,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 220 transitions. [2018-04-11 21:46:36,000 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 220 transitions. Word has length 14 [2018-04-11 21:46:36,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:46:36,000 INFO L459 AbstractCegarLoop]: Abstraction has 204 states and 220 transitions. [2018-04-11 21:46:36,000 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 21:46:36,000 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 220 transitions. [2018-04-11 21:46:36,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-11 21:46:36,000 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:46:36,001 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:46:36,001 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:46:36,001 INFO L82 PathProgramCache]: Analyzing trace with hash -848494061, now seen corresponding path program 1 times [2018-04-11 21:46:36,001 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:46:36,001 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:46:36,002 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:46:36,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:46:36,002 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:46:36,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:46:36,022 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:46:36,069 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 21:46:36,069 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:46:36,069 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 21:46:36,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 21:46:36,069 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 21:46:36,069 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 21:46:36,069 INFO L87 Difference]: Start difference. First operand 204 states and 220 transitions. Second operand 5 states. [2018-04-11 21:46:36,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:46:36,257 INFO L93 Difference]: Finished difference Result 327 states and 357 transitions. [2018-04-11 21:46:36,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 21:46:36,258 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-04-11 21:46:36,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:46:36,259 INFO L225 Difference]: With dead ends: 327 [2018-04-11 21:46:36,259 INFO L226 Difference]: Without dead ends: 327 [2018-04-11 21:46:36,259 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-11 21:46:36,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-04-11 21:46:36,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 203. [2018-04-11 21:46:36,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-04-11 21:46:36,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 219 transitions. [2018-04-11 21:46:36,264 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 219 transitions. Word has length 14 [2018-04-11 21:46:36,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:46:36,265 INFO L459 AbstractCegarLoop]: Abstraction has 203 states and 219 transitions. [2018-04-11 21:46:36,265 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 21:46:36,265 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 219 transitions. [2018-04-11 21:46:36,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-11 21:46:36,265 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:46:36,265 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:46:36,265 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:46:36,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1899641121, now seen corresponding path program 1 times [2018-04-11 21:46:36,266 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:46:36,266 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:46:36,267 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:46:36,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:46:36,267 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:46:36,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:46:36,282 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:46:36,348 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 21:46:36,348 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:46:36,348 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 21:46:36,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 21:46:36,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 21:46:36,348 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-11 21:46:36,349 INFO L87 Difference]: Start difference. First operand 203 states and 219 transitions. Second operand 8 states. [2018-04-11 21:46:36,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:46:36,809 INFO L93 Difference]: Finished difference Result 379 states and 415 transitions. [2018-04-11 21:46:36,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 21:46:36,809 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-04-11 21:46:36,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:46:36,811 INFO L225 Difference]: With dead ends: 379 [2018-04-11 21:46:36,811 INFO L226 Difference]: Without dead ends: 379 [2018-04-11 21:46:36,811 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-04-11 21:46:36,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-04-11 21:46:36,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 210. [2018-04-11 21:46:36,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-04-11 21:46:36,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 228 transitions. [2018-04-11 21:46:36,816 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 228 transitions. Word has length 22 [2018-04-11 21:46:36,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:46:36,816 INFO L459 AbstractCegarLoop]: Abstraction has 210 states and 228 transitions. [2018-04-11 21:46:36,816 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 21:46:36,817 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 228 transitions. [2018-04-11 21:46:36,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-11 21:46:36,817 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:46:36,817 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:46:36,817 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:46:36,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1899641120, now seen corresponding path program 1 times [2018-04-11 21:46:36,818 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:46:36,818 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:46:36,818 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:46:36,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:46:36,821 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:46:36,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:46:36,835 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:46:36,938 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 21:46:36,939 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:46:36,939 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 21:46:36,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 21:46:36,939 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 21:46:36,939 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-11 21:46:36,940 INFO L87 Difference]: Start difference. First operand 210 states and 228 transitions. Second operand 8 states. [2018-04-11 21:46:37,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:46:37,437 INFO L93 Difference]: Finished difference Result 575 states and 631 transitions. [2018-04-11 21:46:37,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 21:46:37,438 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-04-11 21:46:37,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:46:37,439 INFO L225 Difference]: With dead ends: 575 [2018-04-11 21:46:37,439 INFO L226 Difference]: Without dead ends: 575 [2018-04-11 21:46:37,439 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-04-11 21:46:37,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2018-04-11 21:46:37,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 210. [2018-04-11 21:46:37,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-04-11 21:46:37,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 227 transitions. [2018-04-11 21:46:37,445 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 227 transitions. Word has length 22 [2018-04-11 21:46:37,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:46:37,446 INFO L459 AbstractCegarLoop]: Abstraction has 210 states and 227 transitions. [2018-04-11 21:46:37,446 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 21:46:37,446 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 227 transitions. [2018-04-11 21:46:37,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-11 21:46:37,446 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:46:37,446 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:46:37,446 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:46:37,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1206347211, now seen corresponding path program 1 times [2018-04-11 21:46:37,446 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:46:37,446 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:46:37,447 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:46:37,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:46:37,447 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:46:37,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:46:37,455 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:46:37,480 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 21:46:37,480 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:46:37,480 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 21:46:37,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 21:46:37,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 21:46:37,481 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 21:46:37,481 INFO L87 Difference]: Start difference. First operand 210 states and 227 transitions. Second operand 4 states. [2018-04-11 21:46:37,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:46:37,617 INFO L93 Difference]: Finished difference Result 283 states and 307 transitions. [2018-04-11 21:46:37,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 21:46:37,617 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-04-11 21:46:37,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:46:37,618 INFO L225 Difference]: With dead ends: 283 [2018-04-11 21:46:37,618 INFO L226 Difference]: Without dead ends: 283 [2018-04-11 21:46:37,618 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 21:46:37,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-04-11 21:46:37,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 203. [2018-04-11 21:46:37,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-04-11 21:46:37,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 224 transitions. [2018-04-11 21:46:37,621 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 224 transitions. Word has length 23 [2018-04-11 21:46:37,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:46:37,621 INFO L459 AbstractCegarLoop]: Abstraction has 203 states and 224 transitions. [2018-04-11 21:46:37,621 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 21:46:37,621 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 224 transitions. [2018-04-11 21:46:37,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-11 21:46:37,621 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:46:37,621 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:46:37,621 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:46:37,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1206347212, now seen corresponding path program 1 times [2018-04-11 21:46:37,622 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:46:37,622 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:46:37,622 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:46:37,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:46:37,622 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:46:37,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:46:37,631 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:46:37,680 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 21:46:37,681 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:46:37,681 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 21:46:37,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 21:46:37,681 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 21:46:37,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-11 21:46:37,681 INFO L87 Difference]: Start difference. First operand 203 states and 224 transitions. Second operand 6 states. [2018-04-11 21:46:37,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:46:37,895 INFO L93 Difference]: Finished difference Result 488 states and 542 transitions. [2018-04-11 21:46:37,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 21:46:37,895 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-04-11 21:46:37,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:46:37,896 INFO L225 Difference]: With dead ends: 488 [2018-04-11 21:46:37,896 INFO L226 Difference]: Without dead ends: 488 [2018-04-11 21:46:37,896 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-04-11 21:46:37,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-04-11 21:46:37,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 366. [2018-04-11 21:46:37,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-04-11 21:46:37,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 491 transitions. [2018-04-11 21:46:37,907 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 491 transitions. Word has length 23 [2018-04-11 21:46:37,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:46:37,908 INFO L459 AbstractCegarLoop]: Abstraction has 366 states and 491 transitions. [2018-04-11 21:46:37,909 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 21:46:37,909 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 491 transitions. [2018-04-11 21:46:37,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-11 21:46:37,909 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:46:37,909 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:46:37,909 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:46:37,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1240667406, now seen corresponding path program 1 times [2018-04-11 21:46:37,910 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:46:37,910 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:46:37,910 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:46:37,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:46:37,910 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:46:37,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:46:37,916 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:46:37,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:46:37,950 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:46:37,951 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 21:46:37,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 21:46:37,951 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 21:46:37,951 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 21:46:37,951 INFO L87 Difference]: Start difference. First operand 366 states and 491 transitions. Second operand 4 states. [2018-04-11 21:46:38,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:46:38,207 INFO L93 Difference]: Finished difference Result 906 states and 1231 transitions. [2018-04-11 21:46:38,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 21:46:38,208 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-04-11 21:46:38,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:46:38,211 INFO L225 Difference]: With dead ends: 906 [2018-04-11 21:46:38,211 INFO L226 Difference]: Without dead ends: 906 [2018-04-11 21:46:38,211 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 21:46:38,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2018-04-11 21:46:38,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 364. [2018-04-11 21:46:38,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-04-11 21:46:38,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 486 transitions. [2018-04-11 21:46:38,221 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 486 transitions. Word has length 23 [2018-04-11 21:46:38,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:46:38,221 INFO L459 AbstractCegarLoop]: Abstraction has 364 states and 486 transitions. [2018-04-11 21:46:38,221 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 21:46:38,221 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 486 transitions. [2018-04-11 21:46:38,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-11 21:46:38,222 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:46:38,222 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:46:38,222 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:46:38,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1240667407, now seen corresponding path program 1 times [2018-04-11 21:46:38,222 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:46:38,222 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:46:38,223 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:46:38,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:46:38,223 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:46:38,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:46:38,231 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:46:38,255 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 21:46:38,255 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:46:38,255 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 21:46:38,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 21:46:38,256 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 21:46:38,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 21:46:38,256 INFO L87 Difference]: Start difference. First operand 364 states and 486 transitions. Second operand 4 states. [2018-04-11 21:46:38,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:46:38,465 INFO L93 Difference]: Finished difference Result 750 states and 1035 transitions. [2018-04-11 21:46:38,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 21:46:38,465 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-04-11 21:46:38,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:46:38,468 INFO L225 Difference]: With dead ends: 750 [2018-04-11 21:46:38,468 INFO L226 Difference]: Without dead ends: 750 [2018-04-11 21:46:38,468 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 21:46:38,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2018-04-11 21:46:38,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 363. [2018-04-11 21:46:38,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-04-11 21:46:38,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 485 transitions. [2018-04-11 21:46:38,476 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 485 transitions. Word has length 23 [2018-04-11 21:46:38,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:46:38,476 INFO L459 AbstractCegarLoop]: Abstraction has 363 states and 485 transitions. [2018-04-11 21:46:38,476 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 21:46:38,476 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 485 transitions. [2018-04-11 21:46:38,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-11 21:46:38,477 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:46:38,477 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:46:38,477 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:46:38,477 INFO L82 PathProgramCache]: Analyzing trace with hash -339091572, now seen corresponding path program 1 times [2018-04-11 21:46:38,477 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:46:38,478 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:46:38,478 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:46:38,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:46:38,478 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:46:38,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:46:38,484 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:46:38,498 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 21:46:38,499 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:46:38,499 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 21:46:38,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 21:46:38,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 21:46:38,499 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 21:46:38,499 INFO L87 Difference]: Start difference. First operand 363 states and 485 transitions. Second operand 4 states. [2018-04-11 21:46:38,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:46:38,519 INFO L93 Difference]: Finished difference Result 439 states and 565 transitions. [2018-04-11 21:46:38,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 21:46:38,520 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-04-11 21:46:38,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:46:38,521 INFO L225 Difference]: With dead ends: 439 [2018-04-11 21:46:38,521 INFO L226 Difference]: Without dead ends: 439 [2018-04-11 21:46:38,521 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 21:46:38,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2018-04-11 21:46:38,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 408. [2018-04-11 21:46:38,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-04-11 21:46:38,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 565 transitions. [2018-04-11 21:46:38,528 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 565 transitions. Word has length 25 [2018-04-11 21:46:38,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:46:38,529 INFO L459 AbstractCegarLoop]: Abstraction has 408 states and 565 transitions. [2018-04-11 21:46:38,529 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 21:46:38,529 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 565 transitions. [2018-04-11 21:46:38,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-11 21:46:38,529 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:46:38,529 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:46:38,530 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:46:38,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1765841307, now seen corresponding path program 1 times [2018-04-11 21:46:38,530 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:46:38,530 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:46:38,531 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:46:38,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:46:38,531 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:46:38,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:46:38,541 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:46:38,595 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 21:46:38,595 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:46:38,595 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 21:46:38,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 21:46:38,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 21:46:38,596 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-04-11 21:46:38,596 INFO L87 Difference]: Start difference. First operand 408 states and 565 transitions. Second operand 9 states. [2018-04-11 21:46:39,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:46:39,273 INFO L93 Difference]: Finished difference Result 1333 states and 1860 transitions. [2018-04-11 21:46:39,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 21:46:39,273 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-04-11 21:46:39,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:46:39,277 INFO L225 Difference]: With dead ends: 1333 [2018-04-11 21:46:39,277 INFO L226 Difference]: Without dead ends: 1333 [2018-04-11 21:46:39,277 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-04-11 21:46:39,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2018-04-11 21:46:39,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 407. [2018-04-11 21:46:39,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2018-04-11 21:46:39,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 564 transitions. [2018-04-11 21:46:39,288 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 564 transitions. Word has length 26 [2018-04-11 21:46:39,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:46:39,288 INFO L459 AbstractCegarLoop]: Abstraction has 407 states and 564 transitions. [2018-04-11 21:46:39,289 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 21:46:39,289 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 564 transitions. [2018-04-11 21:46:39,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-11 21:46:39,289 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:46:39,289 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:46:39,289 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:46:39,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1765841306, now seen corresponding path program 1 times [2018-04-11 21:46:39,290 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:46:39,290 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:46:39,290 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:46:39,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:46:39,290 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:46:39,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:46:39,300 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:46:39,363 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 21:46:39,364 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:46:39,364 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 21:46:39,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 21:46:39,364 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 21:46:39,364 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-04-11 21:46:39,364 INFO L87 Difference]: Start difference. First operand 407 states and 564 transitions. Second operand 9 states. [2018-04-11 21:46:40,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:46:40,194 INFO L93 Difference]: Finished difference Result 1332 states and 1859 transitions. [2018-04-11 21:46:40,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 21:46:40,194 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-04-11 21:46:40,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:46:40,198 INFO L225 Difference]: With dead ends: 1332 [2018-04-11 21:46:40,199 INFO L226 Difference]: Without dead ends: 1332 [2018-04-11 21:46:40,199 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2018-04-11 21:46:40,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332 states. [2018-04-11 21:46:40,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332 to 406. [2018-04-11 21:46:40,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2018-04-11 21:46:40,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 563 transitions. [2018-04-11 21:46:40,212 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 563 transitions. Word has length 26 [2018-04-11 21:46:40,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:46:40,212 INFO L459 AbstractCegarLoop]: Abstraction has 406 states and 563 transitions. [2018-04-11 21:46:40,212 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 21:46:40,213 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 563 transitions. [2018-04-11 21:46:40,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 21:46:40,213 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:46:40,213 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:46:40,213 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:46:40,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1476109501, now seen corresponding path program 1 times [2018-04-11 21:46:40,214 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:46:40,214 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:46:40,214 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:46:40,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:46:40,215 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:46:40,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:46:40,223 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:46:40,257 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 21:46:40,258 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:46:40,258 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 21:46:40,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 21:46:40,258 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 21:46:40,258 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 21:46:40,258 INFO L87 Difference]: Start difference. First operand 406 states and 563 transitions. Second operand 3 states. [2018-04-11 21:46:40,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:46:40,265 INFO L93 Difference]: Finished difference Result 410 states and 567 transitions. [2018-04-11 21:46:40,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 21:46:40,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-04-11 21:46:40,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:46:40,266 INFO L225 Difference]: With dead ends: 410 [2018-04-11 21:46:40,266 INFO L226 Difference]: Without dead ends: 410 [2018-04-11 21:46:40,267 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 21:46:40,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-04-11 21:46:40,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2018-04-11 21:46:40,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-04-11 21:46:40,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 567 transitions. [2018-04-11 21:46:40,273 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 567 transitions. Word has length 30 [2018-04-11 21:46:40,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:46:40,273 INFO L459 AbstractCegarLoop]: Abstraction has 410 states and 567 transitions. [2018-04-11 21:46:40,273 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 21:46:40,274 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 567 transitions. [2018-04-11 21:46:40,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-11 21:46:40,274 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:46:40,274 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:46:40,274 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:46:40,275 INFO L82 PathProgramCache]: Analyzing trace with hash -664022590, now seen corresponding path program 1 times [2018-04-11 21:46:40,275 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:46:40,275 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:46:40,275 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:46:40,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:46:40,276 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:46:40,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:46:40,282 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:46:40,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:46:40,292 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:46:40,292 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 21:46:40,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 21:46:40,293 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 21:46:40,293 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 21:46:40,293 INFO L87 Difference]: Start difference. First operand 410 states and 567 transitions. Second operand 3 states. [2018-04-11 21:46:40,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:46:40,299 INFO L93 Difference]: Finished difference Result 413 states and 570 transitions. [2018-04-11 21:46:40,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 21:46:40,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-04-11 21:46:40,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:46:40,301 INFO L225 Difference]: With dead ends: 413 [2018-04-11 21:46:40,301 INFO L226 Difference]: Without dead ends: 413 [2018-04-11 21:46:40,301 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 21:46:40,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-04-11 21:46:40,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2018-04-11 21:46:40,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-04-11 21:46:40,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 570 transitions. [2018-04-11 21:46:40,307 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 570 transitions. Word has length 31 [2018-04-11 21:46:40,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:46:40,308 INFO L459 AbstractCegarLoop]: Abstraction has 413 states and 570 transitions. [2018-04-11 21:46:40,308 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 21:46:40,308 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 570 transitions. [2018-04-11 21:46:40,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 21:46:40,308 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:46:40,308 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:46:40,309 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:46:40,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1251934904, now seen corresponding path program 1 times [2018-04-11 21:46:40,309 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:46:40,309 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:46:40,309 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:46:40,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:46:40,310 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:46:40,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:46:40,316 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:46:40,333 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 21:46:40,333 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:46:40,333 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 21:46:40,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 21:46:40,333 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 21:46:40,333 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 21:46:40,334 INFO L87 Difference]: Start difference. First operand 413 states and 570 transitions. Second operand 3 states. [2018-04-11 21:46:40,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:46:40,356 INFO L93 Difference]: Finished difference Result 456 states and 601 transitions. [2018-04-11 21:46:40,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 21:46:40,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-04-11 21:46:40,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:46:40,358 INFO L225 Difference]: With dead ends: 456 [2018-04-11 21:46:40,358 INFO L226 Difference]: Without dead ends: 456 [2018-04-11 21:46:40,358 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 21:46:40,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2018-04-11 21:46:40,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 401. [2018-04-11 21:46:40,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-04-11 21:46:40,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 547 transitions. [2018-04-11 21:46:40,364 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 547 transitions. Word has length 32 [2018-04-11 21:46:40,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:46:40,365 INFO L459 AbstractCegarLoop]: Abstraction has 401 states and 547 transitions. [2018-04-11 21:46:40,365 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 21:46:40,365 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 547 transitions. [2018-04-11 21:46:40,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 21:46:40,365 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:46:40,365 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:46:40,365 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:46:40,365 INFO L82 PathProgramCache]: Analyzing trace with hash -403555681, now seen corresponding path program 1 times [2018-04-11 21:46:40,366 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:46:40,366 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:46:40,366 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:46:40,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:46:40,366 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:46:40,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:46:40,374 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:46:40,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:46:40,486 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:46:40,486 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-11 21:46:40,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 21:46:40,486 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 21:46:40,487 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-04-11 21:46:40,487 INFO L87 Difference]: Start difference. First operand 401 states and 547 transitions. Second operand 10 states. [2018-04-11 21:46:40,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:46:40,941 INFO L93 Difference]: Finished difference Result 637 states and 808 transitions. [2018-04-11 21:46:40,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 21:46:40,941 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2018-04-11 21:46:40,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:46:40,943 INFO L225 Difference]: With dead ends: 637 [2018-04-11 21:46:40,943 INFO L226 Difference]: Without dead ends: 637 [2018-04-11 21:46:40,943 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2018-04-11 21:46:40,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2018-04-11 21:46:40,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 418. [2018-04-11 21:46:40,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2018-04-11 21:46:40,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 569 transitions. [2018-04-11 21:46:40,947 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 569 transitions. Word has length 33 [2018-04-11 21:46:40,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:46:40,947 INFO L459 AbstractCegarLoop]: Abstraction has 418 states and 569 transitions. [2018-04-11 21:46:40,947 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 21:46:40,947 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 569 transitions. [2018-04-11 21:46:40,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-11 21:46:40,948 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:46:40,948 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:46:40,948 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:46:40,948 INFO L82 PathProgramCache]: Analyzing trace with hash 932853160, now seen corresponding path program 1 times [2018-04-11 21:46:40,948 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:46:40,948 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:46:40,948 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:46:40,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:46:40,949 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:46:40,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:46:40,954 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:46:41,147 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:46:41,148 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 21:46:41,148 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 21:46:41,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:46:41,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:46:41,201 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:46:41,267 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 21:46:41,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:46:41,271 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:46:41,273 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:46:41,283 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 21:46:41,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:46:41,285 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:46:41,287 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:46:41,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:46:41,294 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-04-11 21:46:41,324 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 21:46:41,327 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:46:41,329 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 21:46:41,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:46:41,344 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:46:41,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 21:46:41,367 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:46:41,368 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 21:46:41,369 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:46:41,373 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:46:41,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:46:41,383 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:52, output treesize:44 [2018-04-11 21:46:41,414 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:46:41,414 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:46:41,415 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 21:46:41,415 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:46:41,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:46:41,425 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:43 [2018-04-11 21:46:41,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, 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 23 [2018-04-11 21:46:41,468 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:46:41,469 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:46:41,470 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:46:41,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-04-11 21:46:41,472 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:46:41,480 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:46:41,517 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 30 treesize of output 23 [2018-04-11 21:46:41,523 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:46:41,524 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:46:41,524 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:46:41,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-04-11 21:46:41,527 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:46:41,536 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:46:41,544 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 21:46:41,545 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:69, output treesize:49 [2018-04-11 21:46:41,595 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 40 treesize of output 41 [2018-04-11 21:46:41,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:46:41,597 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:46:41,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:46:41,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 57 [2018-04-11 21:46:41,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 14 treesize of output 13 [2018-04-11 21:46:41,627 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:46:41,633 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:46:41,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:46:41,646 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:95, output treesize:49 [2018-04-11 21:46:41,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2018-04-11 21:46:41,693 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:46:41,694 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:46:41,694 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:46:41,696 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 26 treesize of output 28 [2018-04-11 21:46:41,697 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:46:41,701 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:46:41,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-04-11 21:46:41,711 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:46:41,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-11 21:46:41,711 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:46:41,713 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:46:41,717 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 21:46:41,717 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:63, output treesize:7 [2018-04-11 21:46:41,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:46:41,758 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-11 21:46:41,758 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [13] total 24 [2018-04-11 21:46:41,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 21:46:41,759 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 21:46:41,759 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2018-04-11 21:46:41,759 INFO L87 Difference]: Start difference. First operand 418 states and 569 transitions. Second operand 24 states. [2018-04-11 21:46:43,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:46:43,555 INFO L93 Difference]: Finished difference Result 635 states and 804 transitions. [2018-04-11 21:46:43,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 21:46:43,555 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 34 [2018-04-11 21:46:43,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:46:43,557 INFO L225 Difference]: With dead ends: 635 [2018-04-11 21:46:43,557 INFO L226 Difference]: Without dead ends: 635 [2018-04-11 21:46:43,557 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=391, Invalid=1415, Unknown=0, NotChecked=0, Total=1806 [2018-04-11 21:46:43,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2018-04-11 21:46:43,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 467. [2018-04-11 21:46:43,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2018-04-11 21:46:43,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 648 transitions. [2018-04-11 21:46:43,564 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 648 transitions. Word has length 34 [2018-04-11 21:46:43,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:46:43,564 INFO L459 AbstractCegarLoop]: Abstraction has 467 states and 648 transitions. [2018-04-11 21:46:43,564 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 21:46:43,564 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 648 transitions. [2018-04-11 21:46:43,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-11 21:46:43,564 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:46:43,564 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:46:43,564 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:46:43,564 INFO L82 PathProgramCache]: Analyzing trace with hash -536384940, now seen corresponding path program 1 times [2018-04-11 21:46:43,565 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:46:43,565 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:46:43,565 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:46:43,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:46:43,565 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:46:43,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:46:43,576 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:46:43,677 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:46:43,677 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 21:46:43,677 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 21:46:43,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:46:43,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:46:43,702 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:46:43,708 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:46:43,709 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:46:43,709 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 21:46:43,709 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:46:43,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:46:43,711 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-04-11 21:46:43,716 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 21:46:43,717 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 21:46:43,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:46:43,718 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:46:43,721 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 21:46:43,722 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2018-04-11 21:46:43,742 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 34 treesize of output 28 [2018-04-11 21:46:43,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:46:43,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:46:43,747 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:46:43,771 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 21:46:43,772 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:16 [2018-04-11 21:46:43,778 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:46:43,778 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:46:43,779 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 21:46:43,779 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:46:43,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:46:43,782 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:15 [2018-04-11 21:46:43,790 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 22 treesize of output 23 [2018-04-11 21:46:43,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:46:43,793 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:46:43,796 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:46:43,799 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 21:46:43,799 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:15 [2018-04-11 21:46:43,823 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 45 treesize of output 39 [2018-04-11 21:46:43,825 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 21:46:43,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:46:43,829 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:46:43,833 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 21:46:43,833 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:36 [2018-04-11 21:46:43,873 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:46:43,874 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:46:43,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 39 [2018-04-11 21:46:43,875 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:46:43,884 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 21:46:43,884 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:47, output treesize:51 [2018-04-11 21:46:43,919 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 55 treesize of output 39 [2018-04-11 21:46:43,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-04-11 21:46:43,921 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:46:43,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 14 [2018-04-11 21:46:43,926 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:46:43,929 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:46:43,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:46:43,933 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:60, output treesize:15 [2018-04-11 21:46:43,954 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:46:43,978 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 21:46:43,978 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 17 [2018-04-11 21:46:43,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 21:46:43,979 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 21:46:43,979 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-04-11 21:46:43,979 INFO L87 Difference]: Start difference. First operand 467 states and 648 transitions. Second operand 18 states. [2018-04-11 21:46:54,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:46:54,656 INFO L93 Difference]: Finished difference Result 788 states and 1022 transitions. [2018-04-11 21:46:54,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 21:46:54,656 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2018-04-11 21:46:54,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:46:54,657 INFO L225 Difference]: With dead ends: 788 [2018-04-11 21:46:54,657 INFO L226 Difference]: Without dead ends: 788 [2018-04-11 21:46:54,658 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 28 SyntacticMatches, 6 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=200, Invalid=670, Unknown=0, NotChecked=0, Total=870 [2018-04-11 21:46:54,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2018-04-11 21:46:54,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 466. [2018-04-11 21:46:54,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2018-04-11 21:46:54,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 647 transitions. [2018-04-11 21:46:54,663 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 647 transitions. Word has length 34 [2018-04-11 21:46:54,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:46:54,663 INFO L459 AbstractCegarLoop]: Abstraction has 466 states and 647 transitions. [2018-04-11 21:46:54,663 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 21:46:54,663 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 647 transitions. [2018-04-11 21:46:54,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-11 21:46:54,663 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:46:54,663 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:46:54,663 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:46:54,664 INFO L82 PathProgramCache]: Analyzing trace with hash -536384939, now seen corresponding path program 1 times [2018-04-11 21:46:54,664 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:46:54,664 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:46:54,664 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:46:54,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:46:54,664 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:46:54,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:46:54,674 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:46:54,830 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:46:54,830 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 21:46:54,830 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 21:46:54,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:46:54,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:46:54,857 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:46:54,863 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:46:54,864 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:46:54,864 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 21:46:54,864 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:46:54,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:46:54,872 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-04-11 21:46:54,883 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 21:46:54,884 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 21:46:54,884 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:46:54,885 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:46:54,888 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 21:46:54,888 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2018-04-11 21:46:54,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-04-11 21:46:54,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:46:54,911 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:46:54,913 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:46:54,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 21:46:54,916 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:16 [2018-04-11 21:46:54,918 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:46:54,919 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:46:54,919 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 21:46:54,919 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:46:54,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:46:54,921 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:15 [2018-04-11 21:46:54,976 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 31 treesize of output 32 [2018-04-11 21:46:54,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:46:54,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:46:54,981 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:46:54,990 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 41 treesize of output 42 [2018-04-11 21:46:54,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:46:54,992 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:46:54,996 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:46:55,002 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 21:46:55,002 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:59, output treesize:37 [2018-04-11 21:46:55,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 81 [2018-04-11 21:46:55,059 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 21:46:55,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:46:55,070 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:46:55,086 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 52 treesize of output 53 [2018-04-11 21:46:55,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:46:55,090 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:46:55,095 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:46:55,104 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 21:46:55,105 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:106, output treesize:80 [2018-04-11 21:46:55,134 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:46:55,135 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 21:46:55,135 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:46:55,149 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:46:55,150 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:46:55,150 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 17 treesize of output 10 [2018-04-11 21:46:55,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:46:55,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 21:46:55,160 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:91, output treesize:84 [2018-04-11 21:46:55,193 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 76 treesize of output 58 [2018-04-11 21:46:55,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-04-11 21:46:55,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:46:55,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 29 [2018-04-11 21:46:55,212 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:46:55,217 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:46:55,226 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 39 treesize of output 35 [2018-04-11 21:46:55,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2018-04-11 21:46:55,228 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 21:46:55,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-11 21:46:55,233 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 21:46:55,235 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:46:55,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:46:55,240 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:102, output treesize:20 [2018-04-11 21:46:55,259 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:46:55,276 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 21:46:55,276 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 24 [2018-04-11 21:46:55,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 21:46:55,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 21:46:55,276 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2018-04-11 21:46:55,276 INFO L87 Difference]: Start difference. First operand 466 states and 647 transitions. Second operand 25 states. [2018-04-11 21:46:56,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:46:56,819 INFO L93 Difference]: Finished difference Result 913 states and 1159 transitions. [2018-04-11 21:46:56,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 21:46:56,819 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 34 [2018-04-11 21:46:56,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:46:56,821 INFO L225 Difference]: With dead ends: 913 [2018-04-11 21:46:56,821 INFO L226 Difference]: Without dead ends: 913 [2018-04-11 21:46:56,821 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=466, Invalid=1514, Unknown=0, NotChecked=0, Total=1980 [2018-04-11 21:46:56,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2018-04-11 21:46:56,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 461. [2018-04-11 21:46:56,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2018-04-11 21:46:56,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 642 transitions. [2018-04-11 21:46:56,828 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 642 transitions. Word has length 34 [2018-04-11 21:46:56,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:46:56,829 INFO L459 AbstractCegarLoop]: Abstraction has 461 states and 642 transitions. [2018-04-11 21:46:56,829 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 21:46:56,829 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 642 transitions. [2018-04-11 21:46:56,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-11 21:46:56,829 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:46:56,829 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:46:56,829 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:46:56,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1086725402, now seen corresponding path program 1 times [2018-04-11 21:46:56,830 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:46:56,830 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:46:56,830 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:46:56,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:46:56,831 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:46:56,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:46:56,839 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:46:56,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:46:56,929 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:46:56,929 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-11 21:46:56,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 21:46:56,930 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 21:46:56,930 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-04-11 21:46:56,930 INFO L87 Difference]: Start difference. First operand 461 states and 642 transitions. Second operand 11 states. [2018-04-11 21:46:57,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:46:57,340 INFO L93 Difference]: Finished difference Result 708 states and 921 transitions. [2018-04-11 21:46:57,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 21:46:57,341 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2018-04-11 21:46:57,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:46:57,342 INFO L225 Difference]: With dead ends: 708 [2018-04-11 21:46:57,342 INFO L226 Difference]: Without dead ends: 708 [2018-04-11 21:46:57,342 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=175, Invalid=475, Unknown=0, NotChecked=0, Total=650 [2018-04-11 21:46:57,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2018-04-11 21:46:57,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 471. [2018-04-11 21:46:57,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-04-11 21:46:57,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 654 transitions. [2018-04-11 21:46:57,347 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 654 transitions. Word has length 35 [2018-04-11 21:46:57,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:46:57,347 INFO L459 AbstractCegarLoop]: Abstraction has 471 states and 654 transitions. [2018-04-11 21:46:57,347 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 21:46:57,347 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 654 transitions. [2018-04-11 21:46:57,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-11 21:46:57,347 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:46:57,347 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:46:57,347 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:46:57,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1086725401, now seen corresponding path program 1 times [2018-04-11 21:46:57,347 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:46:57,348 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:46:57,348 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:46:57,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:46:57,348 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:46:57,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:46:57,353 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:46:57,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:46:57,495 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:46:57,495 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-11 21:46:57,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 21:46:57,495 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 21:46:57,496 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-04-11 21:46:57,496 INFO L87 Difference]: Start difference. First operand 471 states and 654 transitions. Second operand 11 states. [2018-04-11 21:46:58,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:46:58,092 INFO L93 Difference]: Finished difference Result 905 states and 1184 transitions. [2018-04-11 21:46:58,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 21:46:58,092 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2018-04-11 21:46:58,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:46:58,094 INFO L225 Difference]: With dead ends: 905 [2018-04-11 21:46:58,094 INFO L226 Difference]: Without dead ends: 905 [2018-04-11 21:46:58,094 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2018-04-11 21:46:58,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2018-04-11 21:46:58,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 471. [2018-04-11 21:46:58,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-04-11 21:46:58,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 653 transitions. [2018-04-11 21:46:58,099 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 653 transitions. Word has length 35 [2018-04-11 21:46:58,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:46:58,099 INFO L459 AbstractCegarLoop]: Abstraction has 471 states and 653 transitions. [2018-04-11 21:46:58,099 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 21:46:58,099 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 653 transitions. [2018-04-11 21:46:58,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-11 21:46:58,099 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:46:58,099 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:46:58,099 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:46:58,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1464376684, now seen corresponding path program 1 times [2018-04-11 21:46:58,099 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:46:58,099 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:46:58,100 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:46:58,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:46:58,100 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:46:58,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:46:58,105 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:46:58,115 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 21:46:58,115 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:46:58,115 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 21:46:58,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 21:46:58,115 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 21:46:58,115 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 21:46:58,115 INFO L87 Difference]: Start difference. First operand 471 states and 653 transitions. Second operand 4 states. [2018-04-11 21:46:58,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:46:58,297 INFO L93 Difference]: Finished difference Result 1198 states and 1675 transitions. [2018-04-11 21:46:58,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 21:46:58,297 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-04-11 21:46:58,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:46:58,299 INFO L225 Difference]: With dead ends: 1198 [2018-04-11 21:46:58,299 INFO L226 Difference]: Without dead ends: 1198 [2018-04-11 21:46:58,299 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 21:46:58,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2018-04-11 21:46:58,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 468. [2018-04-11 21:46:58,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2018-04-11 21:46:58,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 651 transitions. [2018-04-11 21:46:58,307 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 651 transitions. Word has length 35 [2018-04-11 21:46:58,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:46:58,307 INFO L459 AbstractCegarLoop]: Abstraction has 468 states and 651 transitions. [2018-04-11 21:46:58,307 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 21:46:58,307 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 651 transitions. [2018-04-11 21:46:58,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-11 21:46:58,308 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:46:58,308 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:46:58,308 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:46:58,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1464376685, now seen corresponding path program 1 times [2018-04-11 21:46:58,308 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:46:58,308 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:46:58,309 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:46:58,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:46:58,309 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:46:58,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:46:58,316 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:46:58,346 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 21:46:58,346 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:46:58,346 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 21:46:58,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 21:46:58,347 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 21:46:58,347 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 21:46:58,347 INFO L87 Difference]: Start difference. First operand 468 states and 651 transitions. Second operand 4 states. [2018-04-11 21:46:58,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:46:58,446 INFO L93 Difference]: Finished difference Result 470 states and 652 transitions. [2018-04-11 21:46:58,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 21:46:58,446 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-04-11 21:46:58,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:46:58,447 INFO L225 Difference]: With dead ends: 470 [2018-04-11 21:46:58,447 INFO L226 Difference]: Without dead ends: 470 [2018-04-11 21:46:58,448 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 21:46:58,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-04-11 21:46:58,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 469. [2018-04-11 21:46:58,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2018-04-11 21:46:58,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 651 transitions. [2018-04-11 21:46:58,452 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 651 transitions. Word has length 35 [2018-04-11 21:46:58,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:46:58,452 INFO L459 AbstractCegarLoop]: Abstraction has 469 states and 651 transitions. [2018-04-11 21:46:58,452 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 21:46:58,452 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 651 transitions. [2018-04-11 21:46:58,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-11 21:46:58,453 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:46:58,453 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:46:58,453 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:46:58,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1293426211, now seen corresponding path program 1 times [2018-04-11 21:46:58,453 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:46:58,453 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:46:58,454 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:46:58,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:46:58,454 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:46:58,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:46:58,460 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:46:58,501 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:46:58,501 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:46:58,501 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 21:46:58,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 21:46:58,502 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 21:46:58,502 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-11 21:46:58,502 INFO L87 Difference]: Start difference. First operand 469 states and 651 transitions. Second operand 6 states. [2018-04-11 21:46:58,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:46:58,617 INFO L93 Difference]: Finished difference Result 581 states and 813 transitions. [2018-04-11 21:46:58,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 21:46:58,617 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-04-11 21:46:58,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:46:58,618 INFO L225 Difference]: With dead ends: 581 [2018-04-11 21:46:58,618 INFO L226 Difference]: Without dead ends: 581 [2018-04-11 21:46:58,618 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-04-11 21:46:58,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2018-04-11 21:46:58,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 478. [2018-04-11 21:46:58,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2018-04-11 21:46:58,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 663 transitions. [2018-04-11 21:46:58,622 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 663 transitions. Word has length 36 [2018-04-11 21:46:58,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:46:58,622 INFO L459 AbstractCegarLoop]: Abstraction has 478 states and 663 transitions. [2018-04-11 21:46:58,622 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 21:46:58,622 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 663 transitions. [2018-04-11 21:46:58,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-11 21:46:58,622 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:46:58,622 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:46:58,622 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:46:58,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1299151849, now seen corresponding path program 1 times [2018-04-11 21:46:58,623 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:46:58,623 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:46:58,623 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:46:58,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:46:58,623 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:46:58,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:46:58,631 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:46:58,788 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:46:58,788 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:46:58,788 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-04-11 21:46:58,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 21:46:58,788 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 21:46:58,789 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-04-11 21:46:58,789 INFO L87 Difference]: Start difference. First operand 478 states and 663 transitions. Second operand 13 states. [2018-04-11 21:46:59,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:46:59,294 INFO L93 Difference]: Finished difference Result 608 states and 812 transitions. [2018-04-11 21:46:59,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 21:46:59,311 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2018-04-11 21:46:59,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:46:59,312 INFO L225 Difference]: With dead ends: 608 [2018-04-11 21:46:59,312 INFO L226 Difference]: Without dead ends: 608 [2018-04-11 21:46:59,312 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2018-04-11 21:46:59,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-04-11 21:46:59,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 432. [2018-04-11 21:46:59,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2018-04-11 21:46:59,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 586 transitions. [2018-04-11 21:46:59,315 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 586 transitions. Word has length 36 [2018-04-11 21:46:59,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:46:59,315 INFO L459 AbstractCegarLoop]: Abstraction has 432 states and 586 transitions. [2018-04-11 21:46:59,315 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 21:46:59,315 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 586 transitions. [2018-04-11 21:46:59,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 21:46:59,316 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:46:59,316 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:46:59,316 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:46:59,316 INFO L82 PathProgramCache]: Analyzing trace with hash 827290309, now seen corresponding path program 1 times [2018-04-11 21:46:59,316 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:46:59,316 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:46:59,316 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:46:59,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:46:59,316 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:46:59,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:46:59,321 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:46:59,424 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 21:46:59,425 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:46:59,425 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-11 21:46:59,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 21:46:59,425 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 21:46:59,425 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-04-11 21:46:59,425 INFO L87 Difference]: Start difference. First operand 432 states and 586 transitions. Second operand 11 states. [2018-04-11 21:46:59,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:46:59,873 INFO L93 Difference]: Finished difference Result 644 states and 817 transitions. [2018-04-11 21:46:59,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 21:46:59,873 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-04-11 21:46:59,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:46:59,874 INFO L225 Difference]: With dead ends: 644 [2018-04-11 21:46:59,875 INFO L226 Difference]: Without dead ends: 644 [2018-04-11 21:46:59,875 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=404, Unknown=0, NotChecked=0, Total=552 [2018-04-11 21:46:59,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2018-04-11 21:46:59,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 435. [2018-04-11 21:46:59,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-04-11 21:46:59,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 590 transitions. [2018-04-11 21:46:59,878 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 590 transitions. Word has length 38 [2018-04-11 21:46:59,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:46:59,878 INFO L459 AbstractCegarLoop]: Abstraction has 435 states and 590 transitions. [2018-04-11 21:46:59,878 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 21:46:59,878 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 590 transitions. [2018-04-11 21:46:59,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 21:46:59,878 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:46:59,878 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:46:59,878 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:46:59,879 INFO L82 PathProgramCache]: Analyzing trace with hash 827291432, now seen corresponding path program 1 times [2018-04-11 21:46:59,879 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:46:59,879 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:46:59,879 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:46:59,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:46:59,879 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:46:59,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:46:59,883 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:46:59,896 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 21:46:59,897 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:46:59,897 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 21:46:59,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 21:46:59,897 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 21:46:59,897 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 21:46:59,897 INFO L87 Difference]: Start difference. First operand 435 states and 590 transitions. Second operand 5 states. [2018-04-11 21:47:00,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:47:00,022 INFO L93 Difference]: Finished difference Result 434 states and 586 transitions. [2018-04-11 21:47:00,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 21:47:00,023 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-04-11 21:47:00,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:47:00,023 INFO L225 Difference]: With dead ends: 434 [2018-04-11 21:47:00,024 INFO L226 Difference]: Without dead ends: 434 [2018-04-11 21:47:00,024 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-11 21:47:00,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-04-11 21:47:00,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2018-04-11 21:47:00,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-04-11 21:47:00,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 586 transitions. [2018-04-11 21:47:00,026 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 586 transitions. Word has length 38 [2018-04-11 21:47:00,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:47:00,027 INFO L459 AbstractCegarLoop]: Abstraction has 434 states and 586 transitions. [2018-04-11 21:47:00,027 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 21:47:00,027 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 586 transitions. [2018-04-11 21:47:00,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 21:47:00,027 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:47:00,027 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:47:00,027 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:47:00,027 INFO L82 PathProgramCache]: Analyzing trace with hash 827291433, now seen corresponding path program 1 times [2018-04-11 21:47:00,027 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:47:00,027 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:47:00,028 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:47:00,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:47:00,028 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:47:00,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:47:00,032 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:47:00,111 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 21:47:00,111 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:47:00,111 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 21:47:00,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 21:47:00,112 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 21:47:00,112 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 21:47:00,112 INFO L87 Difference]: Start difference. First operand 434 states and 586 transitions. Second operand 5 states. [2018-04-11 21:47:00,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:47:00,255 INFO L93 Difference]: Finished difference Result 433 states and 582 transitions. [2018-04-11 21:47:00,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 21:47:00,256 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-04-11 21:47:00,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:47:00,256 INFO L225 Difference]: With dead ends: 433 [2018-04-11 21:47:00,256 INFO L226 Difference]: Without dead ends: 433 [2018-04-11 21:47:00,257 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-11 21:47:00,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2018-04-11 21:47:00,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 433. [2018-04-11 21:47:00,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-04-11 21:47:00,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 582 transitions. [2018-04-11 21:47:00,259 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 582 transitions. Word has length 38 [2018-04-11 21:47:00,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:47:00,259 INFO L459 AbstractCegarLoop]: Abstraction has 433 states and 582 transitions. [2018-04-11 21:47:00,260 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 21:47:00,260 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 582 transitions. [2018-04-11 21:47:00,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 21:47:00,260 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:47:00,260 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:47:00,260 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:47:00,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1263089809, now seen corresponding path program 1 times [2018-04-11 21:47:00,260 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:47:00,260 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:47:00,261 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:47:00,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:47:00,261 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:47:00,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:47:00,267 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:47:00,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:47:00,298 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:47:00,298 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 21:47:00,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 21:47:00,298 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 21:47:00,298 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-04-11 21:47:00,298 INFO L87 Difference]: Start difference. First operand 433 states and 582 transitions. Second operand 6 states. [2018-04-11 21:47:00,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:47:00,544 INFO L93 Difference]: Finished difference Result 915 states and 1262 transitions. [2018-04-11 21:47:00,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 21:47:00,546 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2018-04-11 21:47:00,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:47:00,548 INFO L225 Difference]: With dead ends: 915 [2018-04-11 21:47:00,548 INFO L226 Difference]: Without dead ends: 915 [2018-04-11 21:47:00,548 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-04-11 21:47:00,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2018-04-11 21:47:00,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 437. [2018-04-11 21:47:00,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2018-04-11 21:47:00,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 586 transitions. [2018-04-11 21:47:00,554 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 586 transitions. Word has length 38 [2018-04-11 21:47:00,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:47:00,554 INFO L459 AbstractCegarLoop]: Abstraction has 437 states and 586 transitions. [2018-04-11 21:47:00,554 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 21:47:00,554 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 586 transitions. [2018-04-11 21:47:00,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-11 21:47:00,554 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:47:00,554 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:47:00,555 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:47:00,555 INFO L82 PathProgramCache]: Analyzing trace with hash -123803838, now seen corresponding path program 1 times [2018-04-11 21:47:00,555 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:47:00,555 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:47:00,556 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:47:00,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:47:00,556 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:47:00,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:47:00,561 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:47:00,584 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 21:47:00,584 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:47:00,584 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 21:47:00,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 21:47:00,584 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 21:47:00,584 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 21:47:00,585 INFO L87 Difference]: Start difference. First operand 437 states and 586 transitions. Second operand 5 states. [2018-04-11 21:47:00,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:47:00,727 INFO L93 Difference]: Finished difference Result 436 states and 582 transitions. [2018-04-11 21:47:00,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 21:47:00,727 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-04-11 21:47:00,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:47:00,728 INFO L225 Difference]: With dead ends: 436 [2018-04-11 21:47:00,728 INFO L226 Difference]: Without dead ends: 436 [2018-04-11 21:47:00,728 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-11 21:47:00,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-04-11 21:47:00,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 436. [2018-04-11 21:47:00,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2018-04-11 21:47:00,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 582 transitions. [2018-04-11 21:47:00,732 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 582 transitions. Word has length 39 [2018-04-11 21:47:00,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:47:00,733 INFO L459 AbstractCegarLoop]: Abstraction has 436 states and 582 transitions. [2018-04-11 21:47:00,733 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 21:47:00,733 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 582 transitions. [2018-04-11 21:47:00,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-11 21:47:00,733 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:47:00,733 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:47:00,733 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:47:00,734 INFO L82 PathProgramCache]: Analyzing trace with hash -247563480, now seen corresponding path program 1 times [2018-04-11 21:47:00,734 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:47:00,734 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:47:00,734 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:47:00,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:47:00,734 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:47:00,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:47:00,743 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:47:00,767 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 21:47:00,767 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:47:00,768 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 21:47:00,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 21:47:00,768 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 21:47:00,768 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 21:47:00,768 INFO L87 Difference]: Start difference. First operand 436 states and 582 transitions. Second operand 4 states. [2018-04-11 21:47:00,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:47:00,972 INFO L93 Difference]: Finished difference Result 1167 states and 1587 transitions. [2018-04-11 21:47:00,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 21:47:00,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-04-11 21:47:00,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:47:00,974 INFO L225 Difference]: With dead ends: 1167 [2018-04-11 21:47:00,974 INFO L226 Difference]: Without dead ends: 1167 [2018-04-11 21:47:00,975 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 21:47:00,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2018-04-11 21:47:00,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 435. [2018-04-11 21:47:00,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-04-11 21:47:00,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 581 transitions. [2018-04-11 21:47:00,980 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 581 transitions. Word has length 39 [2018-04-11 21:47:00,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:47:00,980 INFO L459 AbstractCegarLoop]: Abstraction has 435 states and 581 transitions. [2018-04-11 21:47:00,980 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 21:47:00,980 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 581 transitions. [2018-04-11 21:47:00,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-11 21:47:00,980 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:47:00,980 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:47:00,981 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:47:00,981 INFO L82 PathProgramCache]: Analyzing trace with hash -247563479, now seen corresponding path program 1 times [2018-04-11 21:47:00,981 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:47:00,981 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:47:00,981 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:47:00,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:47:00,982 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:47:00,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:47:00,988 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:47:01,015 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 21:47:01,015 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:47:01,016 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 21:47:01,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 21:47:01,016 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 21:47:01,016 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 21:47:01,016 INFO L87 Difference]: Start difference. First operand 435 states and 581 transitions. Second operand 4 states. [2018-04-11 21:47:01,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:47:01,100 INFO L93 Difference]: Finished difference Result 433 states and 579 transitions. [2018-04-11 21:47:01,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 21:47:01,100 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-04-11 21:47:01,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:47:01,101 INFO L225 Difference]: With dead ends: 433 [2018-04-11 21:47:01,101 INFO L226 Difference]: Without dead ends: 433 [2018-04-11 21:47:01,101 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 21:47:01,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2018-04-11 21:47:01,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 433. [2018-04-11 21:47:01,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-04-11 21:47:01,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 579 transitions. [2018-04-11 21:47:01,103 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 579 transitions. Word has length 39 [2018-04-11 21:47:01,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:47:01,104 INFO L459 AbstractCegarLoop]: Abstraction has 433 states and 579 transitions. [2018-04-11 21:47:01,104 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 21:47:01,104 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 579 transitions. [2018-04-11 21:47:01,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-11 21:47:01,104 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:47:01,104 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:47:01,104 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:47:01,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1316978381, now seen corresponding path program 1 times [2018-04-11 21:47:01,104 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:47:01,104 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:47:01,105 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:47:01,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:47:01,105 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:47:01,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:47:01,110 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:47:01,311 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 21:47:01,311 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:47:01,311 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-04-11 21:47:01,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 21:47:01,311 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 21:47:01,311 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-04-11 21:47:01,311 INFO L87 Difference]: Start difference. First operand 433 states and 579 transitions. Second operand 16 states. [2018-04-11 21:47:02,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:47:02,134 INFO L93 Difference]: Finished difference Result 781 states and 971 transitions. [2018-04-11 21:47:02,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 21:47:02,134 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2018-04-11 21:47:02,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:47:02,135 INFO L225 Difference]: With dead ends: 781 [2018-04-11 21:47:02,135 INFO L226 Difference]: Without dead ends: 781 [2018-04-11 21:47:02,136 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=729, Unknown=0, NotChecked=0, Total=870 [2018-04-11 21:47:02,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2018-04-11 21:47:02,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 438. [2018-04-11 21:47:02,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-04-11 21:47:02,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 585 transitions. [2018-04-11 21:47:02,139 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 585 transitions. Word has length 41 [2018-04-11 21:47:02,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:47:02,139 INFO L459 AbstractCegarLoop]: Abstraction has 438 states and 585 transitions. [2018-04-11 21:47:02,139 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 21:47:02,139 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 585 transitions. [2018-04-11 21:47:02,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-11 21:47:02,140 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:47:02,140 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:47:02,140 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:47:02,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1316978382, now seen corresponding path program 1 times [2018-04-11 21:47:02,140 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:47:02,140 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:47:02,140 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:47:02,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:47:02,141 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:47:02,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:47:02,146 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:47:02,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:47:02,259 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:47:02,259 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-04-11 21:47:02,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 21:47:02,260 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 21:47:02,260 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-04-11 21:47:02,260 INFO L87 Difference]: Start difference. First operand 438 states and 585 transitions. Second operand 12 states. [2018-04-11 21:47:02,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:47:02,742 INFO L93 Difference]: Finished difference Result 613 states and 776 transitions. [2018-04-11 21:47:02,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 21:47:02,742 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-04-11 21:47:02,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:47:02,744 INFO L225 Difference]: With dead ends: 613 [2018-04-11 21:47:02,744 INFO L226 Difference]: Without dead ends: 613 [2018-04-11 21:47:02,744 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2018-04-11 21:47:02,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2018-04-11 21:47:02,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 433. [2018-04-11 21:47:02,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-04-11 21:47:02,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 578 transitions. [2018-04-11 21:47:02,747 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 578 transitions. Word has length 41 [2018-04-11 21:47:02,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:47:02,747 INFO L459 AbstractCegarLoop]: Abstraction has 433 states and 578 transitions. [2018-04-11 21:47:02,747 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 21:47:02,747 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 578 transitions. [2018-04-11 21:47:02,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-11 21:47:02,747 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:47:02,747 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:47:02,747 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:47:02,747 INFO L82 PathProgramCache]: Analyzing trace with hash 500119061, now seen corresponding path program 1 times [2018-04-11 21:47:02,748 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:47:02,748 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:47:02,748 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:47:02,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:47:02,748 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:47:02,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:47:02,752 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:47:02,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:47:02,769 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:47:02,769 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 21:47:02,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 21:47:02,769 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 21:47:02,770 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 21:47:02,770 INFO L87 Difference]: Start difference. First operand 433 states and 578 transitions. Second operand 5 states. [2018-04-11 21:47:02,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:47:02,916 INFO L93 Difference]: Finished difference Result 670 states and 898 transitions. [2018-04-11 21:47:02,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 21:47:02,916 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-04-11 21:47:02,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:47:02,918 INFO L225 Difference]: With dead ends: 670 [2018-04-11 21:47:02,918 INFO L226 Difference]: Without dead ends: 670 [2018-04-11 21:47:02,918 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-11 21:47:02,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2018-04-11 21:47:02,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 432. [2018-04-11 21:47:02,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2018-04-11 21:47:02,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 577 transitions. [2018-04-11 21:47:02,921 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 577 transitions. Word has length 41 [2018-04-11 21:47:02,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:47:02,921 INFO L459 AbstractCegarLoop]: Abstraction has 432 states and 577 transitions. [2018-04-11 21:47:02,921 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 21:47:02,921 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 577 transitions. [2018-04-11 21:47:02,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-11 21:47:02,921 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:47:02,921 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:47:02,921 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:47:02,921 INFO L82 PathProgramCache]: Analyzing trace with hash 500119062, now seen corresponding path program 1 times [2018-04-11 21:47:02,921 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:47:02,922 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:47:02,922 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:47:02,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:47:02,922 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:47:02,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:47:02,926 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:47:02,957 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 21:47:02,958 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:47:02,958 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 21:47:02,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 21:47:02,958 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 21:47:02,958 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 21:47:02,958 INFO L87 Difference]: Start difference. First operand 432 states and 577 transitions. Second operand 5 states. [2018-04-11 21:47:03,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:47:03,152 INFO L93 Difference]: Finished difference Result 664 states and 887 transitions. [2018-04-11 21:47:03,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 21:47:03,152 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-04-11 21:47:03,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:47:03,153 INFO L225 Difference]: With dead ends: 664 [2018-04-11 21:47:03,153 INFO L226 Difference]: Without dead ends: 664 [2018-04-11 21:47:03,153 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-11 21:47:03,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2018-04-11 21:47:03,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 431. [2018-04-11 21:47:03,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2018-04-11 21:47:03,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 576 transitions. [2018-04-11 21:47:03,156 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 576 transitions. Word has length 41 [2018-04-11 21:47:03,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:47:03,156 INFO L459 AbstractCegarLoop]: Abstraction has 431 states and 576 transitions. [2018-04-11 21:47:03,156 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 21:47:03,157 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 576 transitions. [2018-04-11 21:47:03,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-11 21:47:03,157 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:47:03,157 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:47:03,157 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:47:03,157 INFO L82 PathProgramCache]: Analyzing trace with hash -704663211, now seen corresponding path program 1 times [2018-04-11 21:47:03,157 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:47:03,157 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:47:03,158 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:47:03,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:47:03,158 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:47:03,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:47:03,164 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:47:03,192 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 21:47:03,192 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:47:03,193 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 21:47:03,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 21:47:03,193 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 21:47:03,193 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-04-11 21:47:03,193 INFO L87 Difference]: Start difference. First operand 431 states and 576 transitions. Second operand 5 states. [2018-04-11 21:47:03,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:47:03,411 INFO L93 Difference]: Finished difference Result 902 states and 1239 transitions. [2018-04-11 21:47:03,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 21:47:03,411 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-04-11 21:47:03,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:47:03,413 INFO L225 Difference]: With dead ends: 902 [2018-04-11 21:47:03,413 INFO L226 Difference]: Without dead ends: 902 [2018-04-11 21:47:03,413 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-04-11 21:47:03,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2018-04-11 21:47:03,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 422. [2018-04-11 21:47:03,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-04-11 21:47:03,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 567 transitions. [2018-04-11 21:47:03,417 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 567 transitions. Word has length 42 [2018-04-11 21:47:03,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:47:03,417 INFO L459 AbstractCegarLoop]: Abstraction has 422 states and 567 transitions. [2018-04-11 21:47:03,417 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 21:47:03,417 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 567 transitions. [2018-04-11 21:47:03,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 21:47:03,417 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:47:03,417 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:47:03,417 INFO L408 AbstractCegarLoop]: === Iteration 40 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:47:03,417 INFO L82 PathProgramCache]: Analyzing trace with hash 891196517, now seen corresponding path program 1 times [2018-04-11 21:47:03,417 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:47:03,417 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:47:03,418 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:47:03,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:47:03,418 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:47:03,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:47:03,423 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:47:03,627 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 21:47:03,627 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:47:03,627 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-04-11 21:47:03,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 21:47:03,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 21:47:03,628 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-04-11 21:47:03,628 INFO L87 Difference]: Start difference. First operand 422 states and 567 transitions. Second operand 16 states. [2018-04-11 21:47:04,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:47:04,498 INFO L93 Difference]: Finished difference Result 740 states and 921 transitions. [2018-04-11 21:47:04,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-11 21:47:04,498 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2018-04-11 21:47:04,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:47:04,500 INFO L225 Difference]: With dead ends: 740 [2018-04-11 21:47:04,500 INFO L226 Difference]: Without dead ends: 740 [2018-04-11 21:47:04,500 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=348, Invalid=1292, Unknown=0, NotChecked=0, Total=1640 [2018-04-11 21:47:04,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2018-04-11 21:47:04,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 452. [2018-04-11 21:47:04,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-04-11 21:47:04,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 612 transitions. [2018-04-11 21:47:04,503 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 612 transitions. Word has length 43 [2018-04-11 21:47:04,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:47:04,503 INFO L459 AbstractCegarLoop]: Abstraction has 452 states and 612 transitions. [2018-04-11 21:47:04,503 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 21:47:04,503 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 612 transitions. [2018-04-11 21:47:04,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-11 21:47:04,504 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:47:04,504 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:47:04,504 INFO L408 AbstractCegarLoop]: === Iteration 41 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:47:04,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1802679286, now seen corresponding path program 1 times [2018-04-11 21:47:04,504 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:47:04,504 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:47:04,504 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:47:04,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:47:04,505 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:47:04,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:47:04,512 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:47:04,684 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:47:04,685 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 21:47:04,685 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 21:47:04,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:47:04,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:47:04,755 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:47:04,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 21:47:04,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 21:47:04,762 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:47:04,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:47:04,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 21:47:04,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 21:47:04,775 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:47:04,776 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:47:04,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:47:04,781 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:28, output treesize:20 [2018-04-11 21:47:04,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 21:47:04,790 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:47:04,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 21:47:04,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:47:04,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:47:04,808 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 21:47:04,816 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:47:04,817 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 21:47:04,817 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:47:04,822 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:47:04,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:47:04,831 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:46, output treesize:38 [2018-04-11 21:47:04,856 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:47:04,857 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:47:04,857 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 21:47:04,857 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:47:04,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:47:04,866 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:37 [2018-04-11 21:47:04,891 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 30 treesize of output 23 [2018-04-11 21:47:04,893 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:47:04,894 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:47:04,895 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:47:04,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, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-04-11 21:47:04,897 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:47:04,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:47:04,916 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 30 treesize of output 23 [2018-04-11 21:47:04,918 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:47:04,919 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:47:04,920 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:47:04,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-04-11 21:47:04,922 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:47:04,926 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:47:04,934 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 21:47:04,934 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:68, output treesize:48 [2018-04-11 21:47:04,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 67 [2018-04-11 21:47:04,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:47:04,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:47:04,994 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:47:05,006 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 40 treesize of output 41 [2018-04-11 21:47:05,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:47:05,008 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:47:05,011 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:47:05,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:47:05,019 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:94, output treesize:48 [2018-04-11 21:47:05,021 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:47:05,022 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:47:05,022 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 21:47:05,022 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:47:05,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:47:05,028 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:53, output treesize:47 [2018-04-11 21:47:05,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-04-11 21:47:05,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:47:05,068 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:47:05,072 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:47:05,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 39 [2018-04-11 21:47:05,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:47:05,086 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:47:05,091 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:47:05,098 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 21:47:05,098 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:69, output treesize:47 [2018-04-11 21:47:05,126 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 73 treesize of output 67 [2018-04-11 21:47:05,128 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 21:47:05,128 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:47:05,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:47:05,145 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 40 treesize of output 41 [2018-04-11 21:47:05,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:47:05,147 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:47:05,150 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:47:05,158 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 21:47:05,158 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:93, output treesize:57 [2018-04-11 21:47:05,208 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 48 treesize of output 39 [2018-04-11 21:47:05,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-04-11 21:47:05,210 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:47:05,216 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:47:05,216 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:47:05,216 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:47:05,218 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 26 treesize of output 28 [2018-04-11 21:47:05,218 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:47:05,222 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:47:05,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-04-11 21:47:05,227 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:47:05,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-11 21:47:05,227 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 21:47:05,229 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:47:05,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:47:05,230 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:71, output treesize:7 [2018-04-11 21:47:05,242 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:47:05,259 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 21:47:05,259 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 22 [2018-04-11 21:47:05,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 21:47:05,259 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 21:47:05,259 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2018-04-11 21:47:05,259 INFO L87 Difference]: Start difference. First operand 452 states and 612 transitions. Second operand 22 states. [2018-04-11 21:47:20,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:47:20,445 INFO L93 Difference]: Finished difference Result 731 states and 920 transitions. [2018-04-11 21:47:20,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 21:47:20,445 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 45 [2018-04-11 21:47:20,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:47:20,447 INFO L225 Difference]: With dead ends: 731 [2018-04-11 21:47:20,447 INFO L226 Difference]: Without dead ends: 731 [2018-04-11 21:47:20,447 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=346, Invalid=1060, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 21:47:20,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2018-04-11 21:47:20,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 469. [2018-04-11 21:47:20,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2018-04-11 21:47:20,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 634 transitions. [2018-04-11 21:47:20,451 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 634 transitions. Word has length 45 [2018-04-11 21:47:20,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:47:20,451 INFO L459 AbstractCegarLoop]: Abstraction has 469 states and 634 transitions. [2018-04-11 21:47:20,451 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 21:47:20,451 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 634 transitions. [2018-04-11 21:47:20,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-11 21:47:20,451 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:47:20,451 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 21:47:20,451 INFO L408 AbstractCegarLoop]: === Iteration 42 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:47:20,452 INFO L82 PathProgramCache]: Analyzing trace with hash 509694365, now seen corresponding path program 1 times [2018-04-11 21:47:20,452 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:47:20,452 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:47:20,452 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:47:20,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:47:20,452 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:47:20,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:47:20,459 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:47:20,627 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:47:20,627 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 21:47:20,627 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 21:47:20,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:47:20,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:47:20,658 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:47:20,679 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 21:47:20,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:47:20,681 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:47:20,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:47:20,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 21:47:20,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:47:20,690 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:47:20,691 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:47:20,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:47:20,696 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-04-11 21:47:20,714 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 21:47:20,743 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:47: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 16 treesize of output 23 [2018-04-11 21:47:20,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:47:20,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:47:20,757 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 21:47:20,760 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:47:20,761 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 21:47:20,761 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:47:20,764 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:47:20,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:47:20,773 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:52, output treesize:44 [2018-04-11 21:47:20,793 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:47:20,794 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:47:20,795 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 21:47:20,795 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:47:20,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:47:20,802 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:43 [2018-04-11 21:47:20,837 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 30 treesize of output 23 [2018-04-11 21:47:20,840 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:47:20,841 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:47:20,841 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:47:20,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-04-11 21:47:20,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:47:20,850 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:47:20,865 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 30 treesize of output 23 [2018-04-11 21:47:20,867 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:47:20,868 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:47:20,868 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:47:20,870 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-04-11 21:47:20,870 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:47:20,876 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:47:20,887 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 21:47:20,887 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:74, output treesize:54 [2018-04-11 21:47:20,944 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 40 treesize of output 41 [2018-04-11 21:47:20,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:47:20,947 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:47:20,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:47:20,968 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 63 treesize of output 57 [2018-04-11 21:47:20,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:47:20,970 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:47:20,976 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:47:20,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:47:20,987 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:100, output treesize:54 [2018-04-11 21:47:20,990 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:47:20,991 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:47:20,991 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 21:47:20,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:47:20,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:47:20,998 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:59, output treesize:53 [2018-04-11 21:47:21,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 39 [2018-04-11 21:47:21,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:47:21,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:47:21,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:47:21,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-04-11 21:47:21,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, 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 21:47:21,094 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:47:21,098 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:47:21,107 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 21:47:21,107 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:75, output treesize:53 [2018-04-11 21:47:21,136 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 73 treesize of output 67 [2018-04-11 21:47:21,138 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 21:47:21,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:47:21,144 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:47:21,157 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 40 treesize of output 41 [2018-04-11 21:47:21,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:47:21,159 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:47:21,163 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:47:21,172 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 21:47:21,173 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:99, output treesize:63 [2018-04-11 21:47:21,255 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 48 treesize of output 39 [2018-04-11 21:47:21,257 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:47:21,257 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:47:21,258 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:47:21,259 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 26 treesize of output 28 [2018-04-11 21:47:21,259 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:47:21,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-04-11 21:47:21,264 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:47:21,265 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:47:21,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-04-11 21:47:21,272 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:47:21,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-11 21:47:21,272 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 21:47:21,274 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:47:21,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:47:21,277 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:77, output treesize:7 [2018-04-11 21:47:21,290 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:47:21,306 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 21:47:21,307 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 25 [2018-04-11 21:47:21,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 21:47:21,307 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 21:47:21,307 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2018-04-11 21:47:21,307 INFO L87 Difference]: Start difference. First operand 469 states and 634 transitions. Second operand 25 states. [2018-04-11 21:47:39,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:47:39,103 INFO L93 Difference]: Finished difference Result 725 states and 910 transitions. [2018-04-11 21:47:39,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-11 21:47:39,103 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 46 [2018-04-11 21:47:39,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:47:39,104 INFO L225 Difference]: With dead ends: 725 [2018-04-11 21:47:39,104 INFO L226 Difference]: Without dead ends: 725 [2018-04-11 21:47:39,105 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 582 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=657, Invalid=2205, Unknown=0, NotChecked=0, Total=2862 [2018-04-11 21:47:39,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2018-04-11 21:47:39,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 524. [2018-04-11 21:47:39,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2018-04-11 21:47:39,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 719 transitions. [2018-04-11 21:47:39,108 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 719 transitions. Word has length 46 [2018-04-11 21:47:39,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:47:39,108 INFO L459 AbstractCegarLoop]: Abstraction has 524 states and 719 transitions. [2018-04-11 21:47:39,108 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 21:47:39,108 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 719 transitions. [2018-04-11 21:47:39,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-11 21:47:39,108 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:47:39,109 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:47:39,109 INFO L408 AbstractCegarLoop]: === Iteration 43 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:47:39,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1319746159, now seen corresponding path program 1 times [2018-04-11 21:47:39,109 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:47:39,109 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:47:39,109 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:47:39,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:47:39,109 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:47:39,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:47:39,115 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:47:39,211 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:47:39,211 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 21:47:39,241 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 21:47:39,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:47:39,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:47:39,273 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:47:39,297 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:47:39,298 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:47:39,298 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 21:47:39,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:47:39,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:47:39,300 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-04-11 21:47:39,310 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 21:47:39,311 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 21:47:39,311 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:47:39,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:47:39,315 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 21:47:39,315 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-04-11 21:47:39,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-04-11 21:47:39,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 21:47:39,345 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:47:39,348 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:47:39,352 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 21:47:39,352 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:19 [2018-04-11 21:47:39,354 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:47:39,355 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:47:39,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 21:47:39,355 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:47:39,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:47:39,358 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2018-04-11 21:47:39,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 23 [2018-04-11 21:47:39,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:47:39,396 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:47:39,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:47:39,403 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 21:47:39,403 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:18 [2018-04-11 21:47:39,426 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 45 treesize of output 39 [2018-04-11 21:47:39,428 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 21:47:39,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:47:39,432 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:47:39,437 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 21:47:39,437 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:39 [2018-04-11 21:47:39,538 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 45 treesize of output 38 [2018-04-11 21:47:39,540 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:47:39,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2018-04-11 21:47:39,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:47:39,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-04-11 21:47:39,545 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:47:39,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:47:39,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:47:39,553 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:54, output treesize:5 [2018-04-11 21:47:39,558 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:47:39,575 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 21:47:39,575 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2018-04-11 21:47:39,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-11 21:47:39,576 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-11 21:47:39,576 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2018-04-11 21:47:39,576 INFO L87 Difference]: Start difference. First operand 524 states and 719 transitions. Second operand 26 states. [2018-04-11 21:47:55,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:47:55,073 INFO L93 Difference]: Finished difference Result 762 states and 985 transitions. [2018-04-11 21:47:55,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-11 21:47:55,074 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 47 [2018-04-11 21:47:55,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:47:55,075 INFO L225 Difference]: With dead ends: 762 [2018-04-11 21:47:55,075 INFO L226 Difference]: Without dead ends: 762 [2018-04-11 21:47:55,075 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=538, Invalid=2218, Unknown=0, NotChecked=0, Total=2756 [2018-04-11 21:47:55,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2018-04-11 21:47:55,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 529. [2018-04-11 21:47:55,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2018-04-11 21:47:55,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 725 transitions. [2018-04-11 21:47:55,083 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 725 transitions. Word has length 47 [2018-04-11 21:47:55,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:47:55,083 INFO L459 AbstractCegarLoop]: Abstraction has 529 states and 725 transitions. [2018-04-11 21:47:55,084 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-11 21:47:55,084 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 725 transitions. [2018-04-11 21:47:55,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-11 21:47:55,084 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:47:55,084 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:47:55,084 INFO L408 AbstractCegarLoop]: === Iteration 44 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:47:55,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1319746158, now seen corresponding path program 1 times [2018-04-11 21:47:55,085 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:47:55,085 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:47:55,085 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:47:55,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:47:55,085 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:47:55,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:47:55,095 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:47:55,241 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:47:55,241 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 21:47:55,241 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 21:47:55,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:47:55,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:47:55,263 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:47:55,290 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:47:55,291 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:47:55,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, 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 21:47:55,291 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:47:55,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:47:55,293 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-11 21:47:55,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 21:47:55,306 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 21:47:55,306 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:47:55,307 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:47:55,313 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 21:47:55,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:47:55,314 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:47:55,315 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:47:55,319 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 21:47:55,319 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:39, output treesize:28 [2018-04-11 21:47:55,351 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 57 treesize of output 51 [2018-04-11 21:47:55,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:47:55,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:47:55,358 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:47:55,367 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 21:47:55,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:47:55,368 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:47:55,371 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:47:55,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:47:55,376 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:74, output treesize:28 [2018-04-11 21:47:55,378 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:47:55,379 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:47:55,379 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 21:47:55,379 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:47:55,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:47:55,384 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:27 [2018-04-11 21:47:55,457 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 21:47:55,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:47:55,458 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:47:55,462 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:47:55,472 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 21:47:55,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:47:55,474 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:47:55,478 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:47:55,485 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 21:47:55,485 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:60, output treesize:38 [2018-04-11 21:47:55,513 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 33 treesize of output 34 [2018-04-11 21:47:55,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:47:55,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:47:55,518 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:47:55,530 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 58 treesize of output 52 [2018-04-11 21:47:55,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 14 treesize of output 13 [2018-04-11 21:47:55,532 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:47:55,536 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:47:55,552 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 21:47:55,552 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:84, output treesize:48 [2018-04-11 21:47:55,653 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 45 treesize of output 38 [2018-04-11 21:47:55,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-04-11 21:47:55,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:47:55,662 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:47:55,663 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 25 treesize of output 17 [2018-04-11 21:47:55,663 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:47:55,666 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:47:55,675 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 19 treesize of output 15 [2018-04-11 21:47:55,676 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:47:55,677 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 21:47:55,677 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 21:47:55,679 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:47:55,683 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 21:47:55,684 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:72, output treesize:9 [2018-04-11 21:47:55,696 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:47:55,713 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 21:47:55,713 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16] total 25 [2018-04-11 21:47:55,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-11 21:47:55,713 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-11 21:47:55,713 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=562, Unknown=0, NotChecked=0, Total=650 [2018-04-11 21:47:55,713 INFO L87 Difference]: Start difference. First operand 529 states and 725 transitions. Second operand 26 states. [2018-04-11 21:48:07,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:48:07,099 INFO L93 Difference]: Finished difference Result 776 states and 999 transitions. [2018-04-11 21:48:07,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 21:48:07,099 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 47 [2018-04-11 21:48:07,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:48:07,100 INFO L225 Difference]: With dead ends: 776 [2018-04-11 21:48:07,100 INFO L226 Difference]: Without dead ends: 776 [2018-04-11 21:48:07,100 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=484, Invalid=1868, Unknown=0, NotChecked=0, Total=2352 [2018-04-11 21:48:07,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2018-04-11 21:48:07,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 529. [2018-04-11 21:48:07,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2018-04-11 21:48:07,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 724 transitions. [2018-04-11 21:48:07,104 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 724 transitions. Word has length 47 [2018-04-11 21:48:07,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:48:07,104 INFO L459 AbstractCegarLoop]: Abstraction has 529 states and 724 transitions. [2018-04-11 21:48:07,104 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-11 21:48:07,104 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 724 transitions. [2018-04-11 21:48:07,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-11 21:48:07,104 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:48:07,104 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:48:07,104 INFO L408 AbstractCegarLoop]: === Iteration 45 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:48:07,104 INFO L82 PathProgramCache]: Analyzing trace with hash -1681070032, now seen corresponding path program 1 times [2018-04-11 21:48:07,105 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:48:07,105 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:48:07,105 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:07,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:07,105 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:07,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:07,110 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:48:07,339 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:48:07,340 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 21:48:07,340 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 21:48:07,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:07,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:07,363 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:48:07,412 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:07,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 25 [2018-04-11 21:48:07,413 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:07,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:07,419 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:28 [2018-04-11 21:48:07,437 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 21:48:07,447 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 21:48:07,447 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:07,448 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:07,455 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 21:48:07,456 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:46 [2018-04-11 21:48:07,497 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 46 treesize of output 42 [2018-04-11 21:48:07,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 12 treesize of output 11 [2018-04-11 21:48:07,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:07,503 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:07,509 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 21:48:07,510 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:37 [2018-04-11 21:48:07,601 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 36 treesize of output 28 [2018-04-11 21:48:07,607 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 28 treesize of output 25 [2018-04-11 21:48:07,607 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 21:48:07,614 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 21:48:07,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 21:48:07,623 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:63 [2018-04-11 21:48:07,659 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:07,659 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 34 treesize of output 28 [2018-04-11 21:48:07,659 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:07,674 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:07,680 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 4 case distinctions, treesize of input 38 treesize of output 45 [2018-04-11 21:48:07,681 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-04-11 21:48:07,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2018-04-11 21:48:07,715 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:73, output treesize:118 [2018-04-11 21:48:07,801 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:07,802 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:07,802 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 21:48:07,802 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:07,807 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 21:48:07,807 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:25 [2018-04-11 21:48:07,859 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:48:07,876 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 21:48:07,876 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15] total 23 [2018-04-11 21:48:07,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 21:48:07,877 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 21:48:07,877 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=497, Unknown=4, NotChecked=0, Total=552 [2018-04-11 21:48:07,877 INFO L87 Difference]: Start difference. First operand 529 states and 724 transitions. Second operand 24 states. [2018-04-11 21:48:09,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:48:09,861 INFO L93 Difference]: Finished difference Result 858 states and 1144 transitions. [2018-04-11 21:48:09,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-11 21:48:09,861 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 48 [2018-04-11 21:48:09,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:48:09,862 INFO L225 Difference]: With dead ends: 858 [2018-04-11 21:48:09,862 INFO L226 Difference]: Without dead ends: 854 [2018-04-11 21:48:09,862 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=154, Invalid=1248, Unknown=4, NotChecked=0, Total=1406 [2018-04-11 21:48:09,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2018-04-11 21:48:09,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 590. [2018-04-11 21:48:09,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2018-04-11 21:48:09,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 826 transitions. [2018-04-11 21:48:09,866 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 826 transitions. Word has length 48 [2018-04-11 21:48:09,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:48:09,867 INFO L459 AbstractCegarLoop]: Abstraction has 590 states and 826 transitions. [2018-04-11 21:48:09,867 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 21:48:09,867 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 826 transitions. [2018-04-11 21:48:09,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-11 21:48:09,867 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:48:09,867 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:48:09,867 INFO L408 AbstractCegarLoop]: === Iteration 46 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:48:09,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1681072013, now seen corresponding path program 1 times [2018-04-11 21:48:09,868 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:48:09,868 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:48:09,868 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:09,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:09,868 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:09,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:09,875 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:48:09,889 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:48:09,889 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:48:09,889 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 21:48:09,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 21:48:09,889 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 21:48:09,889 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 21:48:09,889 INFO L87 Difference]: Start difference. First operand 590 states and 826 transitions. Second operand 3 states. [2018-04-11 21:48:09,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:48:09,898 INFO L93 Difference]: Finished difference Result 525 states and 679 transitions. [2018-04-11 21:48:09,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 21:48:09,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-04-11 21:48:09,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:48:09,901 INFO L225 Difference]: With dead ends: 525 [2018-04-11 21:48:09,901 INFO L226 Difference]: Without dead ends: 500 [2018-04-11 21:48:09,901 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 21:48:09,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2018-04-11 21:48:09,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 484. [2018-04-11 21:48:09,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2018-04-11 21:48:09,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 654 transitions. [2018-04-11 21:48:09,904 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 654 transitions. Word has length 48 [2018-04-11 21:48:09,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:48:09,904 INFO L459 AbstractCegarLoop]: Abstraction has 484 states and 654 transitions. [2018-04-11 21:48:09,904 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 21:48:09,904 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 654 transitions. [2018-04-11 21:48:09,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-11 21:48:09,904 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:48:09,904 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:48:09,904 INFO L408 AbstractCegarLoop]: === Iteration 47 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:48:09,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1629524322, now seen corresponding path program 1 times [2018-04-11 21:48:09,905 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:48:09,905 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:48:09,905 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:09,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:09,905 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:09,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:09,921 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:48:10,095 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:48:10,095 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 21:48:10,095 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 21:48:10,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:10,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:10,137 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:48:10,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 21:48:10,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 21:48:10,169 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:10,170 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:10,177 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 21:48:10,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:48:10,178 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:10,179 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:10,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:10,183 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-04-11 21:48:10,219 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:10,220 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:10,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 21:48:10,220 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:10,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:10,226 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2018-04-11 21:48:10,254 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 23 treesize of output 18 [2018-04-11 21:48:10,256 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:10,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-11 21:48:10,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:10,261 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:10,274 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 23 treesize of output 18 [2018-04-11 21:48:10,276 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:10,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, 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 27 [2018-04-11 21:48:10,277 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:10,280 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:10,288 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 21:48:10,288 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:57, output treesize:37 [2018-04-11 21:48:10,359 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 21:48:10,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:48:10,361 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:10,366 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:10,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2018-04-11 21:48:10,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:48:10,387 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:10,391 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:10,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:10,398 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:83, output treesize:37 [2018-04-11 21:48:10,400 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:10,401 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:10,401 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 21:48:10,401 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:10,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:10,406 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:36 [2018-04-11 21:48:10,445 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 21:48:10,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:48:10,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:10,450 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:10,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2018-04-11 21:48:10,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 21:48:10,463 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:10,467 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:10,475 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 21:48:10,475 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:58, output treesize:36 [2018-04-11 21:48:10,499 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 33 treesize of output 34 [2018-04-11 21:48:10,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:48:10,501 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:10,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:10,517 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 56 treesize of output 50 [2018-04-11 21:48:10,519 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 21:48:10,519 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:10,523 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:10,529 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 21:48:10,530 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:82, output treesize:46 [2018-04-11 21:48:10,704 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 43 treesize of output 36 [2018-04-11 21:48:10,713 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:10,714 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:10,715 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:48:10,717 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 23 treesize of output 31 [2018-04-11 21:48:10,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:10,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-04-11 21:48:10,725 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:10,726 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:10,735 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 19 treesize of output 15 [2018-04-11 21:48:10,736 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:48:10,736 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 21:48:10,737 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:10,739 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:10,743 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 21:48:10,743 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:70, output treesize:7 [2018-04-11 21:48:10,753 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:48:10,770 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 21:48:10,770 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 27 [2018-04-11 21:48:10,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-11 21:48:10,771 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-11 21:48:10,771 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=597, Unknown=0, NotChecked=0, Total=702 [2018-04-11 21:48:10,771 INFO L87 Difference]: Start difference. First operand 484 states and 654 transitions. Second operand 27 states. [2018-04-11 21:48:28,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:48:28,348 INFO L93 Difference]: Finished difference Result 600 states and 781 transitions. [2018-04-11 21:48:28,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 21:48:28,348 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 48 [2018-04-11 21:48:28,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:48:28,349 INFO L225 Difference]: With dead ends: 600 [2018-04-11 21:48:28,349 INFO L226 Difference]: Without dead ends: 600 [2018-04-11 21:48:28,350 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=509, Invalid=1747, Unknown=0, NotChecked=0, Total=2256 [2018-04-11 21:48:28,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2018-04-11 21:48:28,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 438. [2018-04-11 21:48:28,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-04-11 21:48:28,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 578 transitions. [2018-04-11 21:48:28,353 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 578 transitions. Word has length 48 [2018-04-11 21:48:28,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:48:28,353 INFO L459 AbstractCegarLoop]: Abstraction has 438 states and 578 transitions. [2018-04-11 21:48:28,353 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-11 21:48:28,353 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 578 transitions. [2018-04-11 21:48:28,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-11 21:48:28,354 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:48:28,354 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:48:28,354 INFO L408 AbstractCegarLoop]: === Iteration 48 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:48:28,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1806446818, now seen corresponding path program 1 times [2018-04-11 21:48:28,354 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:48:28,354 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:48:28,355 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:28,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:28,355 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:28,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:28,364 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:48:28,743 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 21:48:28,743 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:48:28,743 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-04-11 21:48:28,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 21:48:28,743 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 21:48:28,744 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2018-04-11 21:48:28,744 INFO L87 Difference]: Start difference. First operand 438 states and 578 transitions. Second operand 19 states. [2018-04-11 21:48:29,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:48:29,953 INFO L93 Difference]: Finished difference Result 874 states and 1110 transitions. [2018-04-11 21:48:29,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 21:48:29,954 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-04-11 21:48:29,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:48:29,955 INFO L225 Difference]: With dead ends: 874 [2018-04-11 21:48:29,955 INFO L226 Difference]: Without dead ends: 874 [2018-04-11 21:48:29,955 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=296, Invalid=826, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 21:48:29,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2018-04-11 21:48:29,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 497. [2018-04-11 21:48:29,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2018-04-11 21:48:29,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 662 transitions. [2018-04-11 21:48:29,960 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 662 transitions. Word has length 49 [2018-04-11 21:48:29,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:48:29,960 INFO L459 AbstractCegarLoop]: Abstraction has 497 states and 662 transitions. [2018-04-11 21:48:29,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 21:48:29,960 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 662 transitions. [2018-04-11 21:48:29,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-11 21:48:29,960 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:48:29,961 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:48:29,961 INFO L408 AbstractCegarLoop]: === Iteration 49 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:48:29,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1806446819, now seen corresponding path program 1 times [2018-04-11 21:48:29,961 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:48:29,961 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:48:29,961 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:29,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:29,962 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:29,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:29,969 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:48:30,347 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 21:48:30,347 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:48:30,347 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-04-11 21:48:30,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 21:48:30,347 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 21:48:30,347 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2018-04-11 21:48:30,347 INFO L87 Difference]: Start difference. First operand 497 states and 662 transitions. Second operand 18 states. [2018-04-11 21:48:31,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:48:31,874 INFO L93 Difference]: Finished difference Result 876 states and 1112 transitions. [2018-04-11 21:48:31,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 21:48:31,875 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 49 [2018-04-11 21:48:31,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:48:31,876 INFO L225 Difference]: With dead ends: 876 [2018-04-11 21:48:31,876 INFO L226 Difference]: Without dead ends: 876 [2018-04-11 21:48:31,877 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=328, Invalid=1004, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 21:48:31,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2018-04-11 21:48:31,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 497. [2018-04-11 21:48:31,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2018-04-11 21:48:31,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 661 transitions. [2018-04-11 21:48:31,882 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 661 transitions. Word has length 49 [2018-04-11 21:48:31,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:48:31,883 INFO L459 AbstractCegarLoop]: Abstraction has 497 states and 661 transitions. [2018-04-11 21:48:31,883 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 21:48:31,883 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 661 transitions. [2018-04-11 21:48:31,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 21:48:31,883 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:48:31,883 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:48:31,883 INFO L408 AbstractCegarLoop]: === Iteration 50 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:48:31,883 INFO L82 PathProgramCache]: Analyzing trace with hash -8372055, now seen corresponding path program 1 times [2018-04-11 21:48:31,883 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:48:31,884 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:48:31,884 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:31,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:31,884 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:31,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:31,892 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:48:31,968 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 21:48:31,968 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 21:48:31,968 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 21:48:31,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:31,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:31,995 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:48:32,039 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:32,039 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:32,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 21:48:32,040 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:32,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 21:48:32,047 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:32,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:48:32,053 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:21 [2018-04-11 21:48:32,112 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:48:32,130 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 21:48:32,130 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 15 [2018-04-11 21:48:32,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 21:48:32,131 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 21:48:32,131 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2018-04-11 21:48:32,131 INFO L87 Difference]: Start difference. First operand 497 states and 661 transitions. Second operand 16 states. [2018-04-11 21:48:32,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:48:32,772 INFO L93 Difference]: Finished difference Result 696 states and 861 transitions. [2018-04-11 21:48:32,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 21:48:32,773 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 50 [2018-04-11 21:48:32,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:48:32,774 INFO L225 Difference]: With dead ends: 696 [2018-04-11 21:48:32,774 INFO L226 Difference]: Without dead ends: 696 [2018-04-11 21:48:32,774 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=479, Unknown=0, NotChecked=0, Total=650 [2018-04-11 21:48:32,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2018-04-11 21:48:32,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 399. [2018-04-11 21:48:32,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-04-11 21:48:32,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 494 transitions. [2018-04-11 21:48:32,777 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 494 transitions. Word has length 50 [2018-04-11 21:48:32,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:48:32,777 INFO L459 AbstractCegarLoop]: Abstraction has 399 states and 494 transitions. [2018-04-11 21:48:32,777 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 21:48:32,777 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 494 transitions. [2018-04-11 21:48:32,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 21:48:32,777 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:48:32,778 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:48:32,778 INFO L408 AbstractCegarLoop]: === Iteration 51 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:48:32,778 INFO L82 PathProgramCache]: Analyzing trace with hash 165276669, now seen corresponding path program 1 times [2018-04-11 21:48:32,778 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:48:32,778 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:48:32,778 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:32,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:32,778 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:32,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:32,785 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:48:32,810 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 21:48:32,810 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:48:32,810 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 21:48:32,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 21:48:32,811 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 21:48:32,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 21:48:32,811 INFO L87 Difference]: Start difference. First operand 399 states and 494 transitions. Second operand 4 states. [2018-04-11 21:48:32,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:48:33,029 INFO L93 Difference]: Finished difference Result 770 states and 952 transitions. [2018-04-11 21:48:33,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 21:48:33,029 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-04-11 21:48:33,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:48:33,030 INFO L225 Difference]: With dead ends: 770 [2018-04-11 21:48:33,030 INFO L226 Difference]: Without dead ends: 770 [2018-04-11 21:48:33,030 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 21:48:33,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2018-04-11 21:48:33,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 398. [2018-04-11 21:48:33,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-04-11 21:48:33,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 493 transitions. [2018-04-11 21:48:33,035 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 493 transitions. Word has length 50 [2018-04-11 21:48:33,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:48:33,036 INFO L459 AbstractCegarLoop]: Abstraction has 398 states and 493 transitions. [2018-04-11 21:48:33,036 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 21:48:33,036 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 493 transitions. [2018-04-11 21:48:33,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 21:48:33,036 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:48:33,036 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:48:33,037 INFO L408 AbstractCegarLoop]: === Iteration 52 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:48:33,037 INFO L82 PathProgramCache]: Analyzing trace with hash 165276670, now seen corresponding path program 1 times [2018-04-11 21:48:33,037 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:48:33,037 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:48:33,037 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:33,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:33,038 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:33,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:33,045 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:48:33,076 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 21:48:33,076 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:48:33,076 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 21:48:33,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 21:48:33,077 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 21:48:33,077 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 21:48:33,077 INFO L87 Difference]: Start difference. First operand 398 states and 493 transitions. Second operand 4 states. [2018-04-11 21:48:33,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:48:33,223 INFO L93 Difference]: Finished difference Result 734 states and 914 transitions. [2018-04-11 21:48:33,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 21:48:33,223 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-04-11 21:48:33,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:48:33,224 INFO L225 Difference]: With dead ends: 734 [2018-04-11 21:48:33,224 INFO L226 Difference]: Without dead ends: 734 [2018-04-11 21:48:33,224 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 21:48:33,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2018-04-11 21:48:33,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 397. [2018-04-11 21:48:33,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2018-04-11 21:48:33,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 492 transitions. [2018-04-11 21:48:33,227 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 492 transitions. Word has length 50 [2018-04-11 21:48:33,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:48:33,227 INFO L459 AbstractCegarLoop]: Abstraction has 397 states and 492 transitions. [2018-04-11 21:48:33,227 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 21:48:33,227 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 492 transitions. [2018-04-11 21:48:33,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 21:48:33,228 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:48:33,228 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:48:33,228 INFO L408 AbstractCegarLoop]: === Iteration 53 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:48:33,228 INFO L82 PathProgramCache]: Analyzing trace with hash -426931142, now seen corresponding path program 1 times [2018-04-11 21:48:33,228 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:48:33,228 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:48:33,228 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:33,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:33,229 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:33,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:33,236 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:48:33,345 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:48:33,345 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 21:48:33,345 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 21:48:33,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:33,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:33,371 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:48:33,417 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:33,417 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:33,418 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 21:48:33,418 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:33,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:33,421 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-11 21:48:33,434 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 21:48:33,435 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 21:48:33,435 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:33,436 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:33,443 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 21:48:33,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:48:33,445 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:33,446 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:33,450 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 21:48:33,451 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:39, output treesize:28 [2018-04-11 21:48:33,482 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 57 treesize of output 51 [2018-04-11 21:48:33,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:48:33,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:33,487 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:33,496 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 21:48:33,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:48:33,497 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:33,500 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:33,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:33,505 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:74, output treesize:28 [2018-04-11 21:48:33,507 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:33,508 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:33,508 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 21:48:33,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:33,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:33,512 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:27 [2018-04-11 21:48:33,540 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 22 treesize of output 23 [2018-04-11 21:48:33,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 21:48:33,541 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:33,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:33,552 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 21:48:33,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:48:33,554 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:33,556 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:33,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:33,562 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:49, output treesize:23 [2018-04-11 21:48:33,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-04-11 21:48:33,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-04-11 21:48:33,575 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:33,576 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:33,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:33,578 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:17 [2018-04-11 21:48:33,593 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 21:48:33,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:48:33,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:33,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:33,600 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 21:48:33,600 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:13 [2018-04-11 21:48:33,709 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 19 treesize of output 15 [2018-04-11 21:48:33,710 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:48:33,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 21:48:33,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:33,712 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:33,715 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 21:48:33,716 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:3 [2018-04-11 21:48:33,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:48:33,737 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 21:48:33,737 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15] total 24 [2018-04-11 21:48:33,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 21:48:33,737 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 21:48:33,738 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2018-04-11 21:48:33,738 INFO L87 Difference]: Start difference. First operand 397 states and 492 transitions. Second operand 25 states. [2018-04-11 21:48:34,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:48:34,666 INFO L93 Difference]: Finished difference Result 537 states and 625 transitions. [2018-04-11 21:48:34,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 21:48:34,667 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 50 [2018-04-11 21:48:34,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:48:34,667 INFO L225 Difference]: With dead ends: 537 [2018-04-11 21:48:34,668 INFO L226 Difference]: Without dead ends: 537 [2018-04-11 21:48:34,668 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=399, Invalid=1493, Unknown=0, NotChecked=0, Total=1892 [2018-04-11 21:48:34,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2018-04-11 21:48:34,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 400. [2018-04-11 21:48:34,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-04-11 21:48:34,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 496 transitions. [2018-04-11 21:48:34,670 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 496 transitions. Word has length 50 [2018-04-11 21:48:34,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:48:34,670 INFO L459 AbstractCegarLoop]: Abstraction has 400 states and 496 transitions. [2018-04-11 21:48:34,670 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 21:48:34,670 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 496 transitions. [2018-04-11 21:48:34,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-11 21:48:34,671 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:48:34,671 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:48:34,671 INFO L408 AbstractCegarLoop]: === Iteration 54 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:48:34,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1555912094, now seen corresponding path program 1 times [2018-04-11 21:48:34,671 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:48:34,671 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:48:34,671 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:34,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:34,672 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:34,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:34,679 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:48:35,061 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 21:48:35,061 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:48:35,061 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-04-11 21:48:35,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 21:48:35,061 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 21:48:35,061 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2018-04-11 21:48:35,061 INFO L87 Difference]: Start difference. First operand 400 states and 496 transitions. Second operand 19 states. [2018-04-11 21:48:36,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:48:36,195 INFO L93 Difference]: Finished difference Result 757 states and 914 transitions. [2018-04-11 21:48:36,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 21:48:36,195 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 53 [2018-04-11 21:48:36,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:48:36,196 INFO L225 Difference]: With dead ends: 757 [2018-04-11 21:48:36,196 INFO L226 Difference]: Without dead ends: 757 [2018-04-11 21:48:36,196 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=296, Invalid=826, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 21:48:36,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2018-04-11 21:48:36,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 463. [2018-04-11 21:48:36,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2018-04-11 21:48:36,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 583 transitions. [2018-04-11 21:48:36,201 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 583 transitions. Word has length 53 [2018-04-11 21:48:36,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:48:36,201 INFO L459 AbstractCegarLoop]: Abstraction has 463 states and 583 transitions. [2018-04-11 21:48:36,201 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 21:48:36,201 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 583 transitions. [2018-04-11 21:48:36,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-11 21:48:36,202 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:48:36,202 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:48:36,202 INFO L408 AbstractCegarLoop]: === Iteration 55 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:48:36,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1555912095, now seen corresponding path program 1 times [2018-04-11 21:48:36,202 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:48:36,203 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:48:36,203 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:36,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:36,203 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:36,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:36,214 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:48:36,564 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 21:48:36,565 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:48:36,565 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-04-11 21:48:36,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 21:48:36,565 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 21:48:36,565 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2018-04-11 21:48:36,565 INFO L87 Difference]: Start difference. First operand 463 states and 583 transitions. Second operand 18 states. [2018-04-11 21:48:37,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:48:37,861 INFO L93 Difference]: Finished difference Result 760 states and 917 transitions. [2018-04-11 21:48:37,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 21:48:37,861 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 53 [2018-04-11 21:48:37,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:48:37,862 INFO L225 Difference]: With dead ends: 760 [2018-04-11 21:48:37,862 INFO L226 Difference]: Without dead ends: 760 [2018-04-11 21:48:37,862 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=328, Invalid=1004, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 21:48:37,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2018-04-11 21:48:37,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 459. [2018-04-11 21:48:37,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2018-04-11 21:48:37,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 578 transitions. [2018-04-11 21:48:37,865 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 578 transitions. Word has length 53 [2018-04-11 21:48:37,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:48:37,865 INFO L459 AbstractCegarLoop]: Abstraction has 459 states and 578 transitions. [2018-04-11 21:48:37,865 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 21:48:37,865 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 578 transitions. [2018-04-11 21:48:37,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-11 21:48:37,865 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:48:37,865 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:48:37,866 INFO L408 AbstractCegarLoop]: === Iteration 56 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:48:37,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1724885864, now seen corresponding path program 1 times [2018-04-11 21:48:37,866 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:48:37,866 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:48:37,866 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:37,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:37,866 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:37,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:37,872 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:48:37,926 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 21:48:37,926 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:48:37,926 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-11 21:48:37,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 21:48:37,926 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 21:48:37,926 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-04-11 21:48:37,926 INFO L87 Difference]: Start difference. First operand 459 states and 578 transitions. Second operand 10 states. [2018-04-11 21:48:38,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:48:38,264 INFO L93 Difference]: Finished difference Result 760 states and 951 transitions. [2018-04-11 21:48:38,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 21:48:38,265 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2018-04-11 21:48:38,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:48:38,266 INFO L225 Difference]: With dead ends: 760 [2018-04-11 21:48:38,266 INFO L226 Difference]: Without dead ends: 760 [2018-04-11 21:48:38,266 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2018-04-11 21:48:38,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2018-04-11 21:48:38,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 458. [2018-04-11 21:48:38,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2018-04-11 21:48:38,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 577 transitions. [2018-04-11 21:48:38,269 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 577 transitions. Word has length 53 [2018-04-11 21:48:38,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:48:38,269 INFO L459 AbstractCegarLoop]: Abstraction has 458 states and 577 transitions. [2018-04-11 21:48:38,269 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 21:48:38,269 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 577 transitions. [2018-04-11 21:48:38,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-11 21:48:38,269 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:48:38,269 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:48:38,269 INFO L408 AbstractCegarLoop]: === Iteration 57 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:48:38,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1724885865, now seen corresponding path program 1 times [2018-04-11 21:48:38,270 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:48:38,270 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:48:38,270 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:38,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:38,270 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:38,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:38,277 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:48:38,387 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 21:48:38,387 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:48:38,387 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-11 21:48:38,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 21:48:38,388 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 21:48:38,388 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-04-11 21:48:38,388 INFO L87 Difference]: Start difference. First operand 458 states and 577 transitions. Second operand 10 states. [2018-04-11 21:48:38,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:48:38,736 INFO L93 Difference]: Finished difference Result 759 states and 950 transitions. [2018-04-11 21:48:38,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 21:48:38,736 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2018-04-11 21:48:38,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:48:38,737 INFO L225 Difference]: With dead ends: 759 [2018-04-11 21:48:38,737 INFO L226 Difference]: Without dead ends: 759 [2018-04-11 21:48:38,737 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2018-04-11 21:48:38,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2018-04-11 21:48:38,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 457. [2018-04-11 21:48:38,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2018-04-11 21:48:38,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 576 transitions. [2018-04-11 21:48:38,740 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 576 transitions. Word has length 53 [2018-04-11 21:48:38,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:48:38,740 INFO L459 AbstractCegarLoop]: Abstraction has 457 states and 576 transitions. [2018-04-11 21:48:38,740 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 21:48:38,740 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 576 transitions. [2018-04-11 21:48:38,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-11 21:48:38,740 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:48:38,740 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:48:38,741 INFO L408 AbstractCegarLoop]: === Iteration 58 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:48:38,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1273760456, now seen corresponding path program 1 times [2018-04-11 21:48:38,741 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:48:38,741 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:48:38,741 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:38,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:38,741 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:38,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:38,747 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:48:38,847 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:48:38,847 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 21:48:38,847 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 21:48:38,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:38,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:38,871 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:48:38,898 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:38,899 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:38,899 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 21:48:38,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:38,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:38,901 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-04-11 21:48:38,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, 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 21:48:38,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 21:48:38,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:38,914 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:38,917 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 21:48:38,917 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-04-11 21:48:38,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-04-11 21:48:38,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 21:48:38,947 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:38,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:38,953 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 21:48:38,953 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:19 [2018-04-11 21:48:38,955 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:38,956 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:38,956 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 21:48:38,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:38,959 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:38,959 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2018-04-11 21:48:39,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 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 57 [2018-04-11 21:48:39,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 48 [2018-04-11 21:48:39,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:39,060 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:39,070 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 35 treesize of output 36 [2018-04-11 21:48:39,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:48:39,071 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:39,074 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:39,081 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 21:48:39,081 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:66, output treesize:51 [2018-04-11 21:48:39,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 97 [2018-04-11 21:48:39,162 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 86 [2018-04-11 21:48:39,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 21:48:39,187 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 75 treesize of output 59 [2018-04-11 21:48:39,187 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:39,196 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:39,206 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 49 treesize of output 50 [2018-04-11 21:48:39,207 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 21:48:39,207 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:39,211 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:39,217 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 21:48:39,217 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:109, output treesize:60 [2018-04-11 21:48:39,344 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 51 treesize of output 45 [2018-04-11 21:48:39,345 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:48:39,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2018-04-11 21:48:39,346 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:39,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:39,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 21:48:39,359 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:84, output treesize:63 [2018-04-11 21:48:39,448 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:48:39,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2018-04-11 21:48:39,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, 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 21:48:39,451 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:39,456 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 21:48:39,457 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:39,459 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:39,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:48:39,464 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:67, output treesize:15 [2018-04-11 21:48:39,554 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 21:48:39,572 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-11 21:48:39,572 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [14] total 32 [2018-04-11 21:48:39,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-11 21:48:39,573 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-11 21:48:39,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=922, Unknown=0, NotChecked=0, Total=1056 [2018-04-11 21:48:39,573 INFO L87 Difference]: Start difference. First operand 457 states and 576 transitions. Second operand 33 states. [2018-04-11 21:48:42,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:48:42,326 INFO L93 Difference]: Finished difference Result 925 states and 1099 transitions. [2018-04-11 21:48:42,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-11 21:48:42,326 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 53 [2018-04-11 21:48:42,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:48:42,327 INFO L225 Difference]: With dead ends: 925 [2018-04-11 21:48:42,327 INFO L226 Difference]: Without dead ends: 925 [2018-04-11 21:48:42,328 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 916 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=836, Invalid=3324, Unknown=0, NotChecked=0, Total=4160 [2018-04-11 21:48:42,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2018-04-11 21:48:42,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 462. [2018-04-11 21:48:42,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2018-04-11 21:48:42,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 582 transitions. [2018-04-11 21:48:42,330 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 582 transitions. Word has length 53 [2018-04-11 21:48:42,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:48:42,331 INFO L459 AbstractCegarLoop]: Abstraction has 462 states and 582 transitions. [2018-04-11 21:48:42,331 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-11 21:48:42,331 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 582 transitions. [2018-04-11 21:48:42,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-11 21:48:42,331 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:48:42,331 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:48:42,331 INFO L408 AbstractCegarLoop]: === Iteration 59 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:48:42,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1273760455, now seen corresponding path program 1 times [2018-04-11 21:48:42,332 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:48:42,332 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:48:42,332 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:42,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:42,332 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:42,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:42,341 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:48:42,859 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:48:42,859 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 21:48:42,859 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 21:48:42,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:42,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:42,884 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:48:42,923 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:42,923 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:42,924 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 21:48:42,924 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:42,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:42,926 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-11 21:48:42,943 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 21:48:42,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:48:42,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:42,945 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:42,951 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 21:48:42,952 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 21:48:42,952 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:42,953 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:42,957 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 21:48:42,957 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:39, output treesize:28 [2018-04-11 21:48:43,002 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 21:48:43,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 21:48:43,005 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:43,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:43,020 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 47 treesize of output 41 [2018-04-11 21:48:43,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 21:48:43,022 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:43,026 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:43,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:43,033 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:74, output treesize:28 [2018-04-11 21:48:43,035 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:43,036 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:43,036 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 21:48:43,036 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:43,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:43,041 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:30 [2018-04-11 21:48:43,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 21 treesize of output 22 [2018-04-11 21:48:43,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:48:43,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:43,091 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:43,102 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 22 treesize of output 23 [2018-04-11 21:48:43,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:48:43,104 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:43,107 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:43,121 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 21:48:43,122 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:62, output treesize:37 [2018-04-11 21:48:43,183 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 68 treesize of output 69 [2018-04-11 21:48:43,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 21:48:43,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:43,189 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:43,198 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 59 treesize of output 53 [2018-04-11 21:48:43,200 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 20 treesize of output 19 [2018-04-11 21:48:43,200 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:43,203 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:43,209 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 21:48:43,209 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:90, output treesize:83 [2018-04-11 21:48:43,436 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:48:43,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 97 [2018-04-11 21:48:43,555 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:48:43,556 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 37 treesize of output 25 [2018-04-11 21:48:43,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:43,563 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:48:43,563 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 43 treesize of output 38 [2018-04-11 21:48:43,564 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 21:48:43,569 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 21:48:43,579 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 36 treesize of output 30 [2018-04-11 21:48:43,580 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:48:43,581 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 26 treesize of output 18 [2018-04-11 21:48:43,581 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:43,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 21:48:43,586 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:43,587 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:43,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:43,593 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:127, output treesize:9 [2018-04-11 21:48:43,641 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:48:43,659 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 21:48:43,659 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 38 [2018-04-11 21:48:43,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-11 21:48:43,659 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-11 21:48:43,659 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1351, Unknown=0, NotChecked=0, Total=1482 [2018-04-11 21:48:43,659 INFO L87 Difference]: Start difference. First operand 462 states and 582 transitions. Second operand 39 states. [2018-04-11 21:48:47,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:48:47,080 INFO L93 Difference]: Finished difference Result 898 states and 1054 transitions. [2018-04-11 21:48:47,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-11 21:48:47,080 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 53 [2018-04-11 21:48:47,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:48:47,081 INFO L225 Difference]: With dead ends: 898 [2018-04-11 21:48:47,081 INFO L226 Difference]: Without dead ends: 898 [2018-04-11 21:48:47,081 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1101 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=733, Invalid=3959, Unknown=0, NotChecked=0, Total=4692 [2018-04-11 21:48:47,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2018-04-11 21:48:47,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 465. [2018-04-11 21:48:47,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2018-04-11 21:48:47,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 586 transitions. [2018-04-11 21:48:47,084 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 586 transitions. Word has length 53 [2018-04-11 21:48:47,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:48:47,084 INFO L459 AbstractCegarLoop]: Abstraction has 465 states and 586 transitions. [2018-04-11 21:48:47,084 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-11 21:48:47,084 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 586 transitions. [2018-04-11 21:48:47,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-11 21:48:47,084 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:48:47,084 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:48:47,085 INFO L408 AbstractCegarLoop]: === Iteration 60 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:48:47,085 INFO L82 PathProgramCache]: Analyzing trace with hash -831868191, now seen corresponding path program 1 times [2018-04-11 21:48:47,085 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:48:47,085 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:48:47,085 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:47,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:47,085 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:47,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:47,090 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:48:47,106 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 21:48:47,107 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:48:47,107 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 21:48:47,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 21:48:47,107 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 21:48:47,107 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 21:48:47,107 INFO L87 Difference]: Start difference. First operand 465 states and 586 transitions. Second operand 5 states. [2018-04-11 21:48:47,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:48:47,218 INFO L93 Difference]: Finished difference Result 464 states and 582 transitions. [2018-04-11 21:48:47,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 21:48:47,218 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-04-11 21:48:47,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:48:47,218 INFO L225 Difference]: With dead ends: 464 [2018-04-11 21:48:47,218 INFO L226 Difference]: Without dead ends: 464 [2018-04-11 21:48:47,218 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-11 21:48:47,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-04-11 21:48:47,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 464. [2018-04-11 21:48:47,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2018-04-11 21:48:47,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 582 transitions. [2018-04-11 21:48:47,221 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 582 transitions. Word has length 54 [2018-04-11 21:48:47,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:48:47,221 INFO L459 AbstractCegarLoop]: Abstraction has 464 states and 582 transitions. [2018-04-11 21:48:47,221 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 21:48:47,221 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 582 transitions. [2018-04-11 21:48:47,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-11 21:48:47,221 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:48:47,221 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:48:47,222 INFO L408 AbstractCegarLoop]: === Iteration 61 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:48:47,222 INFO L82 PathProgramCache]: Analyzing trace with hash -831868190, now seen corresponding path program 1 times [2018-04-11 21:48:47,222 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:48:47,222 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:48:47,222 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:47,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:47,222 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:47,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:47,230 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:48:47,281 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 21:48:47,282 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:48:47,282 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 21:48:47,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 21:48:47,282 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 21:48:47,282 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 21:48:47,282 INFO L87 Difference]: Start difference. First operand 464 states and 582 transitions. Second operand 6 states. [2018-04-11 21:48:47,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:48:47,472 INFO L93 Difference]: Finished difference Result 463 states and 578 transitions. [2018-04-11 21:48:47,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 21:48:47,472 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-04-11 21:48:47,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:48:47,473 INFO L225 Difference]: With dead ends: 463 [2018-04-11 21:48:47,473 INFO L226 Difference]: Without dead ends: 463 [2018-04-11 21:48:47,473 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-04-11 21:48:47,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2018-04-11 21:48:47,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 463. [2018-04-11 21:48:47,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2018-04-11 21:48:47,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 578 transitions. [2018-04-11 21:48:47,477 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 578 transitions. Word has length 54 [2018-04-11 21:48:47,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:48:47,477 INFO L459 AbstractCegarLoop]: Abstraction has 463 states and 578 transitions. [2018-04-11 21:48:47,477 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 21:48:47,477 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 578 transitions. [2018-04-11 21:48:47,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-11 21:48:47,478 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:48:47,478 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:48:47,478 INFO L408 AbstractCegarLoop]: === Iteration 62 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:48:47,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1261495612, now seen corresponding path program 1 times [2018-04-11 21:48:47,478 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:48:47,478 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:48:47,479 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:47,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:47,479 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:47,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:47,486 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:48:47,985 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:48:47,985 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 21:48:47,985 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 21:48:47,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:48,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:48,013 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:48:48,036 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 21:48:48,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:48:48,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:48,038 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:48,043 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 21:48:48,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 21:48:48,044 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:48,045 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:48,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:48,049 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-04-11 21:48:48,062 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:48,063 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:48,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 11 treesize of output 4 [2018-04-11 21:48:48,063 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:48,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:48,067 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:26 [2018-04-11 21:48:48,083 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 23 treesize of output 18 [2018-04-11 21:48:48,085 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:48,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-11 21:48:48,086 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:48,089 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:48,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-04-11 21:48:48,100 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:48,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-11 21:48:48,101 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:48,104 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:48,111 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 21:48:48,111 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:57, output treesize:37 [2018-04-11 21:48:48,151 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 66 treesize of output 60 [2018-04-11 21:48:48,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:48:48,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:48,157 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:48,167 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 21:48:48,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:48:48,168 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:48,171 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:48,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:48,178 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:83, output treesize:37 [2018-04-11 21:48:48,202 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:48,203 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:48,203 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 21:48:48,203 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:48,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:48,212 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:48, output treesize:42 [2018-04-11 21:48:48,257 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 31 treesize of output 24 [2018-04-11 21:48:48,259 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:48,259 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:48,260 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:48,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 47 [2018-04-11 21:48:48,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:48,268 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:48,279 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 21:48:48,282 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:48,283 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 21:48:48,283 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:48,286 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:48,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:48:48,295 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:66, output treesize:58 [2018-04-11 21:48:48,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 39 [2018-04-11 21:48:48,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 11 [2018-04-11 21:48:48,332 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:48,337 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:48,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2018-04-11 21:48:48,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15 [2018-04-11 21:48:48,353 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:48,358 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:48,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:48:48,368 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:80, output treesize:84 [2018-04-11 21:48:48,409 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 66 treesize of output 65 [2018-04-11 21:48:48,414 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:48,414 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 21:48:48,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:48,423 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:48,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 62 [2018-04-11 21:48:48,446 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:48,446 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 24 treesize of output 39 [2018-04-11 21:48:48,446 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:48,453 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:48,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:48:48,465 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:110, output treesize:106 [2018-04-11 21:48:48,508 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:48,508 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:48,509 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 21:48:48,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:48,522 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 21:48:48,522 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:111, output treesize:105 [2018-04-11 21:48:48,563 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 88 treesize of output 85 [2018-04-11 21:48:48,565 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:48,565 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:48,566 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:48,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, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 58 [2018-04-11 21:48:48,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:48,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:48,603 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 69 treesize of output 69 [2018-04-11 21:48:48,605 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:48,606 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:48,606 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:48,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 70 [2018-04-11 21:48:48,608 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:48,617 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:48,634 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 21:48:48,635 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:131, output treesize:111 [2018-04-11 21:48:48,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 170 treesize of output 181 [2018-04-11 21:48:48,738 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:48,750 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 4 case distinctions, treesize of input 160 treesize of output 203 [2018-04-11 21:48:48,751 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-04-11 21:48:48,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 152 [2018-04-11 21:48:48,830 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:48,869 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 21:48:48,918 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 0 case distinctions, treesize of input 164 treesize of output 134 [2018-04-11 21:48:48,920 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:48,921 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:48,921 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:48,925 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 60 treesize of output 125 [2018-04-11 21:48:48,925 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:48,938 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:48,951 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 3 case distinctions, treesize of input 179 treesize of output 159 [2018-04-11 21:48:48,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 184 treesize of output 183 [2018-04-11 21:48:48,954 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:49,007 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:49,007 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:49,009 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:49,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 139 treesize of output 201 [2018-04-11 21:48:49,026 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 8 xjuncts. [2018-04-11 21:48:49,105 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-11 21:48:49,110 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 0 case distinctions, treesize of input 164 treesize of output 134 [2018-04-11 21:48:49,113 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:49,113 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:49,114 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:49,117 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 60 treesize of output 123 [2018-04-11 21:48:49,118 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:49,131 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:49,197 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 4 xjuncts. [2018-04-11 21:48:49,197 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:203, output treesize:445 [2018-04-11 21:48:49,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 115 [2018-04-11 21:48:49,729 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:49,730 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:49,730 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:48:49,732 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 59 treesize of output 59 [2018-04-11 21:48:49,732 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 21:48:49,751 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:49,751 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 21:48:49,751 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:49,763 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 21:48:49,812 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:49,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 115 [2018-04-11 21:48:49,815 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:49,816 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:49,816 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:49,817 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:49,818 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:49,818 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:48:49,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 82 [2018-04-11 21:48:49,821 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:49,838 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:49,839 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 45 treesize of output 34 [2018-04-11 21:48:49,839 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 21:48:49,848 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 21:48:49,890 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 47 [2018-04-11 21:48:49,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 21:48:49,891 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:49,899 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:48:49,899 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 21:48:49,899 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:49,904 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:49,943 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:49,944 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 128 treesize of output 111 [2018-04-11 21:48:49,946 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:49,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 21 [2018-04-11 21:48:49,947 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:49,960 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:49,961 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:49,961 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:49,962 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:49,962 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:48:49,965 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 58 [2018-04-11 21:48:49,966 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 21:48:49,978 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:48:50,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 65 [2018-04-11 21:48:50,009 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:50,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 21:48:50,010 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:50,019 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:50,020 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:50,021 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:50,021 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:50,022 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:50,022 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:48:50,026 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 53 [2018-04-11 21:48:50,026 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:50,036 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:50,059 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 45 [2018-04-11 21:48:50,063 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:48:50,063 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:50,065 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 22 treesize of output 22 [2018-04-11 21:48:50,065 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 21:48:50,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 5 treesize of output 1 [2018-04-11 21:48:50,076 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:50,081 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:50,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:50,100 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 18 variables, input treesize:392, output treesize:7 [2018-04-11 21:48:50,164 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:48:50,182 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 21:48:50,182 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 44 [2018-04-11 21:48:50,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-04-11 21:48:50,182 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-04-11 21:48:50,182 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=1679, Unknown=2, NotChecked=0, Total=1892 [2018-04-11 21:48:50,182 INFO L87 Difference]: Start difference. First operand 463 states and 578 transitions. Second operand 44 states. [2018-04-11 21:48:52,382 WARN L151 SmtUtils]: Spent 145ms on a formula simplification. DAG size of input: 214 DAG size of output 111 [2018-04-11 21:48:52,600 WARN L151 SmtUtils]: Spent 140ms on a formula simplification. DAG size of input: 211 DAG size of output 108 [2018-04-11 21:48:53,007 WARN L151 SmtUtils]: Spent 169ms on a formula simplification. DAG size of input: 213 DAG size of output 110 [2018-04-11 21:48:53,281 WARN L151 SmtUtils]: Spent 143ms on a formula simplification. DAG size of input: 216 DAG size of output 112 [2018-04-11 21:48:53,528 WARN L151 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 218 DAG size of output 114 [2018-04-11 21:48:53,740 WARN L151 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 197 DAG size of output 98 [2018-04-11 21:48:53,951 WARN L151 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 220 DAG size of output 116 [2018-04-11 21:48:54,329 WARN L151 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 102 DAG size of output 98 [2018-04-11 21:48:54,577 WARN L151 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 204 DAG size of output 101 [2018-04-11 21:48:55,211 WARN L151 SmtUtils]: Spent 232ms on a formula simplification. DAG size of input: 145 DAG size of output 125 [2018-04-11 21:48:55,601 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 202 DAG size of output 100 [2018-04-11 21:48:55,915 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 204 DAG size of output 102 [2018-04-11 21:48:56,247 WARN L151 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 206 DAG size of output 104 [2018-04-11 21:48:57,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:48:57,456 INFO L93 Difference]: Finished difference Result 925 states and 1074 transitions. [2018-04-11 21:48:57,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-11 21:48:57,456 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 60 [2018-04-11 21:48:57,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:48:57,457 INFO L225 Difference]: With dead ends: 925 [2018-04-11 21:48:57,457 INFO L226 Difference]: Without dead ends: 925 [2018-04-11 21:48:57,457 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 42 SyntacticMatches, 5 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1696 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=1634, Invalid=5674, Unknown=2, NotChecked=0, Total=7310 [2018-04-11 21:48:57,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2018-04-11 21:48:57,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 437. [2018-04-11 21:48:57,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2018-04-11 21:48:57,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 536 transitions. [2018-04-11 21:48:57,460 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 536 transitions. Word has length 60 [2018-04-11 21:48:57,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:48:57,460 INFO L459 AbstractCegarLoop]: Abstraction has 437 states and 536 transitions. [2018-04-11 21:48:57,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-04-11 21:48:57,460 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 536 transitions. [2018-04-11 21:48:57,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-11 21:48:57,460 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:48:57,460 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:48:57,461 INFO L408 AbstractCegarLoop]: === Iteration 63 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:48:57,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1115327643, now seen corresponding path program 1 times [2018-04-11 21:48:57,461 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:48:57,461 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:48:57,461 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:57,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:57,461 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:48:57,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:57,466 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:48:57,605 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:48:57,605 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 21:48:57,605 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 21:48:57,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:48:57,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:48:57,627 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:48:57,656 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:57,657 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:57,657 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 21:48:57,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:57,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:57,661 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-04-11 21:48:57,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 21:48:57,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 21:48:57,684 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:57,685 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:57,689 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 21:48:57,690 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:33 [2018-04-11 21:48:57,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2018-04-11 21:48:57,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:48:57,735 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:57,738 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:57,743 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 21:48:57,743 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:33 [2018-04-11 21:48:57,745 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:57,746 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:57,746 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:57,747 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 22 treesize of output 25 [2018-04-11 21:48:57,747 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:57,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:57,751 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:34 [2018-04-11 21:48:57,840 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 27 treesize of output 49 [2018-04-11 21:48:57,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-04-11 21:48:57,841 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:57,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:57,856 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 55 treesize of output 56 [2018-04-11 21:48:57,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 21:48:57,858 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:57,862 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:57,868 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 21:48:57,868 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:72, output treesize:57 [2018-04-11 21:48:57,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 89 [2018-04-11 21:48:57,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 19 [2018-04-11 21:48:57,928 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:57,933 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:57,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 63 [2018-04-11 21:48:57,944 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 20 treesize of output 19 [2018-04-11 21:48:57,944 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:57,956 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:57,962 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 21:48:57,962 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:112, output treesize:82 [2018-04-11 21:48:58,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 135 treesize of output 122 [2018-04-11 21:48:58,226 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 111 treesize of output 96 [2018-04-11 21:48:58,226 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:58,263 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 107 treesize of output 85 [2018-04-11 21:48:58,264 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 21:48:58,299 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 85 treesize of output 69 [2018-04-11 21:48:58,299 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:58,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, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 77 [2018-04-11 21:48:58,334 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 21:48:58,369 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:58,370 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 103 treesize of output 92 [2018-04-11 21:48:58,370 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 21:48:58,411 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 77 treesize of output 61 [2018-04-11 21:48:58,412 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:58,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 77 [2018-04-11 21:48:58,446 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-04-11 21:48:58,487 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:58,499 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 117 [2018-04-11 21:48:58,500 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 21:48:58,558 INFO L267 ElimStorePlain]: Start of recursive call 2: 8 dim-1 vars, End of recursive call: 6 dim-0 vars, and 7 xjuncts. [2018-04-11 21:48:58,626 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 66 treesize of output 58 [2018-04-11 21:48:58,627 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 54 treesize of output 45 [2018-04-11 21:48:58,661 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:58,674 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 21:48:58,674 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:58,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-04-11 21:48:58,686 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:58,703 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 50 treesize of output 40 [2018-04-11 21:48:58,703 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:58,712 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 28 treesize of output 21 [2018-04-11 21:48:58,713 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:58,718 INFO L267 ElimStorePlain]: Start of recursive call 11: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:58,720 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 50 [2018-04-11 21:48:58,721 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 21:48:58,721 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:58,727 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:58,728 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 17 treesize of output 14 [2018-04-11 21:48:58,728 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:48:58,733 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 21:48:58,733 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:58,736 INFO L267 ElimStorePlain]: Start of recursive call 17: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:58,741 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 64 [2018-04-11 21:48:58,742 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 60 treesize of output 47 [2018-04-11 21:48:58,742 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:58,759 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:58,760 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 56 treesize of output 28 [2018-04-11 21:48:58,760 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 21:48:58,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-04-11 21:48:58,774 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:58,787 INFO L267 ElimStorePlain]: Start of recursive call 21: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:58,788 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 86 treesize of output 66 [2018-04-11 21:48:58,790 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 62 treesize of output 35 [2018-04-11 21:48:58,790 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:48:58,797 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 21:48:58,798 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:58,802 INFO L267 ElimStorePlain]: Start of recursive call 25: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:58,811 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 2 case distinctions, treesize of input 98 treesize of output 92 [2018-04-11 21:48:58,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 58 [2018-04-11 21:48:58,815 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:58,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 53 [2018-04-11 21:48:58,855 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 21:48:58,890 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:58,892 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 38 [2018-04-11 21:48:58,892 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:58,914 INFO L267 ElimStorePlain]: Start of recursive call 28: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:58,917 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 50 [2018-04-11 21:48:58,918 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 21:48:58,918 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:58,923 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 21:48:58,923 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:58,928 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 21:48:58,928 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:58,931 INFO L267 ElimStorePlain]: Start of recursive call 32: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:58,934 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 70 [2018-04-11 21:48:58,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-04-11 21:48:58,935 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:58,943 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 13 treesize of output 1 [2018-04-11 21:48:58,943 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:58,950 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:48:58,951 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 28 treesize of output 21 [2018-04-11 21:48:58,951 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:58,955 INFO L267 ElimStorePlain]: Start of recursive call 36: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:48:58,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 21:48:58,973 INFO L202 ElimStorePlain]: Needed 39 recursive calls to eliminate 3 variables, input treesize:157, output treesize:73 [2018-04-11 21:48:59,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 21:48:59,053 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:48:59,055 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 21:48:59,055 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:13 [2018-04-11 21:48:59,089 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:48:59,106 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 21:48:59,107 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 24] total 39 [2018-04-11 21:48:59,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-11 21:48:59,107 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-11 21:48:59,107 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1361, Unknown=0, NotChecked=0, Total=1482 [2018-04-11 21:48:59,107 INFO L87 Difference]: Start difference. First operand 437 states and 536 transitions. Second operand 39 states. [2018-04-11 21:49:02,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:49:02,309 INFO L93 Difference]: Finished difference Result 588 states and 688 transitions. [2018-04-11 21:49:02,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-11 21:49:02,309 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 60 [2018-04-11 21:49:02,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:49:02,310 INFO L225 Difference]: With dead ends: 588 [2018-04-11 21:49:02,310 INFO L226 Difference]: Without dead ends: 586 [2018-04-11 21:49:02,310 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1037 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=776, Invalid=4336, Unknown=0, NotChecked=0, Total=5112 [2018-04-11 21:49:02,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2018-04-11 21:49:02,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 435. [2018-04-11 21:49:02,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-04-11 21:49:02,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 533 transitions. [2018-04-11 21:49:02,313 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 533 transitions. Word has length 60 [2018-04-11 21:49:02,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:49:02,313 INFO L459 AbstractCegarLoop]: Abstraction has 435 states and 533 transitions. [2018-04-11 21:49:02,313 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-11 21:49:02,313 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 533 transitions. [2018-04-11 21:49:02,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-11 21:49:02,313 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:49:02,314 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:49:02,314 INFO L408 AbstractCegarLoop]: === Iteration 64 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:49:02,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1599938534, now seen corresponding path program 1 times [2018-04-11 21:49:02,314 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:49:02,314 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:49:02,315 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:49:02,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:49:02,315 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:49:02,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:49:02,325 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:49:02,729 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 21:49:02,729 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 21:49:02,729 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 21:49:02,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:49:02,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:49:02,753 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:49:02,780 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:49:02,781 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:49:02,781 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 21:49:02,781 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:02,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:49:02,783 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-04-11 21:49:02,796 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 21:49:02,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 21:49:02,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:02,798 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:49:02,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 21:49:02,805 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 21:49:02,805 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:02,806 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:49:02,810 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 21:49:02,810 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:19 [2018-04-11 21:49:02,843 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 57 treesize of output 51 [2018-04-11 21:49:02,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:49:02,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:02,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:49:02,854 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 23 treesize of output 14 [2018-04-11 21:49:02,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 21:49:02,855 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:02,856 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:49:02,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:49:02,860 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:65, output treesize:19 [2018-04-11 21:49:02,862 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:49:02,863 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:49:02,863 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 21:49:02,863 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:02,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:49:02,866 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2018-04-11 21:49:02,902 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 22 treesize of output 23 [2018-04-11 21:49:02,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:49:02,904 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:02,906 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:49:02,916 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 21:49:02,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:49:02,917 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:02,918 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:49:02,923 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 21:49:02,923 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:40, output treesize:18 [2018-04-11 21:49:02,944 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 69 treesize of output 63 [2018-04-11 21:49:02,945 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 20 treesize of output 19 [2018-04-11 21:49:02,946 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:02,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:49:02,956 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 49 treesize of output 50 [2018-04-11 21:49:02,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 21:49:02,957 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:02,960 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:49:02,964 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 21:49:02,964 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:76, output treesize:34 [2018-04-11 21:49:03,130 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 30 treesize of output 26 [2018-04-11 21:49:03,132 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:49:03,133 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 26 treesize of output 22 [2018-04-11 21:49:03,133 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:03,136 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:49:03,142 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 21:49:03,142 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:48 [2018-04-11 21:49:03,172 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:49:03,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 38 [2018-04-11 21:49:03,175 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 21:49:03,175 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:03,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 21:49:03,178 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:03,179 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:49:03,182 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 21:49:03,182 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:52, output treesize:10 [2018-04-11 21:49:03,207 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:49:03,207 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 21:49:03,207 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:03,210 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 21:49:03,210 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-04-11 21:49:03,240 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 21:49:03,256 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 21:49:03,256 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17] total 37 [2018-04-11 21:49:03,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-11 21:49:03,256 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-11 21:49:03,257 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1251, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 21:49:03,257 INFO L87 Difference]: Start difference. First operand 435 states and 533 transitions. Second operand 38 states. [2018-04-11 21:49:05,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:49:05,619 INFO L93 Difference]: Finished difference Result 590 states and 684 transitions. [2018-04-11 21:49:05,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-11 21:49:05,619 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 60 [2018-04-11 21:49:05,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:49:05,620 INFO L225 Difference]: With dead ends: 590 [2018-04-11 21:49:05,620 INFO L226 Difference]: Without dead ends: 590 [2018-04-11 21:49:05,620 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1278 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=760, Invalid=4070, Unknown=0, NotChecked=0, Total=4830 [2018-04-11 21:49:05,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2018-04-11 21:49:05,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 437. [2018-04-11 21:49:05,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2018-04-11 21:49:05,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 535 transitions. [2018-04-11 21:49:05,622 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 535 transitions. Word has length 60 [2018-04-11 21:49:05,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:49:05,623 INFO L459 AbstractCegarLoop]: Abstraction has 437 states and 535 transitions. [2018-04-11 21:49:05,623 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-11 21:49:05,623 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 535 transitions. [2018-04-11 21:49:05,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-11 21:49:05,623 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:49:05,623 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:49:05,623 INFO L408 AbstractCegarLoop]: === Iteration 65 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:49:05,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1009835691, now seen corresponding path program 1 times [2018-04-11 21:49:05,624 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:49:05,624 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:49:05,624 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:49:05,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:49:05,624 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:49:05,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:49: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 21:49:05,725 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 21:49:05,725 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 21:49:05,725 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 21:49:05,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:49:05,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:49:05,747 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:49:05,752 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:49:05,752 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:49:05,752 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 21:49:05,752 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:05,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:49:05,755 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-11 21:49:05,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 21:49:05,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, 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 21:49:05,761 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:05,762 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:49:05,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:49:05,764 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2018-04-11 21:49:05,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 21:49:05,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 21:49:05,771 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:05,773 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:49:05,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:49:05,777 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-04-11 21:49:05,791 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 21:49:05,793 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:49:05,793 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 21:49:05,793 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:05,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:49:05,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:49:05,801 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2018-04-11 21:49:05,815 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:49:05,816 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:49:05,816 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 21:49:05,816 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:05,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:49:05,820 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:32 [2018-04-11 21:49:05,836 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 37 treesize of output 34 [2018-04-11 21:49:05,838 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:49:05,839 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:49:05,839 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:49:05,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-04-11 21:49:05,841 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:05,847 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:49:05,853 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 21:49:05,853 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:43 [2018-04-11 21:49:05,897 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 3 case distinctions, treesize of input 87 treesize of output 77 [2018-04-11 21:49:05,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 91 [2018-04-11 21:49:05,899 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:05,929 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:49:05,929 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:49:05,930 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:49:05,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 91 [2018-04-11 21:49:05,947 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 8 xjuncts. [2018-04-11 21:49:05,992 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-11 21:49:06,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-04-11 21:49:06,019 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:87, output treesize:197 [2018-04-11 21:49:06,898 WARN L151 SmtUtils]: Spent 849ms on a formula simplification. DAG size of input: 61 DAG size of output 48 [2018-04-11 21:49:07,256 WARN L148 SmtUtils]: Spent 328ms on a formula simplification that was a NOOP. DAG size: 48 [2018-04-11 21:49:07,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 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 35 [2018-04-11 21:49:07,264 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:49:07,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 8 [2018-04-11 21:49:07,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:07,280 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 21:49:07,280 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:07,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:49:07,295 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 35 [2018-04-11 21:49:07,296 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:49:07,297 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 17 treesize of output 8 [2018-04-11 21:49:07,297 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:07,300 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 21:49:07,300 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:07,302 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:49:07,312 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 51 treesize of output 33 [2018-04-11 21:49:07,313 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 21:49:07,313 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:07,317 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:49:07,317 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 21:49:07,317 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:07,319 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:49:07,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:49:07,325 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 12 variables, input treesize:162, output treesize:5 [2018-04-11 21:49:07,343 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 21:49:07,360 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 21:49:07,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 21 [2018-04-11 21:49:07,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 21:49:07,360 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 21:49:07,360 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2018-04-11 21:49:07,360 INFO L87 Difference]: Start difference. First operand 437 states and 535 transitions. Second operand 22 states. [2018-04-11 21:49:16,199 WARN L151 SmtUtils]: Spent 8562ms on a formula simplification. DAG size of input: 101 DAG size of output 33 [2018-04-11 21:49:34,945 WARN L151 SmtUtils]: Spent 18701ms on a formula simplification. DAG size of input: 104 DAG size of output 70 [2018-04-11 21:49:35,832 WARN L151 SmtUtils]: Spent 377ms on a formula simplification. DAG size of input: 77 DAG size of output 66 [2018-04-11 21:49:36,278 WARN L151 SmtUtils]: Spent 415ms on a formula simplification. DAG size of input: 97 DAG size of output 63 [2018-04-11 21:49:36,839 WARN L151 SmtUtils]: Spent 354ms on a formula simplification. DAG size of input: 88 DAG size of output 58 [2018-04-11 21:49:37,359 WARN L151 SmtUtils]: Spent 378ms on a formula simplification. DAG size of input: 100 DAG size of output 66 [2018-04-11 21:49:37,645 WARN L148 SmtUtils]: Spent 213ms on a formula simplification that was a NOOP. DAG size: 51 [2018-04-11 21:49:38,147 WARN L151 SmtUtils]: Spent 418ms on a formula simplification. DAG size of input: 61 DAG size of output 59 [2018-04-11 21:49:38,553 WARN L151 SmtUtils]: Spent 353ms on a formula simplification. DAG size of input: 58 DAG size of output 56 [2018-04-11 21:49:39,044 WARN L151 SmtUtils]: Spent 411ms on a formula simplification. DAG size of input: 91 DAG size of output 61 [2018-04-11 21:49:40,013 WARN L151 SmtUtils]: Spent 431ms on a formula simplification. DAG size of input: 91 DAG size of output 61 [2018-04-11 21:49:40,246 WARN L148 SmtUtils]: Spent 155ms on a formula simplification that was a NOOP. DAG size: 54 [2018-04-11 21:49:40,625 WARN L148 SmtUtils]: Spent 258ms on a formula simplification that was a NOOP. DAG size: 51 [2018-04-11 21:49:41,262 WARN L151 SmtUtils]: Spent 403ms on a formula simplification. DAG size of input: 84 DAG size of output 55 [2018-04-11 21:49:41,755 WARN L151 SmtUtils]: Spent 441ms on a formula simplification. DAG size of input: 87 DAG size of output 58 [2018-04-11 21:49:41,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:49:41,775 INFO L93 Difference]: Finished difference Result 992 states and 1177 transitions. [2018-04-11 21:49:41,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-11 21:49:41,775 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 61 [2018-04-11 21:49:41,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:49:41,776 INFO L225 Difference]: With dead ends: 992 [2018-04-11 21:49:41,776 INFO L226 Difference]: Without dead ends: 992 [2018-04-11 21:49:41,776 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 50 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 34.1s TimeCoverageRelationStatistics Valid=409, Invalid=1483, Unknown=0, NotChecked=0, Total=1892 [2018-04-11 21:49:41,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 992 states. [2018-04-11 21:49:41,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 992 to 506. [2018-04-11 21:49:41,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2018-04-11 21:49:41,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 630 transitions. [2018-04-11 21:49:41,779 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 630 transitions. Word has length 61 [2018-04-11 21:49:41,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:49:41,779 INFO L459 AbstractCegarLoop]: Abstraction has 506 states and 630 transitions. [2018-04-11 21:49:41,779 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 21:49:41,779 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 630 transitions. [2018-04-11 21:49:41,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-11 21:49:41,780 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:49:41,780 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:49:41,780 INFO L408 AbstractCegarLoop]: === Iteration 66 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:49:41,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1009835692, now seen corresponding path program 1 times [2018-04-11 21:49:41,780 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:49:41,780 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:49:41,780 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:49:41,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:49:41,781 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:49:41,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:49:41,786 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:49:41,920 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 21:49:41,921 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 21:49:41,921 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 21:49:41,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:49:41,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:49:41,942 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:49:41,947 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:49:41,947 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:49:41,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 21:49:41,947 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:41,950 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:49:41,950 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2018-04-11 21:49:41,955 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 21:49:41,956 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 21:49:41,956 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:41,957 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:49:41,963 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 21:49:41,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 21:49:41,964 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:41,965 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:49:41,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:49:41,969 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2018-04-11 21:49:41,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-04-11 21:49:41,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 21:49:41,977 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:41,981 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:49:41,990 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 30 treesize of output 31 [2018-04-11 21:49:41,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 21:49:41,991 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:41,994 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:49:42,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:49:42,000 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:45 [2018-04-11 21:49:42,023 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 32 treesize of output 42 [2018-04-11 21:49:42,025 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:49:42,025 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 21:49:42,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:42,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:49:42,042 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 52 treesize of output 51 [2018-04-11 21:49:42,044 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:49:42,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 16 treesize of output 23 [2018-04-11 21:49:42,044 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:42,051 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:49:42,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:49:42,059 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:67 [2018-04-11 21:49:42,082 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:49:42,083 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:49:42,083 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 21:49:42,083 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:42,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:49:42,091 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:66 [2018-04-11 21:49:42,118 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 45 treesize of output 49 [2018-04-11 21:49:42,120 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:49:42,120 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:49:42,121 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:49:42,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 58 [2018-04-11 21:49:42,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:42,131 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:49:42,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 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 21:49:42,150 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:49:42,151 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:49:42,151 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:49:42,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-04-11 21:49:42,153 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:42,162 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:49:42,173 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 21:49:42,173 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:104, output treesize:79 [2018-04-11 21:49:42,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 99 [2018-04-11 21:49:42,241 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 4 case distinctions, treesize of input 69 treesize of output 96 [2018-04-11 21:49:42,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-04-11 21:49:42,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2018-04-11 21:49:42,279 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:42,300 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 21:49:42,329 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 0 case distinctions, treesize of input 134 treesize of output 86 [2018-04-11 21:49:42,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 83 [2018-04-11 21:49:42,333 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:42,341 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:49:42,353 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 3 case distinctions, treesize of input 123 treesize of output 109 [2018-04-11 21:49:42,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 127 [2018-04-11 21:49:42,355 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:42,410 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 6 case distinctions, treesize of input 85 treesize of output 118 [2018-04-11 21:49:42,411 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 8 xjuncts. [2018-04-11 21:49:42,466 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-11 21:49:42,470 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 0 case distinctions, treesize of input 134 treesize of output 86 [2018-04-11 21:49:42,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 83 [2018-04-11 21:49:42,474 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:42,483 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:49:42,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-11 21:49:42,540 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:135, output treesize:291 [2018-04-11 21:49:42,649 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 84 treesize of output 82 [2018-04-11 21:49:42,650 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 21:49:42,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:42,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:49:42,715 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 83 treesize of output 61 [2018-04-11 21:49:42,717 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 37 treesize of output 24 [2018-04-11 21:49:42,717 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:42,722 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:49:42,744 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 84 treesize of output 70 [2018-04-11 21:49:42,745 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 21:49:42,745 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:42,750 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:49:42,769 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:49:42,770 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 40 [2018-04-11 21:49:42,772 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 19 treesize of output 6 [2018-04-11 21:49:42,772 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:42,776 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 21:49:42,776 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:42,778 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:49:42,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2018-04-11 21:49:42,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 21:49:42,796 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:42,798 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:49:42,811 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:49:42,812 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 40 [2018-04-11 21:49:42,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 15 [2018-04-11 21:49:42,813 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:42,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-04-11 21:49:42,818 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:42,821 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:49:42,829 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 21:49:42,829 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 12 variables, input treesize:252, output treesize:19 [2018-04-11 21:49:42,854 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 21:49:42,872 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 21:49:42,872 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 21 [2018-04-11 21:49:42,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 21:49:42,872 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 21:49:42,872 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2018-04-11 21:49:42,872 INFO L87 Difference]: Start difference. First operand 506 states and 630 transitions. Second operand 22 states. [2018-04-11 21:49:45,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:49:45,201 INFO L93 Difference]: Finished difference Result 1134 states and 1339 transitions. [2018-04-11 21:49:45,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-11 21:49:45,201 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 61 [2018-04-11 21:49:45,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:49:45,202 INFO L225 Difference]: With dead ends: 1134 [2018-04-11 21:49:45,202 INFO L226 Difference]: Without dead ends: 1134 [2018-04-11 21:49:45,202 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 50 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=368, Invalid=1524, Unknown=0, NotChecked=0, Total=1892 [2018-04-11 21:49:45,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1134 states. [2018-04-11 21:49:45,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1134 to 539. [2018-04-11 21:49:45,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-04-11 21:49:45,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 680 transitions. [2018-04-11 21:49:45,209 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 680 transitions. Word has length 61 [2018-04-11 21:49:45,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:49:45,210 INFO L459 AbstractCegarLoop]: Abstraction has 539 states and 680 transitions. [2018-04-11 21:49:45,210 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 21:49:45,210 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 680 transitions. [2018-04-11 21:49:45,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-11 21:49:45,210 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:49:45,210 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:49:45,210 INFO L408 AbstractCegarLoop]: === Iteration 67 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:49:45,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1015561329, now seen corresponding path program 1 times [2018-04-11 21:49:45,210 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:49:45,210 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:49:45,211 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:49:45,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:49:45,211 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:49:45,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:49:45,215 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:49:45,242 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 21:49:45,243 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:49:45,243 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 21:49:45,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 21:49:45,243 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 21:49:45,243 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-11 21:49:45,243 INFO L87 Difference]: Start difference. First operand 539 states and 680 transitions. Second operand 6 states. [2018-04-11 21:49:45,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:49:45,342 INFO L93 Difference]: Finished difference Result 540 states and 677 transitions. [2018-04-11 21:49:45,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 21:49:45,343 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-04-11 21:49:45,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:49:45,343 INFO L225 Difference]: With dead ends: 540 [2018-04-11 21:49:45,343 INFO L226 Difference]: Without dead ends: 540 [2018-04-11 21:49:45,343 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-04-11 21:49:45,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2018-04-11 21:49:45,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 539. [2018-04-11 21:49:45,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-04-11 21:49:45,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 677 transitions. [2018-04-11 21:49:45,346 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 677 transitions. Word has length 61 [2018-04-11 21:49:45,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:49:45,346 INFO L459 AbstractCegarLoop]: Abstraction has 539 states and 677 transitions. [2018-04-11 21:49:45,346 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 21:49:45,346 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 677 transitions. [2018-04-11 21:49:45,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-11 21:49:45,346 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:49:45,346 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:49:45,346 INFO L408 AbstractCegarLoop]: === Iteration 68 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:49:45,346 INFO L82 PathProgramCache]: Analyzing trace with hash 972744023, now seen corresponding path program 1 times [2018-04-11 21:49:45,346 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:49:45,346 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:49:45,347 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:49:45,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:49:45,347 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:49:45,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:49:45,354 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:49:45,404 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:49:45,404 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 21:49:45,404 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 21:49:45,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 21:49:45,405 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 21:49:45,405 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 21:49:45,405 INFO L87 Difference]: Start difference. First operand 539 states and 677 transitions. Second operand 6 states. [2018-04-11 21:49:45,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:49:45,672 INFO L93 Difference]: Finished difference Result 938 states and 1177 transitions. [2018-04-11 21:49:45,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 21:49:45,673 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-04-11 21:49:45,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:49:45,673 INFO L225 Difference]: With dead ends: 938 [2018-04-11 21:49:45,673 INFO L226 Difference]: Without dead ends: 938 [2018-04-11 21:49:45,673 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-04-11 21:49:45,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2018-04-11 21:49:45,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 546. [2018-04-11 21:49:45,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2018-04-11 21:49:45,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 686 transitions. [2018-04-11 21:49:45,677 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 686 transitions. Word has length 61 [2018-04-11 21:49:45,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:49:45,677 INFO L459 AbstractCegarLoop]: Abstraction has 546 states and 686 transitions. [2018-04-11 21:49:45,677 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 21:49:45,677 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 686 transitions. [2018-04-11 21:49:45,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-11 21:49:45,677 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:49:45,677 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:49:45,677 INFO L408 AbstractCegarLoop]: === Iteration 69 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:49:45,677 INFO L82 PathProgramCache]: Analyzing trace with hash 972744024, now seen corresponding path program 1 times [2018-04-11 21:49:45,678 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:49:45,678 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:49:45,678 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:49:45,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:49:45,678 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:49:45,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:49:45,693 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:49:46,150 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:49:46,150 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 21:49:46,150 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 21:49:46,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:49:46,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:49:46,179 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:49:46,194 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:49:46,195 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:49:46,195 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 21:49:46,195 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:46,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:49:46,197 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:10 [2018-04-11 21:49:46,207 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 21:49:46,208 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 21:49:46,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:46,209 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:49:46,212 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 21:49:46,213 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-11 21:49:46,239 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 34 treesize of output 28 [2018-04-11 21:49: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 14 treesize of output 13 [2018-04-11 21:49:46,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:46,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:49:46,246 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 21:49:46,246 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:21 [2018-04-11 21:49:46,262 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:49:46,262 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:49:46,262 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 21:49:46,262 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:46,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:49:46,266 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2018-04-11 21:49:46,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-04-11 21:49:46,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 27 [2018-04-11 21:49:46,304 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 21:49:46,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:49:46,314 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 21:49:46,314 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:32 [2018-04-11 21:49:46,337 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 29 treesize of output 30 [2018-04-11 21:49:46,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:49:46,339 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:46,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:49:46,349 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 21:49:46,349 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:39 [2018-04-11 21:49:46,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 37 [2018-04-11 21:49:46,377 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:49:46,378 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 21:49:46,378 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:46,384 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:49:46,391 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 21:49:46,391 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:48 [2018-04-11 21:49:46,419 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:49:46,419 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:49:46,420 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 21:49:46,420 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:46,427 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 21:49:46,427 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:53, output treesize:47 [2018-04-11 21:49:46,451 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 47 treesize of output 44 [2018-04-11 21:49:46,453 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:49:46,453 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:49:46,454 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:49:46,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-04-11 21:49:46,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:46,462 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:49:46,469 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 21:49:46,469 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:60, output treesize:53 [2018-04-11 21:49:46,531 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 3 case distinctions, treesize of input 88 treesize of output 78 [2018-04-11 21:49:46,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 92 [2018-04-11 21:49:46,533 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:46,554 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:49:46,555 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:49:46,556 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:49:46,571 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 6 case distinctions, treesize of input 54 treesize of output 107 [2018-04-11 21:49:46,572 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 8 xjuncts. [2018-04-11 21:49:46,619 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-11 21:49:46,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2018-04-11 21:49:46,649 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:93, output treesize:221 [2018-04-11 21:49:47,413 WARN L148 SmtUtils]: Spent 612ms on a formula simplification that was a NOOP. DAG size: 79 [2018-04-11 21:49:47,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 67 [2018-04-11 21:49:47,422 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:47,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 59 [2018-04-11 21:49:47,424 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:47,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 56 treesize of output 55 [2018-04-11 21:49:47,429 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:47,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 59 [2018-04-11 21:49:47,430 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:47,462 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2018-04-11 21:49:47,462 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:245, output treesize:241 [2018-04-11 21:49:48,378 WARN L148 SmtUtils]: Spent 870ms on a formula simplification that was a NOOP. DAG size: 83 [2018-04-11 21:49:49,324 WARN L148 SmtUtils]: Spent 890ms on a formula simplification that was a NOOP. DAG size: 83 [2018-04-11 21:49:50,561 WARN L148 SmtUtils]: Spent 1193ms on a formula simplification that was a NOOP. DAG size: 87 [2018-04-11 21:49:50,568 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:49:50,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 95 [2018-04-11 21:49:50,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 96 [2018-04-11 21:49:50,580 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:50,627 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:49:50,627 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:49:50,628 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:49:50,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 110 [2018-04-11 21:49:50,644 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 8 xjuncts. [2018-04-11 21:49:50,714 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-11 21:49:50,831 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:49:50,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, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 93 [2018-04-11 21:49:50,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 89 treesize of output 88 [2018-04-11 21:49:50,855 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:50,900 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:49:50,909 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 4 case distinctions, treesize of input 64 treesize of output 87 [2018-04-11 21:49:50,910 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-04-11 21:49:50,952 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 21:49:51,091 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:49:51,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 89 [2018-04-11 21:49:51,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 84 [2018-04-11 21:49:51,125 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:51,166 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:49:51,175 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 4 case distinctions, treesize of input 60 treesize of output 83 [2018-04-11 21:49:51,175 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-04-11 21:49:51,217 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 21:49:51,366 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:49:51,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 93 [2018-04-11 21:49:51,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 88 [2018-04-11 21:49:51,379 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 21:49:51,411 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:49:51,422 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 4 case distinctions, treesize of input 64 treesize of output 87 [2018-04-11 21:49:51,422 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 4 xjuncts. [2018-04-11 21:49:51,462 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 21:49:51,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-2 vars, End of recursive call: 17 dim-0 vars, and 13 xjuncts. [2018-04-11 21:49:51,640 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 16 variables, input treesize:325, output treesize:741 [2018-04-11 21:49:59,772 WARN L151 SmtUtils]: Spent 8011ms on a formula simplification. DAG size of input: 154 DAG size of output 130 [2018-04-11 21:50:05,012 WARN L148 SmtUtils]: Spent 5084ms on a formula simplification that was a NOOP. DAG size: 137 [2018-04-11 21:50:05,024 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 162 treesize of output 163 [2018-04-11 21:50:05,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 21:50:05,026 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:50:05,043 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:50:11,664 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:50:11,676 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 3 case distinctions, treesize of input 149 treesize of output 169 [2018-04-11 21:50:11,679 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:50:11,680 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 153 treesize of output 170 [2018-04-11 21:50:11,680 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:50:11,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 139 [2018-04-11 21:50:11,725 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 21:50:11,754 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:50:16,037 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 139 treesize of output 130 [2018-04-11 21:50:16,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 21:50:16,048 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 21:50:16,067 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:50:19,382 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:50:19,395 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 3 case distinctions, treesize of input 153 treesize of output 173 [2018-04-11 21:50:19,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 165 [2018-04-11 21:50:19,398 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 21:50:19,470 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:50:22,528 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:50:22,541 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 3 case distinctions, treesize of input 153 treesize of output 173 [2018-04-11 21:50:22,543 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 166 treesize of output 165 [2018-04-11 21:50:22,543 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 21:50:22,586 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:50:24,953 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 143 treesize of output 134 [2018-04-11 21:50:24,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 21:50:24,955 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 21:50:24,967 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:50:26,389 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 149 treesize of output 150 [2018-04-11 21:50:26,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 21:50:26,390 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-11 21:50:26,409 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:50:27,390 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:50:27,402 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 3 case distinctions, treesize of input 149 treesize of output 169 [2018-04-11 21:50:27,405 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 162 treesize of output 161 [2018-04-11 21:50:27,405 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-11 21:50:27,454 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 135 treesize of output 152 [2018-04-11 21:50:27,454 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-04-11 21:50:27,489 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 21:50:28,728 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 139 treesize of output 130 [2018-04-11 21:50:28,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 21:50:28,730 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-11 21:50:28,743 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:50:28,745 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:50:28,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 134 [2018-04-11 21:50:28,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-04-11 21:50:28,749 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-11 21:50:28,760 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:50:29,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, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 152 treesize of output 158 [2018-04-11 21:50:29,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 156 [2018-04-11 21:50:29,670 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-11 21:50:29,735 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:50:29,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 132 treesize of output 175 [2018-04-11 21:50:29,756 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 4 xjuncts. [2018-04-11 21:50:29,828 INFO L267 ElimStorePlain]: Start of recursive call 24: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 21:50:30,549 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 143 treesize of output 134 [2018-04-11 21:50:30,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 21:50:30,550 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-11 21:50:30,561 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:50:31,179 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 3 case distinctions, treesize of input 166 treesize of output 172 [2018-04-11 21:50:31,182 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:50:31,194 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 4 case distinctions, treesize of input 158 treesize of output 205 [2018-04-11 21:50:31,195 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 4 xjuncts. [2018-04-11 21:50:31,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 157 treesize of output 156 [2018-04-11 21:50:31,293 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-04-11 21:50:31,360 INFO L267 ElimStorePlain]: Start of recursive call 29: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 21:50:31,974 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 174 treesize of output 165 [2018-04-11 21:50:31,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 21:50:31,975 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-04-11 21:50:31,994 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:50:32,503 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:50:32,515 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 3 case distinctions, treesize of input 139 treesize of output 159 [2018-04-11 21:50:32,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 151 [2018-04-11 21:50:32,518 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-04-11 21:50:32,582 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 127 treesize of output 146 [2018-04-11 21:50:32,582 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 2 xjuncts. [2018-04-11 21:50:32,623 INFO L267 ElimStorePlain]: Start of recursive call 34: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 21:50:33,072 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 157 treesize of output 148 [2018-04-11 21:50:33,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 21:50:33,074 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-04-11 21:50:33,089 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:50:33,092 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 156 treesize of output 147 [2018-04-11 21:50:33,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 21:50:33,094 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-04-11 21:50:33,109 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:50:33,112 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 161 treesize of output 152 [2018-04-11 21:50:33,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 20 treesize of output 19 [2018-04-11 21:50:33,114 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-04-11 21:50:33,130 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:50:33,533 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 166 treesize of output 157 [2018-04-11 21:50:33,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 21:50:33,535 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-04-11 21:50:33,551 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:50:33,920 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 3 case distinctions, treesize of input 164 treesize of output 164 [2018-04-11 21:50:33,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 168 [2018-04-11 21:50:33,923 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-04-11 21:50:33,996 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:50:33,996 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:50:33,998 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:50:34,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 140 treesize of output 220 [2018-04-11 21:50:34,018 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 8 xjuncts. [2018-04-11 21:50:34,117 INFO L267 ElimStorePlain]: Start of recursive call 45: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 21:50:34,517 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 3 case distinctions, treesize of input 156 treesize of output 162 [2018-04-11 21:50:34,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 160 [2018-04-11 21:50:34,520 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-04-11 21:50:34,570 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:50:34,582 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 4 case distinctions, treesize of input 140 treesize of output 187 [2018-04-11 21:50:34,587 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 4 xjuncts. [2018-04-11 21:50:34,649 INFO L267 ElimStorePlain]: Start of recursive call 48: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 21:50:35,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 15 dim-0 vars, 18 dim-2 vars, End of recursive call: 23 dim-0 vars, and 19 xjuncts. [2018-04-11 21:50:35,062 INFO L202 ElimStorePlain]: Needed 50 recursive calls to eliminate 33 variables, input treesize:1422, output treesize:2651 [2018-04-11 21:50:57,748 WARN L151 SmtUtils]: Spent 22443ms on a formula simplification. DAG size of input: 267 DAG size of output 224 [2018-04-11 21:50:57,791 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:50:57,794 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:50:57,795 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:50:57,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 159 treesize of output 199 [2018-04-11 21:50:57,803 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 21:50:58,378 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:50:58,381 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:50:58,381 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:50:58,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 135 treesize of output 201 [2018-04-11 21:50:58,388 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 21:50:59,080 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:50:59,082 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:50:59,083 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:50:59,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 151 treesize of output 191 [2018-04-11 21:50:59,091 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 21:50:59,717 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:50:59,718 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:50:59,718 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 151 treesize of output 145 [2018-04-11 21:50:59,719 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:00,318 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:00,320 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:00,321 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:00,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 151 treesize of output 191 [2018-04-11 21:51:00,329 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-11 21:51:00,972 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:00,974 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:01,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 145 treesize of output 173 [2018-04-11 21:51:01,012 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-11 21:51:01,922 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:01,923 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:01,923 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 164 treesize of output 158 [2018-04-11 21:51:01,923 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:01,925 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:01,926 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:01,926 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 158 treesize of output 152 [2018-04-11 21:51:01,926 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:02,688 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:02,689 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:02,689 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 150 treesize of output 144 [2018-04-11 21:51:02,689 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:02,691 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:02,692 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:02,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 156 treesize of output 150 [2018-04-11 21:51:02,692 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:03,385 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:03,385 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:03,386 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:03,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 131 treesize of output 161 [2018-04-11 21:51:03,391 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-04-11 21:51:04,149 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:04,152 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:04,152 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:04,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 197 [2018-04-11 21:51:04,160 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-04-11 21:51:04,930 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:04,931 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:04,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 122 [2018-04-11 21:51:04,931 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:04,933 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:04,933 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:04,933 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 124 treesize of output 118 [2018-04-11 21:51:04,934 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:05,691 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:05,693 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:05,694 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:05,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 134 treesize of output 174 [2018-04-11 21:51:05,702 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-04-11 21:51:06,543 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:06,544 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:06,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, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 147 [2018-04-11 21:51:06,544 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:07,373 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:07,374 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:07,374 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 168 treesize of output 162 [2018-04-11 21:51:07,374 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:07,376 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:07,376 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:07,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, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 156 [2018-04-11 21:51:07,377 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:08,198 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:08,201 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:08,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 147 treesize of output 177 [2018-04-11 21:51:08,209 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-04-11 21:51:09,007 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:09,008 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:09,009 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 156 treesize of output 150 [2018-04-11 21:51:09,009 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:09,010 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:09,011 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:09,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 144 [2018-04-11 21:51:09,012 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:09,807 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:09,807 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:09,808 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 151 treesize of output 145 [2018-04-11 21:51:09,808 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:10,567 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:10,569 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:10,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 145 treesize of output 173 [2018-04-11 21:51:10,577 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 2 xjuncts. [2018-04-11 21:51:11,418 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:11,418 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:11,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 146 [2018-04-11 21:51:11,419 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:11,421 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:11,421 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:11,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 150 [2018-04-11 21:51:11,422 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:12,243 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:12,243 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:12,244 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 139 treesize of output 133 [2018-04-11 21:51:12,244 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:12,245 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:12,246 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:12,246 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 133 treesize of output 127 [2018-04-11 21:51:12,246 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:13,040 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:13,042 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:13,043 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:13,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 153 treesize of output 193 [2018-04-11 21:51:13,050 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 2 xjuncts. [2018-04-11 21:51:13,830 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:13,831 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:13,831 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 134 treesize of output 128 [2018-04-11 21:51:13,831 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:14,597 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:14,598 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:14,598 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 157 treesize of output 151 [2018-04-11 21:51:14,598 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:15,355 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:15,356 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:15,356 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 158 treesize of output 152 [2018-04-11 21:51:15,356 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:15,358 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:15,358 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:15,358 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 164 treesize of output 158 [2018-04-11 21:51:15,359 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:16,107 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:16,109 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:16,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 151 treesize of output 181 [2018-04-11 21:51:16,116 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 2 xjuncts. [2018-04-11 21:51:16,896 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:16,896 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51: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, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 141 [2018-04-11 21:51:16,897 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:17,689 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:17,691 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:17,692 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:17,693 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:17,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 141 treesize of output 187 [2018-04-11 21:51:17,701 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 2 xjuncts. [2018-04-11 21:51:18,539 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:18,542 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:18,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 141 treesize of output 171 [2018-04-11 21:51:18,550 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 2 xjuncts. [2018-04-11 21:51:19,414 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:19,414 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:19,414 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 144 treesize of output 138 [2018-04-11 21:51:19,415 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:19,416 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:19,417 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:19,417 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 138 treesize of output 132 [2018-04-11 21:51:19,417 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:20,280 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:20,280 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:20,281 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 153 treesize of output 147 [2018-04-11 21:51:20,281 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:21,103 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:21,105 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:21,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 128 treesize of output 158 [2018-04-11 21:51:21,113 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 2 xjuncts. [2018-04-11 21:51:21,961 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:21,964 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:21,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 147 treesize of output 177 [2018-04-11 21:51:21,971 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 2 xjuncts. [2018-04-11 21:51:22,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 34 dim-0 vars, 32 dim-1 vars, End of recursive call: 52 dim-0 vars, and 32 xjuncts. [2018-04-11 21:51:22,842 INFO L202 ElimStorePlain]: Needed 42 recursive calls to eliminate 66 variables, input treesize:2359, output treesize:4609 [2018-04-11 21:51:46,011 WARN L148 SmtUtils]: Spent 22807ms on a formula simplification that was a NOOP. DAG size: 507 [2018-04-11 21:51:46,060 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:46,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, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 140 [2018-04-11 21:51:46,064 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 71 treesize of output 65 [2018-04-11 21:51:46,064 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:46,076 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 87 treesize of output 44 [2018-04-11 21:51:46,077 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:46,086 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:51:47,572 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 148 treesize of output 136 [2018-04-11 21:51:47,573 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 97 treesize of output 66 [2018-04-11 21:51:47,573 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:47,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-11 21:51:47,585 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:47,593 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:51:49,088 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 173 treesize of output 142 [2018-04-11 21:51:49,095 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:49,096 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:49,096 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:49,098 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 135 treesize of output 139 [2018-04-11 21:51:49,098 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:49,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 129 treesize of output 118 [2018-04-11 21:51:49,136 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-04-11 21:51:49,176 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 115 treesize of output 99 [2018-04-11 21:51:49,176 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 21:51:49,205 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 99 treesize of output 82 [2018-04-11 21:51:49,206 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:49,235 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:49,235 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:49,236 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:49,247 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 138 [2018-04-11 21:51:49,248 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-11 21:51:49,316 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 21:51:50,983 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 176 treesize of output 156 [2018-04-11 21:51:50,985 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 100 treesize of output 69 [2018-04-11 21:51:50,985 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:51,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-04-11 21:51:51,000 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 21:51:51,012 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:51:52,684 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 90 treesize of output 76 [2018-04-11 21:51:52,686 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 9 treesize of output 3 [2018-04-11 21:51:52,686 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:52,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 21 [2018-04-11 21:51:52,696 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:52,703 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:51:52,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 64 [2018-04-11 21:51:52,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 16 [2018-04-11 21:51:52,706 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:52,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-11 21:51:52,714 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:52,721 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:51:52,722 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 68 treesize of output 58 [2018-04-11 21:51:52,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 16 [2018-04-11 21:51:52,724 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:52,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-11 21:51:52,731 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:52,737 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:51:52,738 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 102 treesize of output 86 [2018-04-11 21:51:52,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2018-04-11 21:51:52,740 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:52,760 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 54 treesize of output 27 [2018-04-11 21:51:52,760 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:52,769 INFO L267 ElimStorePlain]: Start of recursive call 26: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:51:54,355 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:54,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 180 treesize of output 167 [2018-04-11 21:51:54,366 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 1 case distinctions, treesize of input 148 treesize of output 138 [2018-04-11 21:51:54,366 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 2 xjuncts. [2018-04-11 21:51:54,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 84 [2018-04-11 21:51:54,423 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:51:54,425 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:51:54,425 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 115 treesize of output 93 [2018-04-11 21:51:54,425 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:54,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 142 treesize of output 126 [2018-04-11 21:51:54,474 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 2 xjuncts. [2018-04-11 21:51:54,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 114 treesize of output 95 [2018-04-11 21:51:54,521 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:54,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 81 [2018-04-11 21:51:54,562 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:51:54,602 INFO L267 ElimStorePlain]: Start of recursive call 29: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-11 21:51:56,308 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 171 treesize of output 152 [2018-04-11 21:51:56,310 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 145 treesize of output 120 [2018-04-11 21:51:56,311 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:56,341 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 120 treesize of output 97 [2018-04-11 21:51:56,342 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:56,369 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 133 treesize of output 91 [2018-04-11 21:51:56,370 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:56,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 78 [2018-04-11 21:51:56,399 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 21:51:56,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 78 [2018-04-11 21:51:56,438 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 21:51:56,473 INFO L267 ElimStorePlain]: Start of recursive call 36: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-11 21:51:58,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 54 [2018-04-11 21:51:58,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 16 [2018-04-11 21:51:58,286 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:58,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-11 21:51:58,292 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:58,297 INFO L267 ElimStorePlain]: Start of recursive call 42: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:51:58,299 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 74 treesize of output 64 [2018-04-11 21:51:58,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 16 [2018-04-11 21:51:58,300 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:58,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-11 21:51:58,316 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:58,324 INFO L267 ElimStorePlain]: Start of recursive call 45: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:51:58,326 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 74 treesize of output 64 [2018-04-11 21:51:58,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2018-04-11 21:51:58,327 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:58,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2018-04-11 21:51:58,336 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-04-11 21:51:58,343 INFO L267 ElimStorePlain]: Start of recursive call 48: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:52:00,075 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:52:00,076 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 79 treesize of output 71 [2018-04-11 21:52:00,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 18 [2018-04-11 21:52:00,077 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:00,085 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 21:52:00,085 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:00,090 INFO L267 ElimStorePlain]: Start of recursive call 51: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:52:02,058 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 81 treesize of output 71 [2018-04-11 21:52:02,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2018-04-11 21:52:02,059 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:02,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2018-04-11 21:52:02,070 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:02,077 INFO L267 ElimStorePlain]: Start of recursive call 54: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:52:02,078 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:52:02,079 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 65 [2018-04-11 21:52:02,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 16 [2018-04-11 21:52:02,080 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:02,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-11 21:52:02,088 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:02,097 INFO L267 ElimStorePlain]: Start of recursive call 57: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:52:02,099 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 81 treesize of output 71 [2018-04-11 21:52:02,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2018-04-11 21:52:02,116 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:02,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2018-04-11 21:52:02,127 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:02,135 INFO L267 ElimStorePlain]: Start of recursive call 60: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:52:03,807 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 161 treesize of output 125 [2018-04-11 21:52:03,809 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 63 treesize of output 53 [2018-04-11 21:52:03,809 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:03,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 44 [2018-04-11 21:52:03,821 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:03,829 INFO L267 ElimStorePlain]: Start of recursive call 63: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:52:05,487 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:52:05,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 136 [2018-04-11 21:52:05,490 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:52:05,491 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 39 treesize of output 28 [2018-04-11 21:52:05,491 INFO L267 ElimStorePlain]: Start of recursive call 67: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:52:05,505 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 55 treesize of output 31 [2018-04-11 21:52:05,506 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:05,514 INFO L267 ElimStorePlain]: Start of recursive call 66: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:52:07,103 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 167 treesize of output 150 [2018-04-11 21:52:07,108 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 131 treesize of output 123 [2018-04-11 21:52:07,109 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 2 xjuncts. [2018-04-11 21:52:07,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 122 [2018-04-11 21:52:07,157 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:07,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 78 [2018-04-11 21:52:07,209 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 2 xjuncts. [2018-04-11 21:52:07,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 100 [2018-04-11 21:52:07,214 INFO L267 ElimStorePlain]: Start of recursive call 73: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 21:52:07,279 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 122 treesize of output 97 [2018-04-11 21:52:07,280 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:07,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 78 [2018-04-11 21:52:07,346 INFO L267 ElimStorePlain]: Start of recursive call 75: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:52:07,408 INFO L267 ElimStorePlain]: Start of recursive call 69: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-04-11 21:52:09,185 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 68 treesize of output 58 [2018-04-11 21:52:09,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2018-04-11 21:52:09,186 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:09,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 26 treesize of output 11 [2018-04-11 21:52:09,194 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:09,199 INFO L267 ElimStorePlain]: Start of recursive call 76: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:52:10,977 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 67 treesize of output 57 [2018-04-11 21:52:10,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 16 [2018-04-11 21:52:10,978 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:10,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-11 21:52:10,985 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:10,990 INFO L267 ElimStorePlain]: Start of recursive call 79: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:52:10,992 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 74 treesize of output 64 [2018-04-11 21:52:10,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2018-04-11 21:52:10,993 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:11,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2018-04-11 21:52:11,002 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:11,008 INFO L267 ElimStorePlain]: Start of recursive call 82: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:52:11,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 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 21:52:11,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 16 [2018-04-11 21:52:11,013 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:11,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-11 21:52:11,022 INFO L267 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:11,029 INFO L267 ElimStorePlain]: Start of recursive call 85: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:52:11,031 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 96 treesize of output 80 [2018-04-11 21:52:11,032 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 51 treesize of output 24 [2018-04-11 21:52:11,032 INFO L267 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:11,042 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 14 treesize of output 10 [2018-04-11 21:52:11,042 INFO L267 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:11,049 INFO L267 ElimStorePlain]: Start of recursive call 88: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:52:11,050 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 86 treesize of output 70 [2018-04-11 21:52:11,051 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 26 treesize of output 14 [2018-04-11 21:52:11,052 INFO L267 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:11,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2018-04-11 21:52:11,059 INFO L267 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:11,063 INFO L267 ElimStorePlain]: Start of recursive call 91: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:52:12,731 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 160 treesize of output 128 [2018-04-11 21:52:12,733 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:52:12,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2018-04-11 21:52:12,734 INFO L267 ElimStorePlain]: Start of recursive call 95: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:52:12,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 35 [2018-04-11 21:52:12,749 INFO L267 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:12,759 INFO L267 ElimStorePlain]: Start of recursive call 94: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:52:14,394 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 75 treesize of output 65 [2018-04-11 21:52:14,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 16 [2018-04-11 21:52:14,395 INFO L267 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:14,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-11 21:52:14,403 INFO L267 ElimStorePlain]: Start of recursive call 99: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:14,409 INFO L267 ElimStorePlain]: Start of recursive call 97: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:52:16,016 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:52:16,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 176 treesize of output 165 [2018-04-11 21:52:16,023 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:52:16,024 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:52:16,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 142 [2018-04-11 21:52:16,024 INFO L267 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:16,064 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 118 treesize of output 102 [2018-04-11 21:52:16,065 INFO L267 ElimStorePlain]: Start of recursive call 102: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:52:16,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 118 [2018-04-11 21:52:16,103 INFO L267 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 2 xjuncts. [2018-04-11 21:52:16,152 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 102 treesize of output 85 [2018-04-11 21:52:16,153 INFO L267 ElimStorePlain]: Start of recursive call 104: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:16,201 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:52:16,202 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 107 treesize of output 93 [2018-04-11 21:52:16,202 INFO L267 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:16,207 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 106 treesize of output 107 [2018-04-11 21:52:16,208 INFO L267 ElimStorePlain]: Start of recursive call 106: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 21:52:16,267 INFO L267 ElimStorePlain]: Start of recursive call 100: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-11 21:52:18,124 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 103 treesize of output 87 [2018-04-11 21:52:18,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 24 [2018-04-11 21:52:18,125 INFO L267 ElimStorePlain]: Start of recursive call 108: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:18,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2018-04-11 21:52:18,137 INFO L267 ElimStorePlain]: Start of recursive call 109: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:18,145 INFO L267 ElimStorePlain]: Start of recursive call 107: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:52:18,147 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 81 treesize of output 71 [2018-04-11 21:52:18,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2018-04-11 21:52:18,148 INFO L267 ElimStorePlain]: Start of recursive call 111: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:18,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2018-04-11 21:52:18,159 INFO L267 ElimStorePlain]: Start of recursive call 112: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:18,167 INFO L267 ElimStorePlain]: Start of recursive call 110: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:52:18,168 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:52:18,169 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 65 [2018-04-11 21:52:18,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2018-04-11 21:52:18,170 INFO L267 ElimStorePlain]: Start of recursive call 114: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:18,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2018-04-11 21:52:18,179 INFO L267 ElimStorePlain]: Start of recursive call 115: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:18,184 INFO L267 ElimStorePlain]: Start of recursive call 113: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:52:18,186 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 81 treesize of output 71 [2018-04-11 21:52:18,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 35 treesize of output 16 [2018-04-11 21:52:18,187 INFO L267 ElimStorePlain]: Start of recursive call 117: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:18,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-11 21:52:18,197 INFO L267 ElimStorePlain]: Start of recursive call 118: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:18,205 INFO L267 ElimStorePlain]: Start of recursive call 116: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:52:19,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 162 treesize of output 141 [2018-04-11 21:52:19,869 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 1 case distinctions, treesize of input 128 treesize of output 112 [2018-04-11 21:52:19,869 INFO L267 ElimStorePlain]: Start of recursive call 120: End of recursive call: and 2 xjuncts. [2018-04-11 21:52:19,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 126 [2018-04-11 21:52:19,924 INFO L267 ElimStorePlain]: Start of recursive call 121: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:52:19,980 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:52:19,989 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 2 case distinctions, treesize of input 104 treesize of output 125 [2018-04-11 21:52:19,989 INFO L267 ElimStorePlain]: Start of recursive call 122: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-11 21:52:19,991 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:52:19,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 115 [2018-04-11 21:52:20,000 INFO L267 ElimStorePlain]: Start of recursive call 123: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-04-11 21:52:20,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 104 [2018-04-11 21:52:20,118 INFO L267 ElimStorePlain]: Start of recursive call 124: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:20,220 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:52:20,221 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 104 treesize of output 97 [2018-04-11 21:52:20,221 INFO L267 ElimStorePlain]: Start of recursive call 125: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:20,315 INFO L267 ElimStorePlain]: Start of recursive call 119: 5 dim-1 vars, End of recursive call: 4 dim-0 vars, and 7 xjuncts. [2018-04-11 21:52:22,309 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 161 treesize of output 136 [2018-04-11 21:52:22,311 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 129 treesize of output 113 [2018-04-11 21:52:22,312 INFO L267 ElimStorePlain]: Start of recursive call 127: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:52:22,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 112 [2018-04-11 21:52:22,350 INFO L267 ElimStorePlain]: Start of recursive call 128: End of recursive call: and 2 xjuncts. [2018-04-11 21:52:22,391 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 113 treesize of output 96 [2018-04-11 21:52:22,392 INFO L267 ElimStorePlain]: Start of recursive call 129: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:22,423 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:52:22,431 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 98 treesize of output 108 [2018-04-11 21:52:22,432 INFO L267 ElimStorePlain]: Start of recursive call 130: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 21:52:22,475 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:52:22,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 82 [2018-04-11 21:52:22,475 INFO L267 ElimStorePlain]: Start of recursive call 131: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:22,513 INFO L267 ElimStorePlain]: Start of recursive call 126: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-11 21:52:24,566 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 99 treesize of output 85 [2018-04-11 21:52:24,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 28 [2018-04-11 21:52:24,567 INFO L267 ElimStorePlain]: Start of recursive call 133: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:24,579 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 5 treesize of output 3 [2018-04-11 21:52:24,579 INFO L267 ElimStorePlain]: Start of recursive call 134: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:24,587 INFO L267 ElimStorePlain]: Start of recursive call 132: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:52:24,589 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 81 treesize of output 71 [2018-04-11 21:52:24,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2018-04-11 21:52:24,590 INFO L267 ElimStorePlain]: Start of recursive call 136: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:24,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2018-04-11 21:52:24,603 INFO L267 ElimStorePlain]: Start of recursive call 137: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:24,611 INFO L267 ElimStorePlain]: Start of recursive call 135: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:52:24,612 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 81 treesize of output 71 [2018-04-11 21:52:24,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2018-04-11 21:52:24,614 INFO L267 ElimStorePlain]: Start of recursive call 139: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:24,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2018-04-11 21:52:24,624 INFO L267 ElimStorePlain]: Start of recursive call 140: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:24,632 INFO L267 ElimStorePlain]: Start of recursive call 138: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:52:24,634 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 105 treesize of output 91 [2018-04-11 21:52:24,636 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 9 treesize of output 3 [2018-04-11 21:52:24,636 INFO L267 ElimStorePlain]: Start of recursive call 142: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:24,650 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 23 [2018-04-11 21:52:24,650 INFO L267 ElimStorePlain]: Start of recursive call 143: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:24,661 INFO L267 ElimStorePlain]: Start of recursive call 141: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:52:24,663 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 87 treesize of output 75 [2018-04-11 21:52:24,664 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 9 treesize of output 3 [2018-04-11 21:52:24,664 INFO L267 ElimStorePlain]: Start of recursive call 145: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:24,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 17 [2018-04-11 21:52:24,675 INFO L267 ElimStorePlain]: Start of recursive call 146: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:24,684 INFO L267 ElimStorePlain]: Start of recursive call 144: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:52:24,686 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 93 treesize of output 81 [2018-04-11 21:52:24,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2018-04-11 21:52:24,687 INFO L267 ElimStorePlain]: Start of recursive call 148: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:24,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 17 [2018-04-11 21:52:24,699 INFO L267 ElimStorePlain]: Start of recursive call 149: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:24,709 INFO L267 ElimStorePlain]: Start of recursive call 147: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:52:24,710 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:52:24,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 75 [2018-04-11 21:52:24,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 22 [2018-04-11 21:52:24,713 INFO L267 ElimStorePlain]: Start of recursive call 151: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:24,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-11 21:52:24,723 INFO L267 ElimStorePlain]: Start of recursive call 152: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:24,729 INFO L267 ElimStorePlain]: Start of recursive call 150: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:52:26,742 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 92 treesize of output 78 [2018-04-11 21:52:26,743 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 9 treesize of output 3 [2018-04-11 21:52:26,744 INFO L267 ElimStorePlain]: Start of recursive call 154: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:26,753 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 23 [2018-04-11 21:52:26,753 INFO L267 ElimStorePlain]: Start of recursive call 155: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:26,760 INFO L267 ElimStorePlain]: Start of recursive call 153: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:52:26,762 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 68 treesize of output 58 [2018-04-11 21:52:26,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 16 [2018-04-11 21:52:26,763 INFO L267 ElimStorePlain]: Start of recursive call 157: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:26,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-11 21:52:26,770 INFO L267 ElimStorePlain]: Start of recursive call 158: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:26,775 INFO L267 ElimStorePlain]: Start of recursive call 156: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:52:26,776 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 74 treesize of output 64 [2018-04-11 21:52:26,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 16 [2018-04-11 21:52:26,778 INFO L267 ElimStorePlain]: Start of recursive call 160: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:26,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-11 21:52:26,785 INFO L267 ElimStorePlain]: Start of recursive call 161: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:26,791 INFO L267 ElimStorePlain]: Start of recursive call 159: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:52:28,718 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:52:28,718 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 140 treesize of output 131 [2018-04-11 21:52:28,721 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 89 treesize of output 99 [2018-04-11 21:52:28,721 INFO L267 ElimStorePlain]: Start of recursive call 163: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:28,732 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 87 treesize of output 44 [2018-04-11 21:52:28,732 INFO L267 ElimStorePlain]: Start of recursive call 164: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:28,740 INFO L267 ElimStorePlain]: Start of recursive call 162: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:52:30,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 170 treesize of output 145 [2018-04-11 21:52:30,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 117 [2018-04-11 21:52:30,628 INFO L267 ElimStorePlain]: Start of recursive call 166: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:30,673 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:52:30,673 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:52:30,674 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:52:30,675 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 109 treesize of output 113 [2018-04-11 21:52:30,676 INFO L267 ElimStorePlain]: Start of recursive call 167: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:30,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 81 [2018-04-11 21:52:30,711 INFO L267 ElimStorePlain]: Start of recursive call 168: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:52:30,746 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:52:30,747 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:52:30,749 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:52:30,760 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 132 treesize of output 174 [2018-04-11 21:52:30,761 INFO L267 ElimStorePlain]: Start of recursive call 169: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-11 21:52:30,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 89 [2018-04-11 21:52:30,853 INFO L267 ElimStorePlain]: Start of recursive call 170: End of recursive call: and 2 xjuncts. [2018-04-11 21:52:30,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 138 treesize of output 123 [2018-04-11 21:52:30,859 INFO L267 ElimStorePlain]: Start of recursive call 171: End of recursive call: and 2 xjuncts. [2018-04-11 21:52:30,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 111 [2018-04-11 21:52:30,864 INFO L267 ElimStorePlain]: Start of recursive call 172: End of recursive call: and 2 xjuncts. [2018-04-11 21:52:30,931 INFO L267 ElimStorePlain]: Start of recursive call 165: 5 dim-1 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-04-11 21:52:32,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 60 [2018-04-11 21:52:32,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 41 treesize of output 18 [2018-04-11 21:52:32,965 INFO L267 ElimStorePlain]: Start of recursive call 174: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:32,972 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 21:52:32,972 INFO L267 ElimStorePlain]: Start of recursive call 175: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:32,976 INFO L267 ElimStorePlain]: Start of recursive call 173: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:52:34,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 65 [2018-04-11 21:52:34,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2018-04-11 21:52:34,986 INFO L267 ElimStorePlain]: Start of recursive call 177: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:34,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2018-04-11 21:52:34,995 INFO L267 ElimStorePlain]: Start of recursive call 178: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:35,002 INFO L267 ElimStorePlain]: Start of recursive call 176: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:52:35,004 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 97 treesize of output 83 [2018-04-11 21:52:35,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 26 [2018-04-11 21:52:35,005 INFO L267 ElimStorePlain]: Start of recursive call 180: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:35,018 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 5 treesize of output 3 [2018-04-11 21:52:35,018 INFO L267 ElimStorePlain]: Start of recursive call 181: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:35,035 INFO L267 ElimStorePlain]: Start of recursive call 179: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:52:35,037 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 81 treesize of output 71 [2018-04-11 21:52:35,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2018-04-11 21:52:35,039 INFO L267 ElimStorePlain]: Start of recursive call 183: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:35,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2018-04-11 21:52:35,049 INFO L267 ElimStorePlain]: Start of recursive call 184: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:35,056 INFO L267 ElimStorePlain]: Start of recursive call 182: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:52:35,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 93 [2018-04-11 21:52:35,059 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 9 treesize of output 3 [2018-04-11 21:52:35,059 INFO L267 ElimStorePlain]: Start of recursive call 186: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:35,072 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 54 treesize of output 27 [2018-04-11 21:52:35,072 INFO L267 ElimStorePlain]: Start of recursive call 187: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:35,082 INFO L267 ElimStorePlain]: Start of recursive call 185: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:52:37,049 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:52:37,050 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 124 [2018-04-11 21:52:37,051 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 21:52:37,051 INFO L267 ElimStorePlain]: Start of recursive call 189: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:37,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 44 [2018-04-11 21:52:37,063 INFO L267 ElimStorePlain]: Start of recursive call 190: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:37,070 INFO L267 ElimStorePlain]: Start of recursive call 188: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:52:38,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 139 [2018-04-11 21:52:38,999 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:52:39,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 126 treesize of output 144 [2018-04-11 21:52:39,008 INFO L267 ElimStorePlain]: Start of recursive call 192: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 21:52:39,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 113 [2018-04-11 21:52:39,073 INFO L267 ElimStorePlain]: Start of recursive call 193: End of recursive call: and 2 xjuncts. [2018-04-11 21:52:39,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 104 treesize of output 89 [2018-04-11 21:52:39,078 INFO L267 ElimStorePlain]: Start of recursive call 194: End of recursive call: and 2 xjuncts. [2018-04-11 21:52:39,144 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:52:39,144 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 132 treesize of output 126 [2018-04-11 21:52:39,145 INFO L267 ElimStorePlain]: Start of recursive call 195: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:39,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 110 [2018-04-11 21:52:39,192 INFO L267 ElimStorePlain]: Start of recursive call 196: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:52:39,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 89 [2018-04-11 21:52:39,235 INFO L267 ElimStorePlain]: Start of recursive call 197: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:39,274 INFO L267 ElimStorePlain]: Start of recursive call 191: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-11 21:52:41,324 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 99 treesize of output 85 [2018-04-11 21:52:41,325 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 55 treesize of output 28 [2018-04-11 21:52:41,325 INFO L267 ElimStorePlain]: Start of recursive call 199: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:41,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-11 21:52:41,338 INFO L267 ElimStorePlain]: Start of recursive call 200: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:41,346 INFO L267 ElimStorePlain]: Start of recursive call 198: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:52:41,347 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 81 treesize of output 71 [2018-04-11 21:52:41,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2018-04-11 21:52:41,350 INFO L267 ElimStorePlain]: Start of recursive call 202: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:41,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2018-04-11 21:52:41,361 INFO L267 ElimStorePlain]: Start of recursive call 203: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:41,368 INFO L267 ElimStorePlain]: Start of recursive call 201: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:52:41,370 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 75 treesize of output 65 [2018-04-11 21:52:41,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 16 [2018-04-11 21:52:41,371 INFO L267 ElimStorePlain]: Start of recursive call 205: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:41,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-11 21:52:41,379 INFO L267 ElimStorePlain]: Start of recursive call 206: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:41,385 INFO L267 ElimStorePlain]: Start of recursive call 204: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:52:43,356 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 163 treesize of output 125 [2018-04-11 21:52:43,358 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:52:43,359 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 41 treesize of output 28 [2018-04-11 21:52:43,360 INFO L267 ElimStorePlain]: Start of recursive call 208: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:52:43,372 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 57 treesize of output 31 [2018-04-11 21:52:43,372 INFO L267 ElimStorePlain]: Start of recursive call 209: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:43,380 INFO L267 ElimStorePlain]: Start of recursive call 207: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:52:45,329 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:52:45,330 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 79 treesize of output 71 [2018-04-11 21:52:45,366 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 21:52:45,367 INFO L267 ElimStorePlain]: Start of recursive call 211: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:45,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2018-04-11 21:52:45,375 INFO L267 ElimStorePlain]: Start of recursive call 212: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:45,381 INFO L267 ElimStorePlain]: Start of recursive call 210: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:52:47,317 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 171 treesize of output 152 [2018-04-11 21:52:47,319 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:52:47,320 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:52:47,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 127 [2018-04-11 21:52:47,321 INFO L267 ElimStorePlain]: Start of recursive call 214: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:47,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 127 treesize of output 102 [2018-04-11 21:52:47,352 INFO L267 ElimStorePlain]: Start of recursive call 215: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:47,384 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 102 treesize of output 78 [2018-04-11 21:52:47,384 INFO L267 ElimStorePlain]: Start of recursive call 216: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:52:47,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 127 [2018-04-11 21:52:47,417 INFO L267 ElimStorePlain]: Start of recursive call 217: End of recursive call: and 2 xjuncts. [2018-04-11 21:52:47,460 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:52:47,460 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 116 treesize of output 86 [2018-04-11 21:52:47,460 INFO L267 ElimStorePlain]: Start of recursive call 218: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:47,462 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 115 treesize of output 77 [2018-04-11 21:52:47,462 INFO L267 ElimStorePlain]: Start of recursive call 219: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:52:47,506 INFO L267 ElimStorePlain]: Start of recursive call 213: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-11 21:52:49,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 162 treesize of output 141 [2018-04-11 21:52:49,542 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 1 case distinctions, treesize of input 128 treesize of output 112 [2018-04-11 21:52:49,543 INFO L267 ElimStorePlain]: Start of recursive call 221: End of recursive call: and 2 xjuncts. [2018-04-11 21:52:49,607 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:52:49,614 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 101 treesize of output 115 [2018-04-11 21:52:49,615 INFO L267 ElimStorePlain]: Start of recursive call 222: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-04-11 21:52:49,617 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:52:49,626 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 2 case distinctions, treesize of input 104 treesize of output 125 [2018-04-11 21:52:49,627 INFO L267 ElimStorePlain]: Start of recursive call 223: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-11 21:52:49,753 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:52:49,754 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 134 treesize of output 126 [2018-04-11 21:52:49,755 INFO L267 ElimStorePlain]: Start of recursive call 224: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:49,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 97 [2018-04-11 21:52:49,865 INFO L267 ElimStorePlain]: Start of recursive call 225: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:49,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 81 [2018-04-11 21:52:49,968 INFO L267 ElimStorePlain]: Start of recursive call 226: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:52:50,067 INFO L267 ElimStorePlain]: Start of recursive call 220: 5 dim-1 vars, End of recursive call: 4 dim-0 vars, and 7 xjuncts. [2018-04-11 21:52:52,348 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 163 treesize of output 125 [2018-04-11 21:52:52,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 74 [2018-04-11 21:52:52,351 INFO L267 ElimStorePlain]: Start of recursive call 228: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:52,362 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:52:52,363 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 99 treesize of output 58 [2018-04-11 21:52:52,363 INFO L267 ElimStorePlain]: Start of recursive call 229: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:52:52,372 INFO L267 ElimStorePlain]: Start of recursive call 227: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:52:54,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 58 [2018-04-11 21:52:54,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2018-04-11 21:52:54,672 INFO L267 ElimStorePlain]: Start of recursive call 231: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:54,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2018-04-11 21:52:54,679 INFO L267 ElimStorePlain]: Start of recursive call 232: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:54,685 INFO L267 ElimStorePlain]: Start of recursive call 230: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:52:56,892 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 60 [2018-04-11 21:52:56,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2018-04-11 21:52:56,894 INFO L267 ElimStorePlain]: Start of recursive call 234: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:56,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2018-04-11 21:52:56,908 INFO L267 ElimStorePlain]: Start of recursive call 235: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:56,912 INFO L267 ElimStorePlain]: Start of recursive call 233: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:52:59,108 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 74 treesize of output 64 [2018-04-11 21:52:59,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 16 [2018-04-11 21:52:59,110 INFO L267 ElimStorePlain]: Start of recursive call 237: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:59,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-11 21:52:59,120 INFO L267 ElimStorePlain]: Start of recursive call 238: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:59,127 INFO L267 ElimStorePlain]: Start of recursive call 236: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:52:59,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 54 [2018-04-11 21:52:59,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 16 [2018-04-11 21:52:59,130 INFO L267 ElimStorePlain]: Start of recursive call 240: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:59,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-11 21:52:59,136 INFO L267 ElimStorePlain]: Start of recursive call 241: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:59,141 INFO L267 ElimStorePlain]: Start of recursive call 239: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:52:59,142 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 74 treesize of output 64 [2018-04-11 21:52:59,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2018-04-11 21:52:59,144 INFO L267 ElimStorePlain]: Start of recursive call 243: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:59,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2018-04-11 21:52:59,159 INFO L267 ElimStorePlain]: Start of recursive call 244: End of recursive call: and 1 xjuncts. [2018-04-11 21:52:59,166 INFO L267 ElimStorePlain]: Start of recursive call 242: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:53:01,295 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 145 treesize of output 119 [2018-04-11 21:53:01,296 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:53:01,297 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 27 treesize of output 24 [2018-04-11 21:53:01,297 INFO L267 ElimStorePlain]: Start of recursive call 246: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:53:01,310 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 35 [2018-04-11 21:53:01,310 INFO L267 ElimStorePlain]: Start of recursive call 247: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:01,320 INFO L267 ElimStorePlain]: Start of recursive call 245: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:53:03,785 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:53:03,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 180 treesize of output 167 [2018-04-11 21:53:03,828 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:53:03,829 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:53:03,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 138 [2018-04-11 21:53:03,830 INFO L267 ElimStorePlain]: Start of recursive call 249: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:03,871 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 126 treesize of output 113 [2018-04-11 21:53:03,871 INFO L267 ElimStorePlain]: Start of recursive call 250: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:03,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 85 [2018-04-11 21:53:03,913 INFO L267 ElimStorePlain]: Start of recursive call 251: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:53:03,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 142 treesize of output 126 [2018-04-11 21:53:03,951 INFO L267 ElimStorePlain]: Start of recursive call 252: End of recursive call: and 2 xjuncts. [2018-04-11 21:53:03,999 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:53:04,000 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 115 treesize of output 93 [2018-04-11 21:53:04,000 INFO L267 ElimStorePlain]: Start of recursive call 253: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:04,002 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 114 treesize of output 84 [2018-04-11 21:53:04,002 INFO L267 ElimStorePlain]: Start of recursive call 254: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:53:04,043 INFO L267 ElimStorePlain]: Start of recursive call 248: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-11 21:53:06,289 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 75 treesize of output 65 [2018-04-11 21:53:06,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 16 [2018-04-11 21:53:06,290 INFO L267 ElimStorePlain]: Start of recursive call 256: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:06,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-11 21:53:06,299 INFO L267 ElimStorePlain]: Start of recursive call 257: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:06,306 INFO L267 ElimStorePlain]: Start of recursive call 255: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:53:08,489 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:53:08,490 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 65 [2018-04-11 21:53:08,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 16 [2018-04-11 21:53:08,491 INFO L267 ElimStorePlain]: Start of recursive call 259: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:08,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-11 21:53:08,500 INFO L267 ElimStorePlain]: Start of recursive call 260: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:08,515 INFO L267 ElimStorePlain]: Start of recursive call 258: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:53:08,517 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 81 treesize of output 71 [2018-04-11 21:53:08,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2018-04-11 21:53:08,518 INFO L267 ElimStorePlain]: Start of recursive call 262: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:08,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2018-04-11 21:53:08,528 INFO L267 ElimStorePlain]: Start of recursive call 263: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:08,535 INFO L267 ElimStorePlain]: Start of recursive call 261: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:53:08,536 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 81 treesize of output 71 [2018-04-11 21:53:08,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2018-04-11 21:53:08,538 INFO L267 ElimStorePlain]: Start of recursive call 265: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:08,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2018-04-11 21:53:08,547 INFO L267 ElimStorePlain]: Start of recursive call 266: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:08,554 INFO L267 ElimStorePlain]: Start of recursive call 264: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:53:10,659 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 68 treesize of output 58 [2018-04-11 21:53:10,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2018-04-11 21:53:10,661 INFO L267 ElimStorePlain]: Start of recursive call 268: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:10,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2018-04-11 21:53:10,668 INFO L267 ElimStorePlain]: Start of recursive call 269: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:10,674 INFO L267 ElimStorePlain]: Start of recursive call 267: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:53:12,771 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 165 treesize of output 138 [2018-04-11 21:53:12,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 113 [2018-04-11 21:53:12,777 INFO L267 ElimStorePlain]: Start of recursive call 271: End of recursive call: and 2 xjuncts. [2018-04-11 21:53:12,829 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:53:12,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 108 [2018-04-11 21:53:12,837 INFO L267 ElimStorePlain]: Start of recursive call 272: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-04-11 21:53:12,839 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:53:12,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 105 treesize of output 118 [2018-04-11 21:53:12,848 INFO L267 ElimStorePlain]: Start of recursive call 273: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-11 21:53:12,962 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:53:12,963 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 131 treesize of output 123 [2018-04-11 21:53:12,964 INFO L267 ElimStorePlain]: Start of recursive call 274: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:13,058 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 115 treesize of output 98 [2018-04-11 21:53:13,059 INFO L267 ElimStorePlain]: Start of recursive call 275: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:13,153 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 90 treesize of output 74 [2018-04-11 21:53:13,153 INFO L267 ElimStorePlain]: Start of recursive call 276: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:53:13,240 INFO L267 ElimStorePlain]: Start of recursive call 270: 5 dim-1 vars, End of recursive call: 4 dim-0 vars, and 7 xjuncts. [2018-04-11 21:53:15,583 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 150 treesize of output 131 [2018-04-11 21:53:15,586 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 35 [2018-04-11 21:53:15,586 INFO L267 ElimStorePlain]: Start of recursive call 278: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:15,598 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:53:15,599 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 27 treesize of output 24 [2018-04-11 21:53:15,599 INFO L267 ElimStorePlain]: Start of recursive call 279: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:53:15,609 INFO L267 ElimStorePlain]: Start of recursive call 277: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:53:17,951 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 160 treesize of output 128 [2018-04-11 21:53:17,953 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:53:17,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2018-04-11 21:53:17,954 INFO L267 ElimStorePlain]: Start of recursive call 281: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:53:17,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 35 [2018-04-11 21:53:17,969 INFO L267 ElimStorePlain]: Start of recursive call 282: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:17,979 INFO L267 ElimStorePlain]: Start of recursive call 280: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:53:20,301 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 75 treesize of output 65 [2018-04-11 21:53:20,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2018-04-11 21:53:20,302 INFO L267 ElimStorePlain]: Start of recursive call 284: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:20,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2018-04-11 21:53:20,311 INFO L267 ElimStorePlain]: Start of recursive call 285: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:20,318 INFO L267 ElimStorePlain]: Start of recursive call 283: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:53:22,593 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 75 treesize of output 65 [2018-04-11 21:53:22,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 16 [2018-04-11 21:53:22,594 INFO L267 ElimStorePlain]: Start of recursive call 287: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:22,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-11 21:53:22,603 INFO L267 ElimStorePlain]: Start of recursive call 288: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:22,610 INFO L267 ElimStorePlain]: Start of recursive call 286: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:53:24,866 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 167 treesize of output 150 [2018-04-11 21:53:24,873 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 131 treesize of output 123 [2018-04-11 21:53:24,873 INFO L267 ElimStorePlain]: Start of recursive call 290: End of recursive call: and 2 xjuncts. [2018-04-11 21:53:24,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 100 [2018-04-11 21:53:24,933 INFO L267 ElimStorePlain]: Start of recursive call 291: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 21:53:24,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 1 case distinctions, treesize of input 96 treesize of output 78 [2018-04-11 21:53:24,938 INFO L267 ElimStorePlain]: Start of recursive call 292: End of recursive call: and 2 xjuncts. [2018-04-11 21:53:25,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 118 [2018-04-11 21:53:25,010 INFO L267 ElimStorePlain]: Start of recursive call 293: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:25,076 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 118 treesize of output 97 [2018-04-11 21:53:25,076 INFO L267 ElimStorePlain]: Start of recursive call 294: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:25,141 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 97 treesize of output 78 [2018-04-11 21:53:25,141 INFO L267 ElimStorePlain]: Start of recursive call 295: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:53:25,202 INFO L267 ElimStorePlain]: Start of recursive call 289: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-04-11 21:53:27,627 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 96 treesize of output 80 [2018-04-11 21:53:27,628 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 51 treesize of output 24 [2018-04-11 21:53:27,628 INFO L267 ElimStorePlain]: Start of recursive call 297: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:27,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2018-04-11 21:53:27,639 INFO L267 ElimStorePlain]: Start of recursive call 298: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:27,645 INFO L267 ElimStorePlain]: Start of recursive call 296: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:53:27,647 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 86 treesize of output 70 [2018-04-11 21:53:27,648 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 51 treesize of output 24 [2018-04-11 21:53:27,648 INFO L267 ElimStorePlain]: Start of recursive call 300: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:27,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2018-04-11 21:53:27,656 INFO L267 ElimStorePlain]: Start of recursive call 301: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:27,661 INFO L267 ElimStorePlain]: Start of recursive call 299: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:53:27,663 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 74 treesize of output 64 [2018-04-11 21:53:27,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2018-04-11 21:53:27,664 INFO L267 ElimStorePlain]: Start of recursive call 303: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:27,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2018-04-11 21:53:27,673 INFO L267 ElimStorePlain]: Start of recursive call 304: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:27,680 INFO L267 ElimStorePlain]: Start of recursive call 302: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:53:27,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 68 [2018-04-11 21:53:27,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 16 [2018-04-11 21:53:27,683 INFO L267 ElimStorePlain]: Start of recursive call 306: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:27,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-11 21:53:27,693 INFO L267 ElimStorePlain]: Start of recursive call 307: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:27,701 INFO L267 ElimStorePlain]: Start of recursive call 305: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:53:27,703 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 67 treesize of output 61 [2018-04-11 21:53:27,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2018-04-11 21:53:27,705 INFO L267 ElimStorePlain]: Start of recursive call 309: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:27,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2018-04-11 21:53:27,716 INFO L267 ElimStorePlain]: Start of recursive call 310: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:27,722 INFO L267 ElimStorePlain]: Start of recursive call 308: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:53:29,993 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 92 treesize of output 78 [2018-04-11 21:53:29,995 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 55 treesize of output 28 [2018-04-11 21:53:29,995 INFO L267 ElimStorePlain]: Start of recursive call 312: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:30,004 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 5 treesize of output 3 [2018-04-11 21:53:30,004 INFO L267 ElimStorePlain]: Start of recursive call 313: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:30,012 INFO L267 ElimStorePlain]: Start of recursive call 311: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:53:30,014 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 74 treesize of output 64 [2018-04-11 21:53:30,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2018-04-11 21:53:30,015 INFO L267 ElimStorePlain]: Start of recursive call 315: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:30,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2018-04-11 21:53:30,024 INFO L267 ElimStorePlain]: Start of recursive call 316: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:30,030 INFO L267 ElimStorePlain]: Start of recursive call 314: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:53:30,032 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 74 treesize of output 64 [2018-04-11 21:53:30,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 16 [2018-04-11 21:53:30,033 INFO L267 ElimStorePlain]: Start of recursive call 318: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:30,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-11 21:53:30,041 INFO L267 ElimStorePlain]: Start of recursive call 319: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:30,048 INFO L267 ElimStorePlain]: Start of recursive call 317: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:53:30,050 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 86 treesize of output 74 [2018-04-11 21:53:30,051 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 9 treesize of output 3 [2018-04-11 21:53:30,051 INFO L267 ElimStorePlain]: Start of recursive call 321: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:30,061 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 36 treesize of output 17 [2018-04-11 21:53:30,062 INFO L267 ElimStorePlain]: Start of recursive call 322: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:30,069 INFO L267 ElimStorePlain]: Start of recursive call 320: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:53:30,071 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 76 treesize of output 64 [2018-04-11 21:53:30,072 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 9 treesize of output 3 [2018-04-11 21:53:30,072 INFO L267 ElimStorePlain]: Start of recursive call 324: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:30,080 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 36 treesize of output 17 [2018-04-11 21:53:30,080 INFO L267 ElimStorePlain]: Start of recursive call 325: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:30,086 INFO L267 ElimStorePlain]: Start of recursive call 323: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:53:30,087 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 98 treesize of output 84 [2018-04-11 21:53:30,089 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 55 treesize of output 28 [2018-04-11 21:53:30,089 INFO L267 ElimStorePlain]: Start of recursive call 327: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:30,099 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 5 treesize of output 3 [2018-04-11 21:53:30,100 INFO L267 ElimStorePlain]: Start of recursive call 328: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:30,108 INFO L267 ElimStorePlain]: Start of recursive call 326: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:53:30,110 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 80 treesize of output 68 [2018-04-11 21:53:30,111 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 22 [2018-04-11 21:53:30,111 INFO L267 ElimStorePlain]: Start of recursive call 330: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:30,119 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 5 treesize of output 3 [2018-04-11 21:53:30,120 INFO L267 ElimStorePlain]: Start of recursive call 331: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:30,126 INFO L267 ElimStorePlain]: Start of recursive call 329: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:53:32,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, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 119 [2018-04-11 21:53:32,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 35 [2018-04-11 21:53:32,307 INFO L267 ElimStorePlain]: Start of recursive call 333: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:32,329 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:53:32,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 24 [2018-04-11 21:53:32,330 INFO L267 ElimStorePlain]: Start of recursive call 334: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:53:32,342 INFO L267 ElimStorePlain]: Start of recursive call 332: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:53:34,514 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:53:34,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 176 treesize of output 165 [2018-04-11 21:53:34,521 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:53:34,522 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:53:34,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 130 [2018-04-11 21:53:34,522 INFO L267 ElimStorePlain]: Start of recursive call 336: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:34,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 102 [2018-04-11 21:53:34,560 INFO L267 ElimStorePlain]: Start of recursive call 337: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:53:34,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 118 [2018-04-11 21:53:34,615 INFO L267 ElimStorePlain]: Start of recursive call 338: End of recursive call: and 2 xjuncts. [2018-04-11 21:53:34,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 85 [2018-04-11 21:53:34,668 INFO L267 ElimStorePlain]: Start of recursive call 339: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:34,721 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 107 treesize of output 97 [2018-04-11 21:53:34,722 INFO L267 ElimStorePlain]: Start of recursive call 340: End of recursive call: and 2 xjuncts. [2018-04-11 21:53:34,727 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 106 treesize of output 107 [2018-04-11 21:53:34,727 INFO L267 ElimStorePlain]: Start of recursive call 341: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 21:53:34,798 INFO L267 ElimStorePlain]: Start of recursive call 335: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-04-11 21:53:37,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 75 [2018-04-11 21:53:37,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 16 [2018-04-11 21:53:37,182 INFO L267 ElimStorePlain]: Start of recursive call 343: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:37,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-11 21:53:37,193 INFO L267 ElimStorePlain]: Start of recursive call 344: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:37,201 INFO L267 ElimStorePlain]: Start of recursive call 342: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:53:37,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 71 [2018-04-11 21:53:37,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2018-04-11 21:53:37,204 INFO L267 ElimStorePlain]: Start of recursive call 346: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:37,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2018-04-11 21:53:37,214 INFO L267 ElimStorePlain]: Start of recursive call 347: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:37,222 INFO L267 ElimStorePlain]: Start of recursive call 345: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:53:37,224 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:53:37,224 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 74 treesize of output 68 [2018-04-11 21:53:37,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 16 [2018-04-11 21:53:37,226 INFO L267 ElimStorePlain]: Start of recursive call 349: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:37,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-11 21:53:37,235 INFO L267 ElimStorePlain]: Start of recursive call 350: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:37,242 INFO L267 ElimStorePlain]: Start of recursive call 348: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:53:37,243 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:53:37,244 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 93 treesize of output 81 [2018-04-11 21:53:37,245 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 51 treesize of output 24 [2018-04-11 21:53:37,245 INFO L267 ElimStorePlain]: Start of recursive call 352: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:37,255 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 14 treesize of output 10 [2018-04-11 21:53:37,255 INFO L267 ElimStorePlain]: Start of recursive call 353: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:37,260 INFO L267 ElimStorePlain]: Start of recursive call 351: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:53:37,262 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 103 treesize of output 87 [2018-04-11 21:53:37,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2018-04-11 21:53:37,264 INFO L267 ElimStorePlain]: Start of recursive call 355: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:37,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2018-04-11 21:53:37,274 INFO L267 ElimStorePlain]: Start of recursive call 356: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:37,282 INFO L267 ElimStorePlain]: Start of recursive call 354: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:53:39,498 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:53:39,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, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 75 [2018-04-11 21:53:39,501 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 22 [2018-04-11 21:53:39,501 INFO L267 ElimStorePlain]: Start of recursive call 358: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:39,515 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 5 treesize of output 3 [2018-04-11 21:53:39,515 INFO L267 ElimStorePlain]: Start of recursive call 359: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:39,522 INFO L267 ElimStorePlain]: Start of recursive call 357: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:53:39,524 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 87 treesize of output 75 [2018-04-11 21:53:39,525 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 9 treesize of output 3 [2018-04-11 21:53:39,525 INFO L267 ElimStorePlain]: Start of recursive call 361: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:39,535 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 36 treesize of output 17 [2018-04-11 21:53:39,535 INFO L267 ElimStorePlain]: Start of recursive call 362: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:39,542 INFO L267 ElimStorePlain]: Start of recursive call 360: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:53:39,544 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 99 treesize of output 85 [2018-04-11 21:53:39,545 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 9 treesize of output 3 [2018-04-11 21:53:39,546 INFO L267 ElimStorePlain]: Start of recursive call 364: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:39,559 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 23 [2018-04-11 21:53:39,560 INFO L267 ElimStorePlain]: Start of recursive call 365: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:39,568 INFO L267 ElimStorePlain]: Start of recursive call 363: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:53:39,570 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 105 treesize of output 91 [2018-04-11 21:53:39,571 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 9 treesize of output 3 [2018-04-11 21:53:39,571 INFO L267 ElimStorePlain]: Start of recursive call 367: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:39,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 23 [2018-04-11 21:53:39,585 INFO L267 ElimStorePlain]: Start of recursive call 368: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:39,595 INFO L267 ElimStorePlain]: Start of recursive call 366: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:53:39,597 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 81 treesize of output 71 [2018-04-11 21:53:39,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2018-04-11 21:53:39,598 INFO L267 ElimStorePlain]: Start of recursive call 370: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:39,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2018-04-11 21:53:39,610 INFO L267 ElimStorePlain]: Start of recursive call 371: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:39,618 INFO L267 ElimStorePlain]: Start of recursive call 369: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:53:39,620 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 93 treesize of output 81 [2018-04-11 21:53:39,621 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 22 [2018-04-11 21:53:39,621 INFO L267 ElimStorePlain]: Start of recursive call 373: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:39,632 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 5 treesize of output 3 [2018-04-11 21:53:39,633 INFO L267 ElimStorePlain]: Start of recursive call 374: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:39,642 INFO L267 ElimStorePlain]: Start of recursive call 372: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:53:39,643 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 81 treesize of output 71 [2018-04-11 21:53:39,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2018-04-11 21:53:39,645 INFO L267 ElimStorePlain]: Start of recursive call 376: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:39,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2018-04-11 21:53:39,655 INFO L267 ElimStorePlain]: Start of recursive call 377: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:39,663 INFO L267 ElimStorePlain]: Start of recursive call 375: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:53:41,764 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 75 treesize of output 65 [2018-04-11 21:53:41,766 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 16 [2018-04-11 21:53:41,766 INFO L267 ElimStorePlain]: Start of recursive call 379: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:41,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-11 21:53:41,774 INFO L267 ElimStorePlain]: Start of recursive call 380: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:41,781 INFO L267 ElimStorePlain]: Start of recursive call 378: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:53:43,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 60 [2018-04-11 21:53:43,851 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 12 [2018-04-11 21:53:43,851 INFO L267 ElimStorePlain]: Start of recursive call 382: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:43,863 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:53:43,864 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 21 treesize of output 16 [2018-04-11 21:53:43,864 INFO L267 ElimStorePlain]: Start of recursive call 383: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:53:43,870 INFO L267 ElimStorePlain]: Start of recursive call 381: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:53:45,906 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 167 treesize of output 150 [2018-04-11 21:53:45,908 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 143 treesize of output 118 [2018-04-11 21:53:45,908 INFO L267 ElimStorePlain]: Start of recursive call 385: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:45,939 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 118 treesize of output 97 [2018-04-11 21:53:45,940 INFO L267 ElimStorePlain]: Start of recursive call 386: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:45,973 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 131 treesize of output 123 [2018-04-11 21:53:45,974 INFO L267 ElimStorePlain]: Start of recursive call 387: End of recursive call: and 2 xjuncts. [2018-04-11 21:53:46,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 100 [2018-04-11 21:53:46,018 INFO L267 ElimStorePlain]: Start of recursive call 388: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 21:53:46,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 78 [2018-04-11 21:53:46,023 INFO L267 ElimStorePlain]: Start of recursive call 389: End of recursive call: and 2 xjuncts. [2018-04-11 21:53:46,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 78 [2018-04-11 21:53:46,079 INFO L267 ElimStorePlain]: Start of recursive call 390: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 21:53:46,124 INFO L267 ElimStorePlain]: Start of recursive call 384: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-11 21:53:48,258 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 165 treesize of output 138 [2018-04-11 21:53:48,262 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:53:48,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, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 125 treesize of output 135 [2018-04-11 21:53:48,270 INFO L267 ElimStorePlain]: Start of recursive call 392: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-04-11 21:53:48,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 106 [2018-04-11 21:53:48,354 INFO L267 ElimStorePlain]: Start of recursive call 393: End of recursive call: and 2 xjuncts. [2018-04-11 21:53:48,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 90 [2018-04-11 21:53:48,359 INFO L267 ElimStorePlain]: Start of recursive call 394: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 21:53:48,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 94 [2018-04-11 21:53:48,365 INFO L267 ElimStorePlain]: Start of recursive call 395: End of recursive call: and 2 xjuncts. [2018-04-11 21:53:48,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 113 [2018-04-11 21:53:48,441 INFO L267 ElimStorePlain]: Start of recursive call 396: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:48,507 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:53:48,508 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 113 treesize of output 106 [2018-04-11 21:53:48,508 INFO L267 ElimStorePlain]: Start of recursive call 397: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:48,588 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 90 treesize of output 74 [2018-04-11 21:53:48,588 INFO L267 ElimStorePlain]: Start of recursive call 398: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:53:48,653 INFO L267 ElimStorePlain]: Start of recursive call 391: 5 dim-1 vars, End of recursive call: 3 dim-0 vars, and 5 xjuncts. [2018-04-11 21:53:50,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 54 [2018-04-11 21:53:50,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 16 [2018-04-11 21:53:50,992 INFO L267 ElimStorePlain]: Start of recursive call 400: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:50,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-11 21:53:50,998 INFO L267 ElimStorePlain]: Start of recursive call 401: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:51,003 INFO L267 ElimStorePlain]: Start of recursive call 399: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:53:51,004 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 74 treesize of output 64 [2018-04-11 21:53:51,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2018-04-11 21:53:51,006 INFO L267 ElimStorePlain]: Start of recursive call 403: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:51,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2018-04-11 21:53:51,015 INFO L267 ElimStorePlain]: Start of recursive call 404: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:51,021 INFO L267 ElimStorePlain]: Start of recursive call 402: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:53:51,023 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 96 treesize of output 80 [2018-04-11 21:53:51,024 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 26 treesize of output 14 [2018-04-11 21:53:51,024 INFO L267 ElimStorePlain]: Start of recursive call 406: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:51,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2018-04-11 21:53:51,033 INFO L267 ElimStorePlain]: Start of recursive call 407: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:51,040 INFO L267 ElimStorePlain]: Start of recursive call 405: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:53:51,041 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 74 treesize of output 64 [2018-04-11 21:53:51,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 16 [2018-04-11 21:53:51,042 INFO L267 ElimStorePlain]: Start of recursive call 409: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:51,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-11 21:53:51,051 INFO L267 ElimStorePlain]: Start of recursive call 410: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:51,058 INFO L267 ElimStorePlain]: Start of recursive call 408: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:53:53,342 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 76 treesize of output 64 [2018-04-11 21:53:53,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2018-04-11 21:53:53,344 INFO L267 ElimStorePlain]: Start of recursive call 412: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:53,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 17 [2018-04-11 21:53:53,351 INFO L267 ElimStorePlain]: Start of recursive call 413: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:53,357 INFO L267 ElimStorePlain]: Start of recursive call 411: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:53:53,359 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 86 treesize of output 74 [2018-04-11 21:53:53,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2018-04-11 21:53:53,360 INFO L267 ElimStorePlain]: Start of recursive call 415: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:53,371 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 36 treesize of output 17 [2018-04-11 21:53:53,371 INFO L267 ElimStorePlain]: Start of recursive call 416: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:53,379 INFO L267 ElimStorePlain]: Start of recursive call 414: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:53:53,381 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 74 treesize of output 64 [2018-04-11 21:53:53,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 35 treesize of output 16 [2018-04-11 21:53:53,382 INFO L267 ElimStorePlain]: Start of recursive call 418: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:53,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-11 21:53:53,391 INFO L267 ElimStorePlain]: Start of recursive call 419: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:53,398 INFO L267 ElimStorePlain]: Start of recursive call 417: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:53:53,399 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 80 treesize of output 68 [2018-04-11 21:53:53,400 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 9 treesize of output 3 [2018-04-11 21:53:53,400 INFO L267 ElimStorePlain]: Start of recursive call 421: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:53,410 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 36 treesize of output 17 [2018-04-11 21:53:53,410 INFO L267 ElimStorePlain]: Start of recursive call 422: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:53,417 INFO L267 ElimStorePlain]: Start of recursive call 420: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:53:53,419 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 92 treesize of output 78 [2018-04-11 21:53:53,420 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 9 treesize of output 3 [2018-04-11 21:53:53,420 INFO L267 ElimStorePlain]: Start of recursive call 424: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:53,430 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 23 [2018-04-11 21:53:53,430 INFO L267 ElimStorePlain]: Start of recursive call 425: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:53,438 INFO L267 ElimStorePlain]: Start of recursive call 423: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:53:55,584 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:53:55,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 98 [2018-04-11 21:53:55,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 71 [2018-04-11 21:53:55,596 INFO L267 ElimStorePlain]: Start of recursive call 427: End of recursive call: and 2 xjuncts. [2018-04-11 21:53:55,651 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 54 treesize of output 50 [2018-04-11 21:53:55,652 INFO L267 ElimStorePlain]: Start of recursive call 428: End of recursive call: and 2 xjuncts. [2018-04-11 21:53:55,657 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 59 treesize of output 60 [2018-04-11 21:53:55,657 INFO L267 ElimStorePlain]: Start of recursive call 429: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 21:53:55,728 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 85 treesize of output 78 [2018-04-11 21:53:55,728 INFO L267 ElimStorePlain]: Start of recursive call 430: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:55,792 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 78 treesize of output 71 [2018-04-11 21:53:55,792 INFO L267 ElimStorePlain]: Start of recursive call 431: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:55,845 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 71 treesize of output 54 [2018-04-11 21:53:55,845 INFO L267 ElimStorePlain]: Start of recursive call 432: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:53:55,899 INFO L267 ElimStorePlain]: Start of recursive call 426: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-04-11 21:53:58,173 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 148 treesize of output 116 [2018-04-11 21:53:58,175 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 31 [2018-04-11 21:53:58,175 INFO L267 ElimStorePlain]: Start of recursive call 434: End of recursive call: and 1 xjuncts. [2018-04-11 21:53:58,186 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:53:58,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 28 [2018-04-11 21:53:58,187 INFO L267 ElimStorePlain]: Start of recursive call 435: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:53:58,196 INFO L267 ElimStorePlain]: Start of recursive call 433: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:54:00,449 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 68 treesize of output 58 [2018-04-11 21:54:00,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 16 [2018-04-11 21:54:00,450 INFO L267 ElimStorePlain]: Start of recursive call 437: End of recursive call: and 1 xjuncts. [2018-04-11 21:54:00,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-11 21:54:00,457 INFO L267 ElimStorePlain]: Start of recursive call 438: End of recursive call: and 1 xjuncts. [2018-04-11 21:54:00,462 INFO L267 ElimStorePlain]: Start of recursive call 436: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:54:02,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 116 dim-0 vars, 64 dim-2 vars, End of recursive call: 188 dim-0 vars, and 88 xjuncts. [2018-04-11 21:54:02,864 INFO L202 ElimStorePlain]: Needed 438 recursive calls to eliminate 180 variables, input treesize:5185, output treesize:2709 [2018-04-11 21:54:03,763 WARN L151 SmtUtils]: Spent 498ms on a formula simplification. DAG size of input: 1268 DAG size of output 39 [2018-04-11 21:54:03,828 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:54:03,846 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 21:54:03,846 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24] total 46 [2018-04-11 21:54:03,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-04-11 21:54:03,846 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-04-11 21:54:03,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1981, Unknown=0, NotChecked=0, Total=2162 [2018-04-11 21:54:03,846 INFO L87 Difference]: Start difference. First operand 546 states and 686 transitions. Second operand 47 states. [2018-04-11 21:54:07,021 WARN L151 SmtUtils]: Spent 884ms on a formula simplification. DAG size of input: 119 DAG size of output 103 [2018-04-11 21:54:07,834 WARN L151 SmtUtils]: Spent 752ms on a formula simplification. DAG size of input: 116 DAG size of output 100 [2018-04-11 21:54:09,374 WARN L151 SmtUtils]: Spent 1387ms on a formula simplification. DAG size of input: 125 DAG size of output 108 [2018-04-11 21:54:10,982 WARN L151 SmtUtils]: Spent 1493ms on a formula simplification. DAG size of input: 139 DAG size of output 111 [2018-04-11 21:54:12,699 WARN L151 SmtUtils]: Spent 1553ms on a formula simplification. DAG size of input: 141 DAG size of output 119 [2018-04-11 21:54:14,422 WARN L151 SmtUtils]: Spent 1614ms on a formula simplification. DAG size of input: 146 DAG size of output 124 [2018-04-11 21:54:21,949 WARN L151 SmtUtils]: Spent 7082ms on a formula simplification. DAG size of input: 185 DAG size of output 168 [2018-04-11 21:54:29,228 WARN L151 SmtUtils]: Spent 7099ms on a formula simplification. DAG size of input: 178 DAG size of output 160 [2018-04-11 21:54:35,560 WARN L151 SmtUtils]: Spent 6144ms on a formula simplification. DAG size of input: 188 DAG size of output 168 [2018-04-11 21:54:52,247 WARN L151 SmtUtils]: Spent 15821ms on a formula simplification. DAG size of input: 278 DAG size of output 260 [2018-04-11 21:54:53,055 WARN L151 SmtUtils]: Spent 714ms on a formula simplification. DAG size of input: 105 DAG size of output 92 [2018-04-11 21:55:09,650 WARN L151 SmtUtils]: Spent 16417ms on a formula simplification. DAG size of input: 272 DAG size of output 256 [2018-04-11 21:55:30,377 WARN L151 SmtUtils]: Spent 20119ms on a formula simplification. DAG size of input: 607 DAG size of output 363 [2018-04-11 21:55:31,325 WARN L151 SmtUtils]: Spent 877ms on a formula simplification. DAG size of input: 102 DAG size of output 92 [2018-04-11 21:55:52,544 WARN L151 SmtUtils]: Spent 20439ms on a formula simplification. DAG size of input: 640 DAG size of output 371 [2018-04-11 21:55:53,707 WARN L151 SmtUtils]: Spent 329ms on a formula simplification. DAG size of input: 108 DAG size of output 96 [2018-04-11 21:56:06,439 WARN L151 SmtUtils]: Spent 11796ms on a formula simplification. DAG size of input: 260 DAG size of output 247 [2018-04-11 21:56:21,126 WARN L151 SmtUtils]: Spent 12646ms on a formula simplification. DAG size of input: 258 DAG size of output 247 [2018-04-11 21:56:36,790 WARN L151 SmtUtils]: Spent 11959ms on a formula simplification. DAG size of input: 247 DAG size of output 237 [2018-04-11 21:56:39,363 WARN L151 SmtUtils]: Spent 763ms on a formula simplification. DAG size of input: 139 DAG size of output 123 [2018-04-11 21:56:40,378 WARN L151 SmtUtils]: Spent 758ms on a formula simplification. DAG size of input: 136 DAG size of output 120 [2018-04-11 21:56:44,020 WARN L151 SmtUtils]: Spent 1346ms on a formula simplification. DAG size of input: 137 DAG size of output 121 [2018-04-11 21:56:45,674 WARN L151 SmtUtils]: Spent 1544ms on a formula simplification. DAG size of input: 148 DAG size of output 121 [2018-04-11 21:56:57,285 WARN L151 SmtUtils]: Spent 11416ms on a formula simplification. DAG size of input: 252 DAG size of output 242 [2018-04-11 21:56:58,902 WARN L151 SmtUtils]: Spent 1471ms on a formula simplification. DAG size of input: 155 DAG size of output 133 [2018-04-11 21:57:06,066 WARN L151 SmtUtils]: Spent 6651ms on a formula simplification. DAG size of input: 194 DAG size of output 177 [2018-04-11 21:57:13,188 WARN L151 SmtUtils]: Spent 6992ms on a formula simplification. DAG size of input: 187 DAG size of output 170 [2018-04-11 21:57:18,768 WARN L151 SmtUtils]: Spent 5424ms on a formula simplification. DAG size of input: 194 DAG size of output 174 [2018-04-11 21:57:20,166 WARN L151 SmtUtils]: Spent 732ms on a formula simplification. DAG size of input: 125 DAG size of output 112 [2018-04-11 21:57:21,443 WARN L151 SmtUtils]: Spent 812ms on a formula simplification. DAG size of input: 122 DAG size of output 111 [2018-04-11 21:57:22,485 WARN L151 SmtUtils]: Spent 747ms on a formula simplification. DAG size of input: 130 DAG size of output 115 [2018-04-11 21:57:23,422 WARN L151 SmtUtils]: Spent 593ms on a formula simplification. DAG size of input: 113 DAG size of output 103 [2018-04-11 21:57:24,785 WARN L151 SmtUtils]: Spent 660ms on a formula simplification. DAG size of input: 117 DAG size of output 107 [2018-04-11 21:57:24,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:57:24,888 INFO L93 Difference]: Finished difference Result 1663 states and 2002 transitions. [2018-04-11 21:57:24,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-04-11 21:57:24,889 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 61 [2018-04-11 21:57:24,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:57:24,889 INFO L225 Difference]: With dead ends: 1663 [2018-04-11 21:57:24,889 INFO L226 Difference]: Without dead ends: 1663 [2018-04-11 21:57:24,890 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2931 ImplicationChecksByTransitivity, 249.2s TimeCoverageRelationStatistics Valid=2488, Invalid=9721, Unknown=1, NotChecked=0, Total=12210 [2018-04-11 21:57:24,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1663 states. [2018-04-11 21:57:24,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1663 to 662. [2018-04-11 21:57:24,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2018-04-11 21:57:24,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 848 transitions. [2018-04-11 21:57:24,897 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 848 transitions. Word has length 61 [2018-04-11 21:57:24,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:57:24,897 INFO L459 AbstractCegarLoop]: Abstraction has 662 states and 848 transitions. [2018-04-11 21:57:24,898 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-04-11 21:57:24,898 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 848 transitions. [2018-04-11 21:57:24,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-11 21:57:24,898 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:57:24,898 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:57:24,898 INFO L408 AbstractCegarLoop]: === Iteration 70 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:57:24,899 INFO L82 PathProgramCache]: Analyzing trace with hash -2130375603, now seen corresponding path program 1 times [2018-04-11 21:57:24,899 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:57:24,899 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:57:24,899 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:57:24,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:57:24,900 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:57:24,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:57:24,912 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:57:25,306 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:57:25,307 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 21:57:25,307 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 21:57:25,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:57:25,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:57:25,340 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:57:25,350 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:25,350 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:25,350 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 21:57:25,350 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:25,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:25,352 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:9 [2018-04-11 21:57:25,366 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 21:57:25,366 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 10 treesize of output 9 [2018-04-11 21:57:25,367 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:25,367 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:25,371 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 21:57:25,371 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:26 [2018-04-11 21:57:25,407 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 44 treesize of output 38 [2018-04-11 21:57:25,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 21:57:25,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:25,411 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:25,415 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 21:57:25,415 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:26 [2018-04-11 21:57:25,416 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:25,417 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:25,417 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 21:57:25,417 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:25,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:25,420 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:25 [2018-04-11 21:57:25,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-04-11 21:57:25,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:57:25,476 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:25,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:25,483 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 21:57:25,483 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:30 [2018-04-11 21:57:25,505 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 55 treesize of output 49 [2018-04-11 21:57:25,506 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 21:57:25,507 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:25,510 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:25,515 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 21:57:25,515 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:64, output treesize:51 [2018-04-11 21:57:25,800 WARN L151 SmtUtils]: Spent 139ms on a formula simplification. DAG size of input: 35 DAG size of output 34 [2018-04-11 21:57:25,859 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:25,860 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:25,860 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:25,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 52 [2018-04-11 21:57:25,861 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:25,884 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 21:57:25,884 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:80 [2018-04-11 21:57:26,001 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 74 treesize of output 62 [2018-04-11 21:57:26,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, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 69 [2018-04-11 21:57:26,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:26,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:26,017 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 21:57:26,017 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:88, output treesize:77 [2018-04-11 21:57:26,075 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 74 treesize of output 78 [2018-04-11 21:57:26,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:57:26,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:26,087 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:26,105 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 21:57:26,105 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:88, output treesize:84 [2018-04-11 21:57:26,165 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 83 treesize of output 85 [2018-04-11 21:57:26,166 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:26,167 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 21:57:26,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:26,175 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:26,185 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 21:57:26,185 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:97, output treesize:93 [2018-04-11 21:57:26,241 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:26,242 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:26,243 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:26,243 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:26,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 79 [2018-04-11 21:57:26,243 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:26,267 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 21:57:26,267 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:104, output treesize:120 [2018-04-11 21:57:26,337 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 111 treesize of output 111 [2018-04-11 21:57:26,338 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:26,339 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:26,339 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:26,341 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 23 treesize of output 46 [2018-04-11 21:57:26,341 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:26,354 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:26,373 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 21:57:26,373 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:133, output treesize:144 [2018-04-11 21:57:26,557 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 0 case distinctions, treesize of input 199 treesize of output 171 [2018-04-11 21:57:26,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:57:26,558 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:26,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:26,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 21:57:26,590 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:204, output treesize:173 [2018-04-11 21:57:26,723 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 47 treesize of output 130 [2018-04-11 21:57:26,723 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:26,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-11 21:57:26,738 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:179, output treesize:178 [2018-04-11 21:57:26,844 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 177 treesize of output 118 [2018-04-11 21:57:26,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-04-11 21:57:26,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:26,858 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:26,859 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:26,859 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:26,860 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 52 treesize of output 44 [2018-04-11 21:57:26,861 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 21:57:26,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, 7 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 41 [2018-04-11 21:57:26,872 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 21:57:26,882 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 21:57:26,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 21:57:26,891 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:182, output treesize:49 [2018-04-11 21:57:26,961 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 21:57:26,978 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-11 21:57:26,979 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [22] total 45 [2018-04-11 21:57:26,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-04-11 21:57:26,979 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-04-11 21:57:26,979 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=1838, Unknown=0, NotChecked=0, Total=2070 [2018-04-11 21:57:26,979 INFO L87 Difference]: Start difference. First operand 662 states and 848 transitions. Second operand 46 states. [2018-04-11 21:57:28,743 WARN L151 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 61 DAG size of output 51 [2018-04-11 21:57:30,990 WARN L151 SmtUtils]: Spent 158ms on a formula simplification. DAG size of input: 121 DAG size of output 107 [2018-04-11 21:57:31,857 WARN L151 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 97 DAG size of output 83 [2018-04-11 21:57:32,620 WARN L151 SmtUtils]: Spent 206ms on a formula simplification. DAG size of input: 108 DAG size of output 95 [2018-04-11 21:57:32,843 WARN L151 SmtUtils]: Spent 153ms on a formula simplification. DAG size of input: 102 DAG size of output 89 [2018-04-11 21:57:33,951 WARN L151 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 93 DAG size of output 86 [2018-04-11 21:57:35,062 WARN L151 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 94 DAG size of output 81 [2018-04-11 21:57:36,234 WARN L151 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 88 DAG size of output 78 [2018-04-11 21:57:37,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:57:37,332 INFO L93 Difference]: Finished difference Result 1595 states and 1977 transitions. [2018-04-11 21:57:37,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-04-11 21:57:37,333 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 61 [2018-04-11 21:57:37,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:57:37,334 INFO L225 Difference]: With dead ends: 1595 [2018-04-11 21:57:37,334 INFO L226 Difference]: Without dead ends: 1595 [2018-04-11 21:57:37,335 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 40 SyntacticMatches, 5 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3560 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=2875, Invalid=11166, Unknown=1, NotChecked=0, Total=14042 [2018-04-11 21:57:37,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1595 states. [2018-04-11 21:57:37,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1595 to 721. [2018-04-11 21:57:37,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2018-04-11 21:57:37,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 930 transitions. [2018-04-11 21:57:37,344 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 930 transitions. Word has length 61 [2018-04-11 21:57:37,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:57:37,344 INFO L459 AbstractCegarLoop]: Abstraction has 721 states and 930 transitions. [2018-04-11 21:57:37,344 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-04-11 21:57:37,344 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 930 transitions. [2018-04-11 21:57:37,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-11 21:57:37,344 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:57:37,345 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:57:37,345 INFO L408 AbstractCegarLoop]: === Iteration 71 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:57:37,345 INFO L82 PathProgramCache]: Analyzing trace with hash -2130375602, now seen corresponding path program 1 times [2018-04-11 21:57:37,345 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:57:37,345 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:57:37,345 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:57:37,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:57:37,345 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:57:37,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:57:37,354 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:57:38,021 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:57:38,022 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 21:57:38,022 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 21:57:38,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:57:38,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:57:38,051 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:57:38,068 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 21:57:38,068 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:38,072 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:38,072 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:38,072 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 21:57:38,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:38,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:38,075 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2018-04-11 21:57:38,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 13 treesize of output 10 [2018-04-11 21:57:38,093 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 10 treesize of output 9 [2018-04-11 21:57:38,094 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:38,094 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:38,099 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 21:57:38,099 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:37 [2018-04-11 21:57:38,144 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 55 treesize of output 49 [2018-04-11 21:57:38,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:57:38,146 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:38,149 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:38,153 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 21:57:38,153 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:60, output treesize:37 [2018-04-11 21:57:38,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-04-11 21:57:38,156 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:38,162 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:38,162 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:38,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 21:57:38,163 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:38,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:38,167 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:41 [2018-04-11 21:57:38,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 44 [2018-04-11 21:57:38,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:57:38,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:38,246 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:38,253 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 21:57:38,254 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:51 [2018-04-11 21:57:38,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 88 [2018-04-11 21:57:38,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 21:57:38,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:38,329 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:38,347 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 110 treesize of output 104 [2018-04-11 21:57:38,348 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 20 treesize of output 19 [2018-04-11 21:57:38,349 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:38,356 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:38,369 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 21:57:38,369 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:148, output treesize:138 [2018-04-11 21:57:38,590 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:38,591 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:38,592 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:38,593 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:38,593 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 49 treesize of output 129 [2018-04-11 21:57:38,594 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:38,617 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:38,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 109 [2018-04-11 21:57:38,617 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:38,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:38,638 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:165, output treesize:162 [2018-04-11 21:57:38,748 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 142 treesize of output 116 [2018-04-11 21:57:38,751 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:38,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 147 [2018-04-11 21:57:38,751 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:38,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:38,785 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 102 treesize of output 89 [2018-04-11 21:57:38,787 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:38,788 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 104 [2018-04-11 21:57:38,788 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:38,795 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:38,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:57:38,811 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:181, output treesize:166 [2018-04-11 21:57:38,867 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:38,871 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 142 treesize of output 144 [2018-04-11 21:57:38,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 11 [2018-04-11 21:57:38,873 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:38,886 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:38,910 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 120 treesize of output 125 [2018-04-11 21:57:38,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 15 [2018-04-11 21:57:38,912 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:38,921 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:38,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:57:38,940 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:188, output treesize:192 [2018-04-11 21:57:39,002 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:39,007 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 170 treesize of output 170 [2018-04-11 21:57:39,009 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:39,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 20 treesize of output 31 [2018-04-11 21:57:39,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:39,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:39,063 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 137 treesize of output 143 [2018-04-11 21:57:39,065 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:39,065 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 24 treesize of output 39 [2018-04-11 21:57:39,065 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:39,077 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:39,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:57:39,101 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:218, output treesize:214 [2018-04-11 21:57:39,173 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:39,174 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:39,175 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:39,175 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:39,176 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:39,177 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:39,178 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:39,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 160 [2018-04-11 21:57:39,178 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:39,219 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:39,220 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:39,221 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:39,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 11 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 158 [2018-04-11 21:57:39,221 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:39,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:57:39,260 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:231, output treesize:266 [2018-04-11 21:57:39,343 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:39,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 240 treesize of output 232 [2018-04-11 21:57:39,351 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:39,352 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:39,353 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:39,354 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 27 treesize of output 58 [2018-04-11 21:57:39,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:39,387 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:39,439 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 170 treesize of output 170 [2018-04-11 21:57:39,442 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:39,442 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:39,442 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:39,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 70 [2018-04-11 21:57:39,444 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:39,460 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:39,494 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 21:57:39,494 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:292, output treesize:296 [2018-04-11 21:57:39,670 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:39,671 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:39,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 406 treesize of output 376 [2018-04-11 21:57:39,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 22 treesize of output 21 [2018-04-11 21:57:39,682 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:39,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:39,754 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:39,758 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 329 treesize of output 345 [2018-04-11 21:57:39,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:57:39,760 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:39,784 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:39,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:57:39,820 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:420, output treesize:342 [2018-04-11 21:57:39,913 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:39,914 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:39,914 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:39,915 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:39,916 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:39,917 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:39,918 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:39,918 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:39,919 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:39,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 235 [2018-04-11 21:57:39,919 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:39,957 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:39,958 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:39,959 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:39,959 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:39,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 16 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 287 [2018-04-11 21:57:39,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:39,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 21:57:39,994 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:353, output treesize:334 [2018-04-11 21:57:40,102 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:40,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 325 treesize of output 244 [2018-04-11 21:57:40,107 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:40,107 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:40,108 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:40,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 78 [2018-04-11 21:57:40,110 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 21:57:40,137 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:40,138 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:40,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 78 [2018-04-11 21:57:40,138 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 21:57:40,159 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 50 treesize of output 18 [2018-04-11 21:57:40,159 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 21:57:40,177 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 21:57:40,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 46 [2018-04-11 21:57:40,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2018-04-11 21:57:40,203 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 21:57:40,210 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:40,210 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 21:57:40,210 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:40,213 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:40,230 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 21:57:40,231 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:352, output treesize:60 [2018-04-11 21:57:40,312 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 21:57:40,329 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-11 21:57:40,329 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [24] total 49 [2018-04-11 21:57:40,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-04-11 21:57:40,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-04-11 21:57:40,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=2175, Unknown=0, NotChecked=0, Total=2450 [2018-04-11 21:57:40,330 INFO L87 Difference]: Start difference. First operand 721 states and 930 transitions. Second operand 50 states. [2018-04-11 21:57:44,044 WARN L151 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 131 DAG size of output 107 [2018-04-11 21:57:44,270 WARN L151 SmtUtils]: Spent 145ms on a formula simplification. DAG size of input: 163 DAG size of output 133 [2018-04-11 21:57:44,986 WARN L151 SmtUtils]: Spent 169ms on a formula simplification. DAG size of input: 164 DAG size of output 140 [2018-04-11 21:57:45,291 WARN L151 SmtUtils]: Spent 167ms on a formula simplification. DAG size of input: 157 DAG size of output 133 [2018-04-11 21:57:45,573 WARN L151 SmtUtils]: Spent 165ms on a formula simplification. DAG size of input: 188 DAG size of output 142 [2018-04-11 21:57:45,957 WARN L151 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 134 DAG size of output 111 [2018-04-11 21:57:46,263 WARN L151 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 137 DAG size of output 114 [2018-04-11 21:57:46,508 WARN L151 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 132 DAG size of output 110 [2018-04-11 21:57:46,741 WARN L151 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 130 DAG size of output 108 [2018-04-11 21:57:51,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:57:51,739 INFO L93 Difference]: Finished difference Result 1633 states and 2015 transitions. [2018-04-11 21:57:51,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-04-11 21:57:51,739 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 61 [2018-04-11 21:57:51,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:57:51,740 INFO L225 Difference]: With dead ends: 1633 [2018-04-11 21:57:51,740 INFO L226 Difference]: Without dead ends: 1633 [2018-04-11 21:57:51,741 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4626 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=2840, Invalid=13664, Unknown=8, NotChecked=0, Total=16512 [2018-04-11 21:57:51,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2018-04-11 21:57:51,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 721. [2018-04-11 21:57:51,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2018-04-11 21:57:51,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 930 transitions. [2018-04-11 21:57:51,747 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 930 transitions. Word has length 61 [2018-04-11 21:57:51,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:57:51,747 INFO L459 AbstractCegarLoop]: Abstraction has 721 states and 930 transitions. [2018-04-11 21:57:51,747 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-04-11 21:57:51,747 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 930 transitions. [2018-04-11 21:57:51,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-11 21:57:51,747 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:57:51,747 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:57:51,747 INFO L408 AbstractCegarLoop]: === Iteration 72 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:57:51,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1299733059, now seen corresponding path program 1 times [2018-04-11 21:57:51,747 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:57:51,747 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:57:51,748 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:57:51,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:57:51,748 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:57:51,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:57:51,753 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:57:51,855 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:57:51,855 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 21:57:51,855 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 21:57:51,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:57:51,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:57:51,878 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:57:51,882 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:51,882 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:51,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 21:57:51,883 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:51,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:51,885 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:15 [2018-04-11 21:57:51,892 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 21:57:51,892 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 21:57:51,892 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:51,893 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:51,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:51,896 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-04-11 21:57:51,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, 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 21:57:51,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 21:57:51,911 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:51,913 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:51,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:51,917 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-04-11 21:57:51,933 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 28 treesize of output 27 [2018-04-11 21:57:51,935 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:51,935 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 21:57:51,935 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:51,939 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:51,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:51,944 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-04-11 21:57:51,961 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:51,962 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:51,962 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 21:57:51,962 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:51,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:51,967 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:36 [2018-04-11 21:57:51,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 34 [2018-04-11 21:57:51,986 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:51,987 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:51,987 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:51,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-04-11 21:57:51,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:51,995 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:52,001 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 21:57:52,001 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:42 [2018-04-11 21:57:52,046 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 76 [2018-04-11 21:57:52,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 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 21:57:52,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:52,082 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:52,082 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:52,083 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:52,085 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:52,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 90 [2018-04-11 21:57:52,099 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 8 xjuncts. [2018-04-11 21:57:52,145 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-11 21:57:52,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-04-11 21:57:52,172 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:86, output treesize:193 [2018-04-11 21:57:52,985 WARN L148 SmtUtils]: Spent 696ms on a formula simplification that was a NOOP. DAG size: 59 [2018-04-11 21:57:53,625 WARN L148 SmtUtils]: Spent 610ms on a formula simplification that was a NOOP. DAG size: 59 [2018-04-11 21:57:53,629 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 62 treesize of output 38 [2018-04-11 21:57:53,630 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:53,630 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:53,631 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:53,632 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 21 treesize of output 25 [2018-04-11 21:57:53,632 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:53,637 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 18 treesize of output 9 [2018-04-11 21:57:53,637 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:53,638 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:53,659 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 54 treesize of output 34 [2018-04-11 21:57:53,660 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 27 treesize of output 24 [2018-04-11 21:57:53,660 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:53,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, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 17 [2018-04-11 21:57:53,664 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:53,666 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:53,683 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 50 treesize of output 32 [2018-04-11 21:57:53,684 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:57:53,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 21:57:53,685 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:53,688 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 18 treesize of output 9 [2018-04-11 21:57:53,688 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:53,690 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:53,702 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 54 treesize of output 34 [2018-04-11 21:57:53,703 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 27 treesize of output 24 [2018-04-11 21:57:53,703 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:53,707 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 31 treesize of output 17 [2018-04-11 21:57:53,707 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 21:57:53,709 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:53,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:57:53,717 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 16 variables, input treesize:221, output treesize:4 [2018-04-11 21:57:53,738 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:57:53,756 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 21:57:53,756 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 23 [2018-04-11 21:57:53,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 21:57:53,757 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 21:57:53,757 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2018-04-11 21:57:53,757 INFO L87 Difference]: Start difference. First operand 721 states and 930 transitions. Second operand 23 states. [2018-04-11 21:57:55,802 WARN L151 SmtUtils]: Spent 772ms on a formula simplification. DAG size of input: 130 DAG size of output 79 [2018-04-11 21:57:56,639 WARN L151 SmtUtils]: Spent 806ms on a formula simplification. DAG size of input: 127 DAG size of output 76 [2018-04-11 21:57:57,532 WARN L151 SmtUtils]: Spent 796ms on a formula simplification. DAG size of input: 131 DAG size of output 78 [2018-04-11 21:57:58,317 WARN L151 SmtUtils]: Spent 755ms on a formula simplification. DAG size of input: 132 DAG size of output 79 [2018-04-11 21:57:59,591 WARN L151 SmtUtils]: Spent 1232ms on a formula simplification. DAG size of input: 112 DAG size of output 73 [2018-04-11 21:58:00,502 WARN L151 SmtUtils]: Spent 850ms on a formula simplification. DAG size of input: 75 DAG size of output 65 [2018-04-11 21:58:01,941 WARN L151 SmtUtils]: Spent 1382ms on a formula simplification. DAG size of input: 123 DAG size of output 78 [2018-04-11 21:58:02,934 WARN L151 SmtUtils]: Spent 820ms on a formula simplification. DAG size of input: 76 DAG size of output 66 [2018-04-11 21:58:04,167 WARN L151 SmtUtils]: Spent 1062ms on a formula simplification. DAG size of input: 116 DAG size of output 75 [2018-04-11 21:58:05,255 WARN L151 SmtUtils]: Spent 1048ms on a formula simplification. DAG size of input: 117 DAG size of output 76 [2018-04-11 21:58:05,993 WARN L148 SmtUtils]: Spent 541ms on a formula simplification that was a NOOP. DAG size: 64 [2018-04-11 21:58:06,645 WARN L148 SmtUtils]: Spent 581ms on a formula simplification that was a NOOP. DAG size: 65 [2018-04-11 21:58:07,927 WARN L151 SmtUtils]: Spent 1152ms on a formula simplification. DAG size of input: 107 DAG size of output 68 [2018-04-11 21:58:09,080 WARN L151 SmtUtils]: Spent 1118ms on a formula simplification. DAG size of input: 111 DAG size of output 70 [2018-04-11 21:58:10,078 WARN L151 SmtUtils]: Spent 975ms on a formula simplification. DAG size of input: 112 DAG size of output 71 [2018-04-11 21:58:10,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:58:10,110 INFO L93 Difference]: Finished difference Result 1386 states and 1719 transitions. [2018-04-11 21:58:10,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-11 21:58:10,110 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 62 [2018-04-11 21:58:10,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:58:10,111 INFO L225 Difference]: With dead ends: 1386 [2018-04-11 21:58:10,111 INFO L226 Difference]: Without dead ends: 1386 [2018-04-11 21:58:10,111 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 550 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=487, Invalid=1959, Unknown=4, NotChecked=0, Total=2450 [2018-04-11 21:58:10,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2018-04-11 21:58:10,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 721. [2018-04-11 21:58:10,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2018-04-11 21:58:10,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 929 transitions. [2018-04-11 21:58:10,116 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 929 transitions. Word has length 62 [2018-04-11 21:58:10,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:58:10,116 INFO L459 AbstractCegarLoop]: Abstraction has 721 states and 929 transitions. [2018-04-11 21:58:10,116 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 21:58:10,116 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 929 transitions. [2018-04-11 21:58:10,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-11 21:58:10,117 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:58:10,117 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:58:10,117 INFO L408 AbstractCegarLoop]: === Iteration 73 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:58:10,117 INFO L82 PathProgramCache]: Analyzing trace with hash -57352567, now seen corresponding path program 1 times [2018-04-11 21:58:10,117 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:58:10,117 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:58:10,117 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:58:10,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:58:10,118 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:58:10,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:58:10,129 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:58:10,654 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:58:10,654 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 21:58:10,654 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 21:58:10,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:58:10,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:58:10,682 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:58:10,716 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:10,716 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:10,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 21:58:10,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:10,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:10,719 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-11 21:58:10,735 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 21:58:10,736 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 21:58:10,736 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:10,737 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:10,742 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 21:58:10,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 21:58:10,743 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:10,744 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:10,748 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 21:58:10,748 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:39, output treesize:28 [2018-04-11 21:58:10,798 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 57 treesize of output 51 [2018-04-11 21:58:10,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:58:10,800 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:10,804 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:10,818 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 21:58:10,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:58:10,839 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:10,843 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:10,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:10,849 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:74, output treesize:28 [2018-04-11 21:58:10,853 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:10,853 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:10,854 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 21:58:10,854 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:10,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:10,858 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:27 [2018-04-11 21:58:10,953 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 21:58:10,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, 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 21:58:10,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:10,959 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:10,970 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 21:58:10,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:58:10,971 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:10,975 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:10,982 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 21:58:10,982 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:60, output treesize:38 [2018-04-11 21:58:11,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 62 [2018-04-11 21:58:11,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 21:58:11,023 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:11,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:11,039 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 33 treesize of output 34 [2018-04-11 21:58:11,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:58:11,041 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:11,045 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:11,053 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 21:58:11,053 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:84, output treesize:48 [2018-04-11 21:58:11,506 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:11,507 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 118 treesize of output 112 [2018-04-11 21:58:11,508 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:58:11,509 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 58 treesize of output 46 [2018-04-11 21:58:11,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:11,519 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 21:58:11,519 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:11,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:11,547 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:11,548 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 118 treesize of output 102 [2018-04-11 21:58:11,549 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 21:58:11,549 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 48 treesize of output 32 [2018-04-11 21:58:11,550 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:11,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 21:58:11,560 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:11,567 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:11,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 21:58:11,584 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:237, output treesize:135 [2018-04-11 21:58:11,793 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 101 treesize of output 71 [2018-04-11 21:58:11,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 38 treesize of output 70 [2018-04-11 21:58:11,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 8 xjuncts. [2018-04-11 21:58:11,865 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-11 21:58:11,929 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 85 treesize of output 63 [2018-04-11 21:58:11,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 60 [2018-04-11 21:58:11,943 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 8 xjuncts. [2018-04-11 21:58:11,979 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-11 21:58:12,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 8 xjuncts. [2018-04-11 21:58:12,073 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:187, output treesize:429 [2018-04-11 21:58:12,580 WARN L151 SmtUtils]: Spent 455ms on a formula simplification. DAG size of input: 63 DAG size of output 41 [2018-04-11 21:58:12,819 WARN L148 SmtUtils]: Spent 182ms on a formula simplification that was a NOOP. DAG size: 36 [2018-04-11 21:58:12,822 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:12,822 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 64 treesize of output 75 [2018-04-11 21:58:12,822 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:12,847 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:12,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 73 [2018-04-11 21:58:12,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:12,870 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:12,870 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 48 treesize of output 59 [2018-04-11 21:58:12,870 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:12,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-04-11 21:58:12,890 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:175, output treesize:132 [2018-04-11 21:58:13,110 WARN L148 SmtUtils]: Spent 121ms on a formula simplification that was a NOOP. DAG size: 43 [2018-04-11 21:58:13,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 46 [2018-04-11 21:58:13,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-04-11 21:58:13,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:13,122 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 10 [2018-04-11 21:58:13,122 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:13,127 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:13,146 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 46 treesize of output 40 [2018-04-11 21:58:13,147 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 10 [2018-04-11 21:58:13,147 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:13,152 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:13,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 38 [2018-04-11 21:58:13,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-04-11 21:58:13,171 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 21:58:13,176 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 10 [2018-04-11 21:58:13,176 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:13,180 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:58:13,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-04-11 21:58:13,195 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 12 variables, input treesize:159, output treesize:34 [2018-04-11 21:58:13,251 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:58:13,268 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 21:58:13,268 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 28] total 53 [2018-04-11 21:58:13,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-04-11 21:58:13,269 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-04-11 21:58:13,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=2623, Unknown=0, NotChecked=0, Total=2862 [2018-04-11 21:58:13,269 INFO L87 Difference]: Start difference. First operand 721 states and 929 transitions. Second operand 54 states. [2018-04-11 21:58:16,511 WARN L151 SmtUtils]: Spent 281ms on a formula simplification. DAG size of input: 61 DAG size of output 53 [2018-04-11 21:58:16,890 WARN L151 SmtUtils]: Spent 342ms on a formula simplification. DAG size of input: 52 DAG size of output 49 [2018-04-11 21:58:17,273 WARN L151 SmtUtils]: Spent 350ms on a formula simplification. DAG size of input: 56 DAG size of output 47 [2018-04-11 21:58:17,906 WARN L151 SmtUtils]: Spent 510ms on a formula simplification. DAG size of input: 70 DAG size of output 61 [2018-04-11 21:58:18,472 WARN L151 SmtUtils]: Spent 521ms on a formula simplification. DAG size of input: 74 DAG size of output 65 [2018-04-11 21:58:19,077 WARN L151 SmtUtils]: Spent 556ms on a formula simplification. DAG size of input: 84 DAG size of output 67 [2018-04-11 21:58:19,705 WARN L151 SmtUtils]: Spent 573ms on a formula simplification. DAG size of input: 91 DAG size of output 74 [2018-04-11 21:58:20,122 WARN L151 SmtUtils]: Spent 368ms on a formula simplification. DAG size of input: 83 DAG size of output 65 [2018-04-11 21:58:20,677 WARN L151 SmtUtils]: Spent 520ms on a formula simplification. DAG size of input: 79 DAG size of output 69 [2018-04-11 21:58:21,189 WARN L151 SmtUtils]: Spent 455ms on a formula simplification. DAG size of input: 91 DAG size of output 80 [2018-04-11 21:58:21,812 WARN L151 SmtUtils]: Spent 569ms on a formula simplification. DAG size of input: 99 DAG size of output 87 [2018-04-11 21:58:22,114 WARN L151 SmtUtils]: Spent 239ms on a formula simplification. DAG size of input: 70 DAG size of output 66 [2018-04-11 21:58:22,407 WARN L151 SmtUtils]: Spent 252ms on a formula simplification. DAG size of input: 75 DAG size of output 70 [2018-04-11 21:58:22,796 WARN L151 SmtUtils]: Spent 274ms on a formula simplification. DAG size of input: 75 DAG size of output 69 [2018-04-11 21:58:23,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:58:23,571 INFO L93 Difference]: Finished difference Result 893 states and 1103 transitions. [2018-04-11 21:58:23,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-04-11 21:58:23,571 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 62 [2018-04-11 21:58:23,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:58:23,572 INFO L225 Difference]: With dead ends: 893 [2018-04-11 21:58:23,572 INFO L226 Difference]: Without dead ends: 893 [2018-04-11 21:58:23,572 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3388 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=1257, Invalid=9663, Unknown=0, NotChecked=0, Total=10920 [2018-04-11 21:58:23,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2018-04-11 21:58:23,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 740. [2018-04-11 21:58:23,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2018-04-11 21:58:23,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 955 transitions. [2018-04-11 21:58:23,576 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 955 transitions. Word has length 62 [2018-04-11 21:58:23,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:58:23,576 INFO L459 AbstractCegarLoop]: Abstraction has 740 states and 955 transitions. [2018-04-11 21:58:23,576 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-04-11 21:58:23,576 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 955 transitions. [2018-04-11 21:58:23,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-11 21:58:23,576 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:58:23,576 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:58:23,576 INFO L408 AbstractCegarLoop]: === Iteration 74 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:58:23,576 INFO L82 PathProgramCache]: Analyzing trace with hash -57352566, now seen corresponding path program 1 times [2018-04-11 21:58:23,577 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:58:23,577 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:58:23,577 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:58:23,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:58:23,577 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:58:23,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:58:23,584 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:58:23,831 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 21:58:23,831 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 21:58:23,831 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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 21:58:23,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:58:23,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:58:23,863 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:58:23,870 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:23,871 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:23,871 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 21:58:23,871 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:23,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:23,874 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-11 21:58:23,884 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 21:58:23,885 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 21:58:23,885 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:23,886 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:23,890 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 21:58:23,890 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:32 [2018-04-11 21:58:23,918 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 45 treesize of output 39 [2018-04-11 21:58:23,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 21:58:23,919 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:23,922 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:23,926 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 21:58:23,926 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:32 [2018-04-11 21:58:23,928 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:23,929 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:23,929 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:23,930 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 22 treesize of output 25 [2018-04-11 21:58:23,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:23,934 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 21:58:23,934 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:23,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:23,938 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:35 [2018-04-11 21:58:23,983 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 21:58:23,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:58:23,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:23,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:23,995 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 32 treesize of output 33 [2018-04-11 21:58:23,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 21:58:23,996 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:23,999 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:24,006 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 21:58:24,007 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:64, output treesize:42 [2018-04-11 21:58:24,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2018-04-11 21:58:24,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 21:58:24,045 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:24,046 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:24,057 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 57 treesize of output 51 [2018-04-11 21:58:24,060 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 21:58:24,060 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:24,064 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:24,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 21:58:24,072 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:88, output treesize:72 [2018-04-11 21:58:24,424 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 106 treesize of output 108 [2018-04-11 21:58:24,436 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 96 [2018-04-11 21:58:24,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-04-11 21:58:24,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 87 [2018-04-11 21:58:24,490 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:24,530 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 21:58:24,585 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 101 [2018-04-11 21:58:24,587 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 101 treesize of output 98 [2018-04-11 21:58:24,588 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:24,596 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:24,601 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 0 case distinctions, treesize of input 187 treesize of output 153 [2018-04-11 21:58:24,609 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 177 [2018-04-11 21:58:24,610 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 21:58:24,642 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 21:58:24,655 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 3 case distinctions, treesize of input 146 treesize of output 142 [2018-04-11 21:58:24,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 152 [2018-04-11 21:58:24,658 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:24,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 118 treesize of output 134 [2018-04-11 21:58:24,705 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 21:58:24,739 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 21:58:24,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 10 dim-0 vars, and 5 xjuncts. [2018-04-11 21:58:24,813 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:185, output treesize:544 [2018-04-11 21:58:25,009 WARN L151 SmtUtils]: Spent 132ms on a formula simplification. DAG size of input: 129 DAG size of output 108 [2018-04-11 21:58:25,207 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 114 treesize of output 102 [2018-04-11 21:58:25,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2018-04-11 21:58:25,208 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 21:58:25,220 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 38 [2018-04-11 21:58:25,220 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:25,229 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 21:58:25,271 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 108 treesize of output 96 [2018-04-11 21:58:25,274 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 52 treesize of output 22 [2018-04-11 21:58:25,274 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:25,283 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:25,324 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 69 treesize of output 61 [2018-04-11 21:58:25,325 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 36 treesize of output 17 [2018-04-11 21:58:25,325 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:25,332 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:25,367 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 66 treesize of output 60 [2018-04-11 21:58:25,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2018-04-11 21:58:25,368 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:25,376 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:25,407 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 106 [2018-04-11 21:58:25,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 40 [2018-04-11 21:58:25,412 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-04-11 21:58:25,427 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 39 treesize of output 35 [2018-04-11 21:58:25,427 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 21:58:25,429 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 37 treesize of output 31 [2018-04-11 21:58:25,429 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 21:58:25,443 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 21:58:25,486 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 66 treesize of output 60 [2018-04-11 21:58:25,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2018-04-11 21:58:25,487 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:25,495 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:25,496 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 70 treesize of output 64 [2018-04-11 21:58:25,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2018-04-11 21:58:25,497 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:25,505 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:25,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 6 dim-2 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2018-04-11 21:58:25,544 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 18 variables, input treesize:356, output treesize:116 [2018-04-11 21:58:25,895 WARN L151 SmtUtils]: Spent 190ms on a formula simplification. DAG size of input: 61 DAG size of output 31 [2018-04-11 21:58:25,917 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:58:25,935 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 21:58:25,935 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 22] total 35 [2018-04-11 21:58:25,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-11 21:58:25,935 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-11 21:58:25,935 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1135, Unknown=0, NotChecked=0, Total=1260 [2018-04-11 21:58:25,935 INFO L87 Difference]: Start difference. First operand 740 states and 955 transitions. Second operand 36 states. [2018-04-11 21:58:28,150 WARN L151 SmtUtils]: Spent 369ms on a formula simplification. DAG size of input: 135 DAG size of output 130 [2018-04-11 21:58:28,462 WARN L151 SmtUtils]: Spent 276ms on a formula simplification. DAG size of input: 118 DAG size of output 116 [2018-04-11 21:58:28,818 WARN L151 SmtUtils]: Spent 316ms on a formula simplification. DAG size of input: 118 DAG size of output 91 [2018-04-11 21:58:29,156 WARN L151 SmtUtils]: Spent 251ms on a formula simplification. DAG size of input: 148 DAG size of output 95 [2018-04-11 21:58:29,515 WARN L151 SmtUtils]: Spent 249ms on a formula simplification. DAG size of input: 124 DAG size of output 93 [2018-04-11 21:58:29,839 WARN L151 SmtUtils]: Spent 249ms on a formula simplification. DAG size of input: 131 DAG size of output 100 [2018-04-11 21:58:30,277 WARN L151 SmtUtils]: Spent 238ms on a formula simplification. DAG size of input: 101 DAG size of output 98 [2018-04-11 21:58:30,636 WARN L151 SmtUtils]: Spent 251ms on a formula simplification. DAG size of input: 119 DAG size of output 106 [2018-04-11 21:58:31,201 WARN L151 SmtUtils]: Spent 453ms on a formula simplification. DAG size of input: 147 DAG size of output 110 [2018-04-11 21:58:32,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:58:32,294 INFO L93 Difference]: Finished difference Result 982 states and 1214 transitions. [2018-04-11 21:58:32,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-04-11 21:58:32,294 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 62 [2018-04-11 21:58:32,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:58:32,295 INFO L225 Difference]: With dead ends: 982 [2018-04-11 21:58:32,295 INFO L226 Difference]: Without dead ends: 982 [2018-04-11 21:58:32,295 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2072 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=902, Invalid=5904, Unknown=0, NotChecked=0, Total=6806 [2018-04-11 21:58:32,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2018-04-11 21:58:32,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 759. [2018-04-11 21:58:32,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2018-04-11 21:58:32,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 980 transitions. [2018-04-11 21:58:32,302 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 980 transitions. Word has length 62 [2018-04-11 21:58:32,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:58:32,302 INFO L459 AbstractCegarLoop]: Abstraction has 759 states and 980 transitions. [2018-04-11 21:58:32,302 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-11 21:58:32,302 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 980 transitions. [2018-04-11 21:58:32,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-11 21:58:32,302 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:58:32,303 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:58:32,303 INFO L408 AbstractCegarLoop]: === Iteration 75 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:58:32,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1463202560, now seen corresponding path program 1 times [2018-04-11 21:58:32,303 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:58:32,303 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:58:32,303 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:58:32,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:58:32,304 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:58:32,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:58:32,312 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:58:32,494 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:58:32,494 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 21:58:32,494 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 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 21:58:32,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:58:32,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:58:32,517 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:58:32,625 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:32,626 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:32,626 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 21:58:32,626 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:32,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:32,632 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:34 [2018-04-11 21:58:32,672 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 21:58:32,674 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:32,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 21:58:32,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:32,678 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:32,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 21:58:32,690 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:32,691 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 21:58:32,691 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:32,693 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:32,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:32,701 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:59, output treesize:51 [2018-04-11 21:58:32,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-04-11 21:58:32,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 13 [2018-04-11 21:58:32,731 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:32,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:32,748 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 41 treesize of output 48 [2018-04-11 21:58:32,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 19 [2018-04-11 21:58:32,749 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:32,754 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:32,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:32,764 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:73, output treesize:83 [2018-04-11 21:58:32,798 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 61 [2018-04-11 21:58:32,800 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:32,800 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 35 [2018-04-11 21:58:32,800 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:32,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:32,825 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 62 treesize of output 76 [2018-04-11 21:58:32,826 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:32,827 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 28 treesize of output 47 [2018-04-11 21:58:32,827 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:32,833 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:32,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:32,846 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:109, output treesize:107 [2018-04-11 21:58:32,883 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:32,884 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:32,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, 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 21:58:32,884 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:32,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:32,896 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:112, output treesize:106 [2018-04-11 21:58:32,938 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 86 treesize of output 83 [2018-04-11 21:58:32,940 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:32,940 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:32,941 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:32,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 64 [2018-04-11 21:58:32,942 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:32,953 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:32,984 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 77 treesize of output 83 [2018-04-11 21:58:32,986 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:32,986 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:32,987 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:32,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 82 [2018-04-11 21:58:32,989 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:32,999 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:33,016 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 21:58:33,016 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:132, output treesize:112 [2018-04-11 21:58:33,101 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 3 case distinctions, treesize of input 214 treesize of output 174 [2018-04-11 21:58:33,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 221 treesize of output 220 [2018-04-11 21:58:33,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:33,141 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:33,142 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:33,143 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:33,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 150 treesize of output 251 [2018-04-11 21:58:33,161 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 8 xjuncts. [2018-04-11 21:58:33,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-11 21:58:33,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 148 [2018-04-11 21:58:33,307 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:33,308 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:33,308 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:33,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 102 [2018-04-11 21:58:33,310 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:33,323 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:33,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, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 208 treesize of output 209 [2018-04-11 21:58:33,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 215 treesize of output 214 [2018-04-11 21:58:33,338 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:33,380 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:33,390 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 4 case distinctions, treesize of input 164 treesize of output 231 [2018-04-11 21:58:33,390 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-04-11 21:58:33,444 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 21:58:33,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 148 [2018-04-11 21:58:33,449 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:33,450 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 39 treesize of output 77 [2018-04-11 21:58:33,451 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:33,462 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:33,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 148 [2018-04-11 21:58:33,467 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:33,468 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 39 treesize of output 79 [2018-04-11 21:58:33,468 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:33,479 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:33,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-11 21:58:33,552 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:236, output treesize:501 [2018-04-11 21:58:33,718 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 146 treesize of output 127 [2018-04-11 21:58:33,720 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:33,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 18 [2018-04-11 21:58:33,720 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:33,730 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:33,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 42 [2018-04-11 21:58:33,732 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 21:58:33,740 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 21:58:33,776 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 129 treesize of output 117 [2018-04-11 21:58:33,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-04-11 21:58:33,777 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:33,787 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:33,787 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 66 treesize of output 46 [2018-04-11 21:58:33,788 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:33,794 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:33,825 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 51 [2018-04-11 21:58:33,826 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:33,826 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 21 treesize of output 22 [2018-04-11 21:58:33,826 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:33,833 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:33,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-11 21:58:33,834 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:33,841 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:33,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 106 [2018-04-11 21:58:33,873 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:33,873 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 53 treesize of output 47 [2018-04-11 21:58:33,874 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:33,884 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:33,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 36 [2018-04-11 21:58:33,885 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 21:58:33,892 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 21:58:33,915 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 40 [2018-04-11 21:58:33,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-04-11 21:58:33,916 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:33,924 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:33,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-11 21:58:33,924 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:33,929 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:33,946 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 70 treesize of output 53 [2018-04-11 21:58:33,948 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:33,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 8 [2018-04-11 21:58:33,948 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:33,954 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:33,955 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 19 treesize of output 14 [2018-04-11 21:58:33,955 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:33,959 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:33,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:33,970 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 12 variables, input treesize:401, output treesize:7 [2018-04-11 21:58:33,989 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:58:34,007 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 21:58:34,007 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 21] total 34 [2018-04-11 21:58:34,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-11 21:58:34,007 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-11 21:58:34,007 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=971, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 21:58:34,007 INFO L87 Difference]: Start difference. First operand 759 states and 980 transitions. Second operand 34 states. [2018-04-11 21:58:35,138 WARN L151 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 100 DAG size of output 68 [2018-04-11 21:58:35,274 WARN L151 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 97 DAG size of output 65 [2018-04-11 21:58:35,591 WARN L151 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 103 DAG size of output 69 [2018-04-11 21:58:35,761 WARN L151 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 111 DAG size of output 71 [2018-04-11 21:58:36,500 WARN L151 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 93 DAG size of output 60 [2018-04-11 21:58:36,726 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 93 DAG size of output 59 [2018-04-11 21:58:36,947 WARN L151 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 101 DAG size of output 61 [2018-04-11 21:58:37,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:58:37,916 INFO L93 Difference]: Finished difference Result 1551 states and 1873 transitions. [2018-04-11 21:58:37,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-11 21:58:37,916 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 64 [2018-04-11 21:58:37,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:58:37,917 INFO L225 Difference]: With dead ends: 1551 [2018-04-11 21:58:37,917 INFO L226 Difference]: Without dead ends: 1551 [2018-04-11 21:58:37,917 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1229 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1075, Invalid=3895, Unknown=0, NotChecked=0, Total=4970 [2018-04-11 21:58:37,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1551 states. [2018-04-11 21:58:37,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1551 to 837. [2018-04-11 21:58:37,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2018-04-11 21:58:37,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1072 transitions. [2018-04-11 21:58:37,922 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1072 transitions. Word has length 64 [2018-04-11 21:58:37,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:58:37,922 INFO L459 AbstractCegarLoop]: Abstraction has 837 states and 1072 transitions. [2018-04-11 21:58:37,922 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-11 21:58:37,922 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1072 transitions. [2018-04-11 21:58:37,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-11 21:58:37,922 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:58:37,922 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:58:37,923 INFO L408 AbstractCegarLoop]: === Iteration 76 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:58:37,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1327183513, now seen corresponding path program 1 times [2018-04-11 21:58:37,923 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:58:37,923 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:58:37,923 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:58:37,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:58:37,923 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:58:37,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:58:37,928 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:58:38,084 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:58:38,084 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 21:58:38,084 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 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 21:58:38,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:58:38,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:58:38,108 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:58:38,134 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:38,134 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:38,135 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 21:58:38,135 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:38,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:38,139 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:28 [2018-04-11 21:58:38,166 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 21:58:38,167 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:38,168 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 21:58:38,168 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:38,171 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:38,181 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 21:58:38,183 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:38,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, 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 21:58:38,184 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:38,196 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:38,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:38,203 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:53, output treesize:45 [2018-04-11 21:58:38,227 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 35 [2018-04-11 21:58:38,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 19 [2018-04-11 21:58:38,229 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:38,233 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:38,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2018-04-11 21:58:38,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 13 [2018-04-11 21:58:38,248 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:38,254 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:38,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:38,264 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:67, output treesize:77 [2018-04-11 21:58:38,301 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 62 treesize of output 70 [2018-04-11 21:58:38,302 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:38,303 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 28 treesize of output 47 [2018-04-11 21:58:38,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:38,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:38,328 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 77 treesize of output 76 [2018-04-11 21:58:38,329 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:38,329 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 35 [2018-04-11 21:58:38,329 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:38,337 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:38,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:38,347 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:103, output treesize:101 [2018-04-11 21:58:38,375 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:38,375 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:38,375 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 21:58:38,375 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:38,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:38,385 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:106, output treesize:100 [2018-04-11 21:58:38,415 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 77 treesize of output 83 [2018-04-11 21:58:38,417 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:38,418 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:38,418 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:38,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 82 [2018-04-11 21:58:38,420 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:38,431 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:38,452 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 101 treesize of output 98 [2018-04-11 21:58:38,454 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:38,454 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:38,455 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:38,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 64 [2018-04-11 21:58:38,456 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:38,468 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:38,483 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 21:58:38,484 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:131, output treesize:111 [2018-04-11 21:58:38,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, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 213 treesize of output 224 [2018-04-11 21:58:38,565 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:38,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 4 case distinctions, treesize of input 213 treesize of output 304 [2018-04-11 21:58:38,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-04-11 21:58:38,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 192 treesize of output 191 [2018-04-11 21:58:38,676 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:38,721 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 21:58:38,772 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 0 case distinctions, treesize of input 232 treesize of output 176 [2018-04-11 21:58:38,773 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:38,774 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:38,774 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:38,778 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 120 treesize of output 228 [2018-04-11 21:58:38,778 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:38,792 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:38,805 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 3 case distinctions, treesize of input 219 treesize of output 187 [2018-04-11 21:58:38,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 226 treesize of output 225 [2018-04-11 21:58:38,808 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:38,868 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:38,868 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:38,869 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:38,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 163 treesize of output 259 [2018-04-11 21:58:38,886 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 8 xjuncts. [2018-04-11 21:58:38,990 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-11 21:58:38,995 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 0 case distinctions, treesize of input 232 treesize of output 176 [2018-04-11 21:58:38,997 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:38,998 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:38,998 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:39,001 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 118 treesize of output 228 [2018-04-11 21:58:39,001 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:39,017 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:39,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-11 21:58:39,091 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:241, output treesize:545 [2018-04-11 21:58:39,239 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 151 treesize of output 117 [2018-04-11 21:58:39,241 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:39,241 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 82 treesize of output 50 [2018-04-11 21:58:39,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:39,252 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:39,252 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 10 [2018-04-11 21:58:39,252 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:39,259 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:39,292 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:39,293 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 146 treesize of output 132 [2018-04-11 21:58:39,294 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:39,295 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 97 treesize of output 69 [2018-04-11 21:58:39,295 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:39,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, 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 21:58:39,304 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:39,311 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:39,348 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:39,349 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 142 treesize of output 128 [2018-04-11 21:58:39,350 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:39,351 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 93 treesize of output 65 [2018-04-11 21:58:39,351 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:39,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 21:58:39,360 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:39,366 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:39,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-11 21:58:39,391 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:440, output treesize:228 [2018-04-11 21:58:39,499 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:58:39,516 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 21:58:39,517 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 29 [2018-04-11 21:58:39,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-11 21:58:39,517 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-11 21:58:39,517 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=709, Unknown=0, NotChecked=0, Total=812 [2018-04-11 21:58:39,517 INFO L87 Difference]: Start difference. First operand 837 states and 1072 transitions. Second operand 29 states. [2018-04-11 21:58:41,269 WARN L151 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 133 DAG size of output 75 [2018-04-11 21:58:41,440 WARN L151 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 151 DAG size of output 77 [2018-04-11 21:58:42,937 WARN L151 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 137 DAG size of output 67 [2018-04-11 21:58:43,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 21:58:43,829 INFO L93 Difference]: Finished difference Result 1488 states and 1789 transitions. [2018-04-11 21:58:43,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-04-11 21:58:43,829 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 65 [2018-04-11 21:58:43,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 21:58:43,830 INFO L225 Difference]: With dead ends: 1488 [2018-04-11 21:58:43,830 INFO L226 Difference]: Without dead ends: 1470 [2018-04-11 21:58:43,830 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1058 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=848, Invalid=3312, Unknown=0, NotChecked=0, Total=4160 [2018-04-11 21:58:43,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1470 states. [2018-04-11 21:58:43,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1470 to 892. [2018-04-11 21:58:43,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 892 states. [2018-04-11 21:58:43,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1152 transitions. [2018-04-11 21:58:43,838 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1152 transitions. Word has length 65 [2018-04-11 21:58:43,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 21:58:43,838 INFO L459 AbstractCegarLoop]: Abstraction has 892 states and 1152 transitions. [2018-04-11 21:58:43,838 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-11 21:58:43,839 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1152 transitions. [2018-04-11 21:58:43,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-11 21:58:43,839 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 21:58:43,839 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 21:58:43,839 INFO L408 AbstractCegarLoop]: === Iteration 77 === [mainErr69RequiresViolation, mainErr26RequiresViolation, mainErr66RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr82RequiresViolation, mainErr74RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr12RequiresViolation, mainErr71RequiresViolation, mainErr98AssertViolationMEMORY_FREE, mainErr85RequiresViolation, mainErr55RequiresViolation, mainErr42RequiresViolation, mainErr90RequiresViolation, mainErr63RequiresViolation, mainErr77RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr100EnsuresViolationMEMORY_LEAK, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr84RequiresViolation, mainErr61RequiresViolation, mainErr87RequiresViolation, mainErr97AssertViolationMEMORY_FREE, mainErr21RequiresViolation, mainErr56RequiresViolation, mainErr79RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr95RequiresViolation, mainErr52RequiresViolation, mainErr92AssertViolationMEMORY_FREE, mainErr45RequiresViolation, mainErr22RequiresViolation, mainErr88RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr86RequiresViolation, mainErr96AssertViolationMEMORY_FREE, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr51RequiresViolation, mainErr94RequiresViolation, mainErr54RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr46RequiresViolation, mainErr89RequiresViolation, mainErr91RequiresViolation, mainErr3RequiresViolation, mainErr62RequiresViolation, mainErr49RequiresViolation, mainErr93AssertViolationMEMORY_FREE, mainErr99AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr65RequiresViolation, mainErr70RequiresViolation, mainErr17RequiresViolation, mainErr78RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr76RequiresViolation, mainErr43RequiresViolation, mainErr83RequiresViolation, mainErr36RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr41RequiresViolation, mainErr64RequiresViolation, mainErr72RequiresViolation, mainErr81RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr68RequiresViolation, mainErr75RequiresViolation, mainErr19RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr80RequiresViolation, mainErr67RequiresViolation, mainErr34RequiresViolation, mainErr73RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 21:58:43,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1364275180, now seen corresponding path program 1 times [2018-04-11 21:58:43,840 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 21:58:43,840 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 21:58:43,840 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:58:43,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:58:43,840 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 21:58:43,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:58:43,850 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 21:58:44,317 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 21:58:44,317 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 21:58:44,317 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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 21:58:44,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 21:58:44,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 21:58:44,344 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 21:58:44,362 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:44,363 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:44,363 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 21:58:44,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:44,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:44,364 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:10 [2018-04-11 21:58:44,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 21:58:44,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 21:58:44,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:44,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:44,380 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 21:58:44,380 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-11 21:58:44,407 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 34 treesize of output 28 [2018-04-11 21:58:44,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 21:58:44,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:44,410 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:44,413 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 21:58:44,413 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:21 [2018-04-11 21:58:44,428 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:44,429 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:44,429 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 21:58:44,429 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:44,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:44,432 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:23 [2018-04-11 21:58:44,467 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 24 treesize of output 19 [2018-04-11 21:58:44,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 31 [2018-04-11 21:58:44,473 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 21:58:44,477 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:44,482 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 21:58:44,482 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:34 [2018-04-11 21:58:44,505 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 31 treesize of output 32 [2018-04-11 21:58:44,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 21:58:44,507 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:44,510 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:44,515 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 21:58:44,516 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:41 [2018-04-11 21:58:44,542 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 40 treesize of output 39 [2018-04-11 21:58:44,544 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:44,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, 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 21:58:44,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:44,549 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:44,556 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 21:58:44,556 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:50 [2018-04-11 21:58:44,584 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:44,585 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:44,585 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 21:58:44,585 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:44,591 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 21:58:44,591 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:49 [2018-04-11 21:58:44,621 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 49 treesize of output 46 [2018-04-11 21:58:44,622 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:44,623 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:44,623 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:44,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 46 [2018-04-11 21:58:44,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:44,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:58:44,637 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 21:58:44,637 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:62, output treesize:55 [2018-04-11 21:58:44,704 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 3 case distinctions, treesize of input 100 treesize of output 82 [2018-04-11 21:58:44,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 106 [2018-04-11 21:58:44,706 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:44,727 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:44,727 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:44,728 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:44,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 98 [2018-04-11 21:58:44,744 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 8 xjuncts. [2018-04-11 21:58:44,792 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-11 21:58:44,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2018-04-11 21:58:44,823 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:105, output treesize:251 [2018-04-11 21:58:45,602 WARN L148 SmtUtils]: Spent 688ms on a formula simplification that was a NOOP. DAG size: 83 [2018-04-11 21:58:45,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 67 [2018-04-11 21:58:45,608 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:45,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 61 [2018-04-11 21:58:45,609 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:45,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 75 [2018-04-11 21:58:45,610 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:45,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 67 [2018-04-11 21:58:45,611 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:45,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2018-04-11 21:58:45,644 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:275, output treesize:271 [2018-04-11 21:58:46,363 WARN L148 SmtUtils]: Spent 678ms on a formula simplification that was a NOOP. DAG size: 87 [2018-04-11 21:58:47,081 WARN L148 SmtUtils]: Spent 673ms on a formula simplification that was a NOOP. DAG size: 87 [2018-04-11 21:58:48,086 WARN L148 SmtUtils]: Spent 956ms on a formula simplification that was a NOOP. DAG size: 91 [2018-04-11 21:58:48,092 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:48,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 96 [2018-04-11 21:58:48,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 103 [2018-04-11 21:58:48,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:48,173 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:48,173 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:48,174 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:48,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 109 [2018-04-11 21:58:48,188 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 8 xjuncts. [2018-04-11 21:58:48,253 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-11 21:58:48,352 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:48,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 90 [2018-04-11 21:58:48,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 89 [2018-04-11 21:58:48,366 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:48,402 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:48,412 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 4 case distinctions, treesize of input 59 treesize of output 82 [2018-04-11 21:58:48,413 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-04-11 21:58:48,455 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 21:58:48,584 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:48,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 96 [2018-04-11 21:58:48,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 95 [2018-04-11 21:58:48,597 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:48,626 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:48,637 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 4 case distinctions, treesize of input 65 treesize of output 88 [2018-04-11 21:58:48,637 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-04-11 21:58:48,672 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 21:58:48,801 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:48,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 96 [2018-04-11 21:58:48,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 95 [2018-04-11 21:58:48,814 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 21:58:48,855 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:58:48,865 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 4 case distinctions, treesize of input 65 treesize of output 88 [2018-04-11 21:58:48,865 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 4 xjuncts. [2018-04-11 21:58:48,899 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 21:58:49,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-2 vars, End of recursive call: 17 dim-0 vars, and 13 xjuncts. [2018-04-11 21:58:49,047 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 16 variables, input treesize:343, output treesize:754 [2018-04-11 21:58:56,094 WARN L151 SmtUtils]: Spent 6905ms on a formula simplification. DAG size of input: 166 DAG size of output 138 [2018-04-11 21:59:00,457 WARN L148 SmtUtils]: Spent 4222ms on a formula simplification that was a NOOP. DAG size: 145 [2018-04-11 21:59:00,467 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:00,505 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 3 case distinctions, treesize of input 152 treesize of output 174 [2018-04-11 21:59:00,507 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 169 treesize of output 168 [2018-04-11 21:59:00,507 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:59:00,555 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 140 treesize of output 159 [2018-04-11 21:59:00,556 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 21:59:00,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 21:59:06,095 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 165 treesize of output 156 [2018-04-11 21:59:06,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 21:59:06,097 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 21:59:06,112 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:59:10,180 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 3 case distinctions, treesize of input 155 treesize of output 159 [2018-04-11 21:59:10,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 161 [2018-04-11 21:59:10,182 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 21:59:10,226 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:10,242 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 4 case distinctions, treesize of input 135 treesize of output 182 [2018-04-11 21:59:10,242 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-04-11 21:59:10,300 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 21:59:13,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 143 [2018-04-11 21:59:13,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 21:59:13,655 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 21:59:13,666 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:59:16,805 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:16,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, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 164 [2018-04-11 21:59:16,820 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 159 treesize of output 158 [2018-04-11 21:59:16,820 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 21:59:16,866 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 130 treesize of output 149 [2018-04-11 21:59:16,866 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-04-11 21:59:16,898 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 21:59:19,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 159 [2018-04-11 21:59:19,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 21:59:19,143 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-11 21:59:19,155 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:59:21,172 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:21,184 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 3 case distinctions, treesize of input 148 treesize of output 170 [2018-04-11 21:59:21,187 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 156 treesize of output 163 [2018-04-11 21:59:21,187 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-11 21:59:21,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 138 [2018-04-11 21:59:21,226 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-11 21:59:21,248 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:59:22,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 170 [2018-04-11 21:59:22,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 21:59:22,506 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-11 21:59:22,525 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:59:23,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 152 treesize of output 143 [2018-04-11 21:59:23,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 21:59:23,963 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-11 21:59:23,975 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:59:25,012 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:25,024 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 3 case distinctions, treesize of input 142 treesize of output 164 [2018-04-11 21:59:25,031 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 150 treesize of output 169 [2018-04-11 21:59:25,032 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 2 xjuncts. [2018-04-11 21:59:25,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 132 [2018-04-11 21:59:25,082 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-11 21:59:25,112 INFO L267 ElimStorePlain]: Start of recursive call 24: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 21:59:25,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 171 treesize of output 162 [2018-04-11 21:59:25,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 21:59:25,995 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-11 21:59:26,009 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:59:26,713 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 3 case distinctions, treesize of input 169 treesize of output 165 [2018-04-11 21:59:26,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 175 [2018-04-11 21:59:26,716 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-11 21:59:26,779 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:26,780 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:26,781 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:26,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 141 treesize of output 221 [2018-04-11 21:59:26,799 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 8 xjuncts. [2018-04-11 21:59:26,877 INFO L267 ElimStorePlain]: Start of recursive call 29: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 21:59:27,567 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 3 case distinctions, treesize of input 161 treesize of output 165 [2018-04-11 21:59:27,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 167 [2018-04-11 21:59:27,620 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-04-11 21:59:27,665 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:27,678 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 4 case distinctions, treesize of input 141 treesize of output 188 [2018-04-11 21:59:27,678 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 4 xjuncts. [2018-04-11 21:59:27,744 INFO L267 ElimStorePlain]: Start of recursive call 32: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 21:59:28,349 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 171 treesize of output 162 [2018-04-11 21:59:28,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 21:59:28,352 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-04-11 21:59:28,369 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:59:28,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 158 treesize of output 159 [2018-04-11 21:59:28,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 21:59:28,964 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-04-11 21:59:28,978 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:59:29,478 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 3 case distinctions, treesize of input 161 treesize of output 165 [2018-04-11 21:59:29,480 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:29,491 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 4 case distinctions, treesize of input 151 treesize of output 198 [2018-04-11 21:59:29,492 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 4 xjuncts. [2018-04-11 21:59:29,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 151 [2018-04-11 21:59:29,580 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-04-11 21:59:29,637 INFO L267 ElimStorePlain]: Start of recursive call 39: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 21:59:30,135 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:30,146 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 3 case distinctions, treesize of input 148 treesize of output 170 [2018-04-11 21:59:30,149 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 156 treesize of output 163 [2018-04-11 21:59:30,149 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-04-11 21:59:30,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 138 [2018-04-11 21:59:30,189 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-04-11 21:59:30,209 INFO L267 ElimStorePlain]: Start of recursive call 42: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:59:30,680 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:30,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 144 [2018-04-11 21:59:30,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 21:59:30,684 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-04-11 21:59:30,698 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:59:30,701 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 142 treesize of output 133 [2018-04-11 21:59:30,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 21:59:30,703 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-04-11 21:59:30,713 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 21:59:31,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 15 dim-0 vars, 18 dim-2 vars, End of recursive call: 24 dim-0 vars, and 20 xjuncts. [2018-04-11 21:59:31,122 INFO L202 ElimStorePlain]: Needed 48 recursive calls to eliminate 33 variables, input treesize:1459, output treesize:2574 [2018-04-11 21:59:49,965 WARN L151 SmtUtils]: Spent 18618ms on a formula simplification. DAG size of input: 293 DAG size of output 240 [2018-04-11 21:59:49,997 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:50,078 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:50,079 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:50,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 130 treesize of output 170 [2018-04-11 21:59:50,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 21:59:50,553 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:50,554 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:50,554 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 134 treesize of output 128 [2018-04-11 21:59:50,554 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 21:59:50,999 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:50,999 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:51,000 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 140 treesize of output 134 [2018-04-11 21:59:51,000 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 21:59:51,437 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:51,439 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:51,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 134 treesize of output 164 [2018-04-11 21:59:51,447 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 21:59:51,948 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:51,951 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:51,951 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 136 treesize of output 130 [2018-04-11 21:59:51,951 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 21:59:52,445 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:52,446 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:52,446 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 140 treesize of output 134 [2018-04-11 21:59:52,446 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 21:59:52,945 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:52,946 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:52,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 140 [2018-04-11 21:59:52,947 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 21:59:53,423 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:53,426 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:53,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 134 treesize of output 164 [2018-04-11 21:59:53,433 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-04-11 21:59:53,939 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:53,939 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:53,940 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 141 treesize of output 135 [2018-04-11 21:59:53,940 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 21:59:54,444 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:54,445 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:54,445 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 140 treesize of output 134 [2018-04-11 21:59:54,445 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 21:59:54,960 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:54,961 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:54,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 135 treesize of output 203 [2018-04-11 21:59:54,966 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-04-11 21:59:55,534 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:55,536 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:55,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 140 treesize of output 170 [2018-04-11 21:59:55,543 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-04-11 21:59:56,128 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:56,130 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:56,131 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:56,131 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:56,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 130 treesize of output 180 [2018-04-11 21:59:56,139 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-04-11 21:59:56,741 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:56,744 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:56,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 134 treesize of output 164 [2018-04-11 21:59:56,751 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-04-11 21:59:57,401 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:57,401 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:57,402 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 146 treesize of output 140 [2018-04-11 21:59:57,402 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-11 21:59:58,000 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:58,003 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:58,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 130 treesize of output 160 [2018-04-11 21:59:58,010 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-04-11 21:59:58,640 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:58,641 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:58,641 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 148 treesize of output 142 [2018-04-11 21:59:58,642 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-11 21:59:59,278 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:59,279 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:59,279 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 135 treesize of output 129 [2018-04-11 21:59:59,280 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-11 21:59:59,281 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:59,281 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:59,282 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 129 treesize of output 123 [2018-04-11 21:59:59,282 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-11 21:59:59,909 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:59,910 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 21:59:59,910 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 141 treesize of output 135 [2018-04-11 21:59:59,910 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-11 22:00:00,534 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:00:00,535 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:00:00,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 135 treesize of output 203 [2018-04-11 22:00:00,539 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 2 xjuncts. [2018-04-11 22:00:01,208 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:00:01,210 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:00:01,211 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:00:01,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 140 treesize of output 180 [2018-04-11 22:00:01,218 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 2 xjuncts. [2018-04-11 22:00:02,037 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:00:02,038 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:00:02,038 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 140 treesize of output 134 [2018-04-11 22:00:02,038 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-11 22:00:02,896 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:00:02,898 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:00:02,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 134 treesize of output 164 [2018-04-11 22:00:02,907 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 2 xjuncts. [2018-04-11 22:00:03,625 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:00:03,625 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:00:03,626 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 149 treesize of output 143 [2018-04-11 22:00:03,626 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-11 22:00:03,627 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:00:03,628 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:00:03,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, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 139 [2018-04-11 22:00:03,628 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-11 22:00:04,329 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:00:04,330 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:00:04,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 124 [2018-04-11 22:00:04,330 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-11 22:00:05,030 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:00:05,031 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:00:05,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 130 [2018-04-11 22:00:05,031 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-11 22:00:05,746 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:00:05,749 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:00:05,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 124 treesize of output 154 [2018-04-11 22:00:05,756 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 2 xjuncts. [2018-04-11 22:00:06,475 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:00:06,477 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:00:06,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 128 treesize of output 158 [2018-04-11 22:00:06,484 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 2 xjuncts. [2018-04-11 22:00:07,224 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:00:07,225 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:00:07,225 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 135 treesize of output 129 [2018-04-11 22:00:07,225 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-04-11 22:00:07,227 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:00:07,227 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:00:07,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 123 [2018-04-11 22:00:07,228 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-04-11 22:00:07,966 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:00:07,968 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:00:07,969 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:00:07,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 130 treesize of output 170 [2018-04-11 22:00:07,976 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 2 xjuncts. [2018-04-11 22:00:08,744 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:00:08,747 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:00:08,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 140 treesize of output 170 [2018-04-11 22:00:08,754 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 2 xjuncts. [2018-04-11 22:00:09,540 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:00:09,543 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:00:09,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 172 [2018-04-11 22:00:09,550 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 2 xjuncts. [2018-04-11 22:00:10,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 36 dim-0 vars, 32 dim-1 vars, End of recursive call: 56 dim-0 vars, and 32 xjuncts. [2018-04-11 22:00:10,316 INFO L202 ElimStorePlain]: Needed 36 recursive calls to eliminate 68 variables, input treesize:2219, output treesize:4371 Received shutdown request... [2018-04-11 22:00:19,966 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-11 22:00:19,966 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-11 22:00:19,969 WARN L197 ceAbstractionStarter]: Timeout [2018-04-11 22:00:19,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 10:00:19 BoogieIcfgContainer [2018-04-11 22:00:19,969 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 22:00:19,970 INFO L168 Benchmark]: Toolchain (without parser) took 826248.59 ms. Allocated memory was 330.8 MB in the beginning and 333.4 MB in the end (delta: 2.6 MB). Free memory was 273.3 MB in the beginning and 208.0 MB in the end (delta: 65.3 MB). Peak memory consumption was 104.2 MB. Max. memory is 5.3 GB. [2018-04-11 22:00:19,971 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 330.8 MB. Free memory is still 299.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 22:00:19,972 INFO L168 Benchmark]: CACSL2BoogieTranslator took 278.06 ms. Allocated memory is still 330.8 MB. Free memory was 273.3 MB in the beginning and 246.2 MB in the end (delta: 27.1 MB). Peak memory consumption was 27.1 MB. Max. memory is 5.3 GB. [2018-04-11 22:00:19,972 INFO L168 Benchmark]: Boogie Preprocessor took 44.57 ms. Allocated memory is still 330.8 MB. Free memory was 246.2 MB in the beginning and 243.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-11 22:00:19,972 INFO L168 Benchmark]: RCFGBuilder took 623.53 ms. Allocated memory was 330.8 MB in the beginning and 429.9 MB in the end (delta: 99.1 MB). Free memory was 243.6 MB in the beginning and 329.0 MB in the end (delta: -85.4 MB). Peak memory consumption was 34.8 MB. Max. memory is 5.3 GB. [2018-04-11 22:00:19,972 INFO L168 Benchmark]: TraceAbstraction took 825299.47 ms. Allocated memory was 429.9 MB in the beginning and 333.4 MB in the end (delta: -96.5 MB). Free memory was 329.0 MB in the beginning and 208.0 MB in the end (delta: 121.0 MB). Peak memory consumption was 60.7 MB. Max. memory is 5.3 GB. [2018-04-11 22:00:19,974 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.10 ms. Allocated memory is still 330.8 MB. Free memory is still 299.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 278.06 ms. Allocated memory is still 330.8 MB. Free memory was 273.3 MB in the beginning and 246.2 MB in the end (delta: 27.1 MB). Peak memory consumption was 27.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 44.57 ms. Allocated memory is still 330.8 MB. Free memory was 246.2 MB in the beginning and 243.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 623.53 ms. Allocated memory was 330.8 MB in the beginning and 429.9 MB in the end (delta: 99.1 MB). Free memory was 243.6 MB in the beginning and 329.0 MB in the end (delta: -85.4 MB). Peak memory consumption was 34.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 825299.47 ms. Allocated memory was 429.9 MB in the beginning and 333.4 MB in the end (delta: -96.5 MB). Free memory was 329.0 MB in the beginning and 208.0 MB in the end (delta: 121.0 MB). Peak memory consumption was 60.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 698]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 698). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 652]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 694]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 694). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 718]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 718). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 709]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 709). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 660]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 656]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 656). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 682]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 682). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 703]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 703). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 723]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 723). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 718]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 718). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 681]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 676]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 676). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 719]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 719). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 689]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 689). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 716]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 677]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 637]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 681]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 630]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 630). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 668]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 668). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 637]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 718]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 718). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 689]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 689). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 719]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 719). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 722]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 722). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 682]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 682). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 716]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 677]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 674]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 674). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 722]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 722). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 681]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 720]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 720). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 677]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 719]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 719). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 689]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 689). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 681]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 719]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 719). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 722]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 722). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 677]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 681]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 722]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 722). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 681]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 681). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 674]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 674). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 635]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 677]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 719]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 719). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 719]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 719). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 636]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 689]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 689). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 677]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 720]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 720). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 723]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 723). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 665]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 692]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 692). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 703]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 703). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 716]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 660]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 682]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 682). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 716]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 676]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 676). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 718]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 718). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 668]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 668). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 682]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 682). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 656]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 656). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 663]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 675]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 675). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 692]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 692). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 705]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 705). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 716]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 636]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 698]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 698). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 709]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 709). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 663]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 652]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 652). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 635]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 635). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 716]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 716). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 694]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 694). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 665]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 705]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 705). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - TimeoutResultAtElement [Line: 675]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 675). Cancelled while BasicCegarLoop was analyzing trace of length 66 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 537. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 226 locations, 101 error locations. TIMEOUT Result, 825.2s OverallTime, 77 OverallIterations, 3 TraceHistogramMax, 432.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 14507 SDtfs, 83309 SDslu, 93756 SDs, 0 SdLazy, 96796 SolverSat, 6542 SolverUnsat, 125 SolverUnknown, 0 SolverNotchecked, 144.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3371 GetRequests, 1155 SyntacticMatches, 72 SemanticMatches, 2144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31537 ImplicationChecksByTransitivity, 365.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=892occurred in iteration=76, 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.3s AutomataMinimizationTime, 76 MinimizatonAttempts, 22882 StatesRemovedByMinimization, 67 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 293.6s InterpolantComputationTime, 4590 NumberOfCodeBlocks, 4590 NumberOfCodeBlocksAsserted, 102 NumberOfCheckSat, 4488 ConstructedInterpolants, 395 QuantifiedInterpolants, 7423788 SizeOfPredicates, 555 NumberOfNonLiveVariables, 6030 ConjunctsInSsa, 1149 ConjunctsInUnsatCore, 102 InterpolantComputations, 54 PerfectInterpolantSequences, 88/294 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_of_cslls_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_22-00-19-979.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_of_cslls_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_22-00-19-979.csv Completed graceful shutdown