java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/memsafety-ext/tree_stack_true-valid-memsafety_false-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-408c70d-m [2018-04-13 06:37:05,433 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-13 06:37:05,434 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-13 06:37:05,446 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-13 06:37:05,446 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-13 06:37:05,447 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-13 06:37:05,448 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-13 06:37:05,449 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-13 06:37:05,451 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-13 06:37:05,451 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-13 06:37:05,452 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-13 06:37:05,452 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-13 06:37:05,453 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-13 06:37:05,454 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-13 06:37:05,455 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-13 06:37:05,457 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-13 06:37:05,458 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-13 06:37:05,460 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-13 06:37:05,461 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-13 06:37:05,462 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-13 06:37:05,463 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-13 06:37:05,463 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-13 06:37:05,464 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-13 06:37:05,465 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-13 06:37:05,465 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-13 06:37:05,466 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-13 06:37:05,466 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-13 06:37:05,467 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-13 06:37:05,468 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-13 06:37:05,468 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-13 06:37:05,468 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-13 06:37:05,469 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-04-13 06:37:05,479 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-13 06:37:05,479 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-13 06:37:05,480 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-13 06:37:05,480 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-13 06:37:05,480 INFO L133 SettingsManager]: * Use SBE=true [2018-04-13 06:37:05,480 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-13 06:37:05,481 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-13 06:37:05,481 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-13 06:37:05,481 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-13 06:37:05,481 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-13 06:37:05,481 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-13 06:37:05,481 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-13 06:37:05,482 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-13 06:37:05,482 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-13 06:37:05,482 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-13 06:37:05,482 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-13 06:37:05,482 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-13 06:37:05,482 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-13 06:37:05,483 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-13 06:37:05,483 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-13 06:37:05,483 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-13 06:37:05,483 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-13 06:37:05,483 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-13 06:37:05,483 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-13 06:37:05,513 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-13 06:37:05,523 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-13 06:37:05,526 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-13 06:37:05,527 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-13 06:37:05,527 INFO L276 PluginConnector]: CDTParser initialized [2018-04-13 06:37:05,528 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext/tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:05,823 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGab8e352dc [2018-04-13 06:37:06,011 INFO L287 CDTParser]: IsIndexed: true [2018-04-13 06:37:06,011 INFO L288 CDTParser]: Found 1 translation units. [2018-04-13 06:37:06,012 INFO L168 CDTParser]: Scanning tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,020 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-13 06:37:06,021 INFO L215 ultiparseSymbolTable]: [2018-04-13 06:37:06,021 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-13 06:37:06,021 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,021 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-13 06:37:06,021 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__key_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,021 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__pthread_mutex_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,021 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____u_short in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,022 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____rlim_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,022 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__size_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,022 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____intptr_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,022 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____int32_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,022 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__time_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,022 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____ssize_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,022 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__mode_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,022 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____socklen_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,022 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____uint32_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,022 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__pid_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,023 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__int32_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,023 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__fd_set in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,023 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__pthread_rwlock_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,023 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__fsfilcnt_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,023 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__off_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,023 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__gid_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,023 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____blkcnt64_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,023 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__div_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,023 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__blksize_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,023 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__u_short in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,024 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__caddr_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,024 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____mode_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,024 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__ssize_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,024 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__u_int32_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,024 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____uint64_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,024 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____fsblkcnt64_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,024 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____uid_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,024 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__pthread_once_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,024 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__u_char in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,024 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__pthread_attr_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,024 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____fd_mask in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,024 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__blkcnt_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,024 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__timer_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,025 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____sig_atomic_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,025 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__lldiv_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,025 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__uid_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,025 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____nlink_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,025 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__int16_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,025 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____pthread_list_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,025 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__u_int8_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,025 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__wchar_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,025 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__pthread_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,025 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____id_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,025 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__fsblkcnt_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,025 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____u_char in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,025 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____off64_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,026 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____suseconds_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,026 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____gid_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,026 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____quad_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,026 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____timer_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,026 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____pid_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,026 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__u_int in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,026 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__pthread_mutexattr_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,026 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____loff_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,026 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__suseconds_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,026 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__int64_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,027 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____sigset_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,027 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__fd_mask in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,027 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____WAIT_STATUS in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,027 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__fsid_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,027 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__ushort in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,027 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__u_int16_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,027 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__pthread_cond_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,027 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____u_quad_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,027 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____blkcnt_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,027 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____clock_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,027 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____clockid_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,028 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__clockid_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,028 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__u_long in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,028 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__pthread_barrier_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,028 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____off_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,028 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__quad_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,028 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__id_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,028 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__clock_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,028 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__uint in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,028 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____u_int in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,028 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__nlink_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,029 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____fsid_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,029 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____int16_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,029 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__dev_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,029 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__pthread_rwlockattr_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,029 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____u_long in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,029 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____ino64_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,029 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__pthread_spinlock_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,029 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__sigset_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,029 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____ino_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,029 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____swblk_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,029 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__u_quad_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,029 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__ulong in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,030 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____caddr_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,030 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____int8_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,030 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__pthread_key_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,030 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____dev_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,030 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____fsblkcnt_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,030 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__register_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,030 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__pthread_barrierattr_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,030 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____fsfilcnt64_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,030 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__loff_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,030 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__pthread_condattr_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,030 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__ino_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,030 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__daddr_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,030 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____useconds_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,030 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__u_int64_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,030 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__ldiv_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,030 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____key_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,030 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____int64_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,031 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____daddr_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,031 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____uint8_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,031 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____blksize_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,031 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____time_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,031 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i__int8_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,031 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____uint16_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,031 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____qaddr_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,031 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____rlim64_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,031 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftree_stack_true_valid_memsafety_false_termination_i____fsfilcnt_t in tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,075 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGab8e352dc [2018-04-13 06:37:06,078 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-13 06:37:06,079 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-13 06:37:06,079 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-13 06:37:06,080 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-13 06:37:06,083 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-13 06:37:06,084 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:37:06" (1/1) ... [2018-04-13 06:37:06,085 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3811463b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:37:06, skipping insertion in model container [2018-04-13 06:37:06,086 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 06:37:06" (1/1) ... [2018-04-13 06:37:06,097 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 06:37:06,120 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 06:37:06,247 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 06:37:06,284 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 06:37:06,290 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 110 non ball SCCs. Number of states in SCCs 110. [2018-04-13 06:37:06,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:37:06 WrapperNode [2018-04-13 06:37:06,318 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-13 06:37:06,319 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-13 06:37:06,319 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-13 06:37:06,319 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-13 06:37:06,327 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:37:06" (1/1) ... [2018-04-13 06:37:06,327 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:37:06" (1/1) ... [2018-04-13 06:37:06,339 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:37:06" (1/1) ... [2018-04-13 06:37:06,340 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:37:06" (1/1) ... [2018-04-13 06:37:06,349 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:37:06" (1/1) ... [2018-04-13 06:37:06,354 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:37:06" (1/1) ... [2018-04-13 06:37:06,356 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:37:06" (1/1) ... [2018-04-13 06:37:06,360 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-13 06:37:06,360 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-13 06:37:06,360 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-13 06:37:06,360 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-13 06:37:06,361 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:37:06" (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-13 06:37:06,440 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-13 06:37:06,440 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-13 06:37:06,440 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-13 06:37:06,440 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-13 06:37:06,440 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-13 06:37:06,440 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-13 06:37:06,440 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-13 06:37:06,440 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-13 06:37:06,440 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-13 06:37:06,441 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-13 06:37:06,441 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-13 06:37:06,441 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-13 06:37:06,441 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-13 06:37:06,441 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-13 06:37:06,441 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-13 06:37:06,441 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-13 06:37:06,441 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-13 06:37:06,441 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-13 06:37:06,442 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-13 06:37:06,442 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-13 06:37:06,442 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-13 06:37:06,442 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-13 06:37:06,442 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-13 06:37:06,442 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-13 06:37:06,442 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-13 06:37:06,442 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-13 06:37:06,442 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-13 06:37:06,443 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-13 06:37:06,443 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-13 06:37:06,443 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-13 06:37:06,443 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-13 06:37:06,443 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-13 06:37:06,443 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-13 06:37:06,443 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-13 06:37:06,443 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-13 06:37:06,443 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-13 06:37:06,443 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-13 06:37:06,444 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-13 06:37:06,444 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-13 06:37:06,444 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-13 06:37:06,444 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-13 06:37:06,444 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-13 06:37:06,444 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-13 06:37:06,444 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-13 06:37:06,444 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-13 06:37:06,444 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-13 06:37:06,444 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-13 06:37:06,445 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-13 06:37:06,445 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-13 06:37:06,445 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-13 06:37:06,445 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-13 06:37:06,445 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-13 06:37:06,445 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-13 06:37:06,445 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-13 06:37:06,445 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-13 06:37:06,445 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-13 06:37:06,445 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-13 06:37:06,446 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-13 06:37:06,446 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-13 06:37:06,446 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-13 06:37:06,446 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-13 06:37:06,446 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-13 06:37:06,446 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-13 06:37:06,446 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-13 06:37:06,446 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-13 06:37:06,446 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-13 06:37:06,446 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-13 06:37:06,447 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-13 06:37:06,447 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-13 06:37:06,447 INFO L128 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-04-13 06:37:06,447 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-13 06:37:06,447 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-13 06:37:06,447 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-13 06:37:06,447 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-13 06:37:06,447 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-13 06:37:06,447 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-13 06:37:06,447 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-13 06:37:06,447 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-13 06:37:06,447 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-13 06:37:06,447 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-13 06:37:06,447 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-13 06:37:06,447 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-13 06:37:06,448 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-13 06:37:06,448 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-13 06:37:06,448 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-13 06:37:06,448 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-13 06:37:06,448 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-13 06:37:06,448 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-13 06:37:06,448 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-13 06:37:06,448 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-13 06:37:06,448 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-13 06:37:06,448 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-13 06:37:06,448 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-13 06:37:06,448 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-13 06:37:06,448 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-13 06:37:06,448 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-13 06:37:06,448 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-13 06:37:06,448 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-13 06:37:06,448 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-13 06:37:06,449 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-13 06:37:06,449 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-13 06:37:06,449 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-13 06:37:06,449 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-13 06:37:06,449 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-13 06:37:06,449 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-13 06:37:06,449 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-13 06:37:06,449 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-13 06:37:06,449 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-13 06:37:06,449 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-13 06:37:06,449 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-13 06:37:06,449 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-13 06:37:06,449 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-13 06:37:06,449 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-13 06:37:06,909 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-13 06:37:06,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:37:06 BoogieIcfgContainer [2018-04-13 06:37:06,909 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-13 06:37:06,910 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-13 06:37:06,910 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-13 06:37:06,912 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-13 06:37:06,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 06:37:06" (1/3) ... [2018-04-13 06:37:06,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4244c274 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:37:06, skipping insertion in model container [2018-04-13 06:37:06,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 06:37:06" (2/3) ... [2018-04-13 06:37:06,913 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4244c274 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 06:37:06, skipping insertion in model container [2018-04-13 06:37:06,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 06:37:06" (3/3) ... [2018-04-13 06:37:06,914 INFO L107 eAbstractionObserver]: Analyzing ICFG tree_stack_true-valid-memsafety_false-termination.i [2018-04-13 06:37:06,920 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-13 06:37:06,926 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 65 error locations. [2018-04-13 06:37:06,955 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-13 06:37:06,956 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-13 06:37:06,956 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-13 06:37:06,956 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-13 06:37:06,956 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-13 06:37:06,956 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-13 06:37:06,957 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-13 06:37:06,957 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-13 06:37:06,957 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-13 06:37:06,957 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-13 06:37:06,971 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states. [2018-04-13 06:37:06,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-13 06:37:06,979 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:37:06,980 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:37:06,980 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:37:06,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1341836454, now seen corresponding path program 1 times [2018-04-13 06:37:06,984 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:37:06,984 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:37:07,021 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:07,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:37:07,021 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:07,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:37:07,055 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:37:07,107 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-13 06:37:07,108 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:37:07,109 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 06:37:07,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 06:37:07,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 06:37:07,119 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 06:37:07,120 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 4 states. [2018-04-13 06:37:07,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:37:07,413 INFO L93 Difference]: Finished difference Result 168 states and 179 transitions. [2018-04-13 06:37:07,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 06:37:07,415 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-13 06:37:07,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:37:07,424 INFO L225 Difference]: With dead ends: 168 [2018-04-13 06:37:07,424 INFO L226 Difference]: Without dead ends: 164 [2018-04-13 06:37:07,426 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-13 06:37:07,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-04-13 06:37:07,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 146. [2018-04-13 06:37:07,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-04-13 06:37:07,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 156 transitions. [2018-04-13 06:37:07,461 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 156 transitions. Word has length 8 [2018-04-13 06:37:07,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:37:07,462 INFO L459 AbstractCegarLoop]: Abstraction has 146 states and 156 transitions. [2018-04-13 06:37:07,462 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 06:37:07,462 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 156 transitions. [2018-04-13 06:37:07,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-13 06:37:07,462 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:37:07,462 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:37:07,462 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:37:07,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1341836455, now seen corresponding path program 1 times [2018-04-13 06:37:07,463 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:37:07,463 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:37:07,463 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:07,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:37:07,464 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:07,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:37:07,476 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:37:07,503 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-13 06:37:07,606 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:37:07,606 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 06:37:07,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 06:37:07,608 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 06:37:07,608 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 06:37:07,608 INFO L87 Difference]: Start difference. First operand 146 states and 156 transitions. Second operand 4 states. [2018-04-13 06:37:07,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:37:07,696 INFO L93 Difference]: Finished difference Result 144 states and 154 transitions. [2018-04-13 06:37:07,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 06:37:07,696 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-13 06:37:07,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:37:07,697 INFO L225 Difference]: With dead ends: 144 [2018-04-13 06:37:07,697 INFO L226 Difference]: Without dead ends: 144 [2018-04-13 06:37:07,698 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-13 06:37:07,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-04-13 06:37:07,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-04-13 06:37:07,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-04-13 06:37:07,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 154 transitions. [2018-04-13 06:37:07,706 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 154 transitions. Word has length 8 [2018-04-13 06:37:07,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:37:07,706 INFO L459 AbstractCegarLoop]: Abstraction has 144 states and 154 transitions. [2018-04-13 06:37:07,706 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 06:37:07,706 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 154 transitions. [2018-04-13 06:37:07,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-13 06:37:07,707 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:37:07,707 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:37:07,707 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:37:07,707 INFO L82 PathProgramCache]: Analyzing trace with hash -2000274829, now seen corresponding path program 1 times [2018-04-13 06:37:07,707 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:37:07,708 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:37:07,708 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:07,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:37:07,709 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:07,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:37:07,720 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:37:07,740 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-13 06:37:07,740 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:37:07,741 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 06:37:07,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 06:37:07,741 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 06:37:07,741 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 06:37:07,742 INFO L87 Difference]: Start difference. First operand 144 states and 154 transitions. Second operand 4 states. [2018-04-13 06:37:07,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:37:07,846 INFO L93 Difference]: Finished difference Result 154 states and 165 transitions. [2018-04-13 06:37:07,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 06:37:07,847 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-04-13 06:37:07,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:37:07,848 INFO L225 Difference]: With dead ends: 154 [2018-04-13 06:37:07,848 INFO L226 Difference]: Without dead ends: 154 [2018-04-13 06:37:07,848 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-13 06:37:07,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-04-13 06:37:07,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 131. [2018-04-13 06:37:07,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-04-13 06:37:07,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 142 transitions. [2018-04-13 06:37:07,854 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 142 transitions. Word has length 14 [2018-04-13 06:37:07,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:37:07,855 INFO L459 AbstractCegarLoop]: Abstraction has 131 states and 142 transitions. [2018-04-13 06:37:07,855 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 06:37:07,855 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 142 transitions. [2018-04-13 06:37:07,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-13 06:37:07,855 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:37:07,855 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:37:07,855 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:37:07,856 INFO L82 PathProgramCache]: Analyzing trace with hash -2000274828, now seen corresponding path program 1 times [2018-04-13 06:37:07,856 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:37:07,856 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:37:07,857 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:07,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:37:07,857 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:07,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:37:07,869 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:37:07,913 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-13 06:37:07,913 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:37:07,913 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 06:37:07,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 06:37:07,914 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 06:37:07,914 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 06:37:07,914 INFO L87 Difference]: Start difference. First operand 131 states and 142 transitions. Second operand 5 states. [2018-04-13 06:37:08,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:37:08,056 INFO L93 Difference]: Finished difference Result 177 states and 195 transitions. [2018-04-13 06:37:08,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 06:37:08,056 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-04-13 06:37:08,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:37:08,059 INFO L225 Difference]: With dead ends: 177 [2018-04-13 06:37:08,059 INFO L226 Difference]: Without dead ends: 177 [2018-04-13 06:37:08,059 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-13 06:37:08,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-04-13 06:37:08,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 161. [2018-04-13 06:37:08,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-04-13 06:37:08,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 184 transitions. [2018-04-13 06:37:08,066 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 184 transitions. Word has length 14 [2018-04-13 06:37:08,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:37:08,067 INFO L459 AbstractCegarLoop]: Abstraction has 161 states and 184 transitions. [2018-04-13 06:37:08,067 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 06:37:08,067 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 184 transitions. [2018-04-13 06:37:08,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-13 06:37:08,067 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:37:08,067 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:37:08,067 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:37:08,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1882745265, now seen corresponding path program 1 times [2018-04-13 06:37:08,068 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:37:08,068 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:37:08,069 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:08,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:37:08,069 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:08,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:37:08,078 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:37:08,097 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-13 06:37:08,097 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:37:08,097 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 06:37:08,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 06:37:08,098 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 06:37:08,098 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 06:37:08,098 INFO L87 Difference]: Start difference. First operand 161 states and 184 transitions. Second operand 4 states. [2018-04-13 06:37:08,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:37:08,184 INFO L93 Difference]: Finished difference Result 176 states and 199 transitions. [2018-04-13 06:37:08,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 06:37:08,184 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-04-13 06:37:08,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:37:08,185 INFO L225 Difference]: With dead ends: 176 [2018-04-13 06:37:08,185 INFO L226 Difference]: Without dead ends: 176 [2018-04-13 06:37:08,185 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-13 06:37:08,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-04-13 06:37:08,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 162. [2018-04-13 06:37:08,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-04-13 06:37:08,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 187 transitions. [2018-04-13 06:37:08,190 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 187 transitions. Word has length 16 [2018-04-13 06:37:08,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:37:08,191 INFO L459 AbstractCegarLoop]: Abstraction has 162 states and 187 transitions. [2018-04-13 06:37:08,191 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 06:37:08,191 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 187 transitions. [2018-04-13 06:37:08,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-13 06:37:08,191 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:37:08,191 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:37:08,191 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:37:08,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1882745266, now seen corresponding path program 1 times [2018-04-13 06:37:08,191 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:37:08,191 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:37:08,192 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:08,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:37:08,192 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:08,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:37:08,201 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:37:08,223 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-13 06:37:08,223 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:37:08,223 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 06:37:08,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 06:37:08,223 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 06:37:08,223 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 06:37:08,224 INFO L87 Difference]: Start difference. First operand 162 states and 187 transitions. Second operand 4 states. [2018-04-13 06:37:08,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:37:08,314 INFO L93 Difference]: Finished difference Result 164 states and 187 transitions. [2018-04-13 06:37:08,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 06:37:08,314 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-04-13 06:37:08,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:37:08,315 INFO L225 Difference]: With dead ends: 164 [2018-04-13 06:37:08,315 INFO L226 Difference]: Without dead ends: 164 [2018-04-13 06:37:08,315 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-13 06:37:08,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-04-13 06:37:08,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 160. [2018-04-13 06:37:08,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-04-13 06:37:08,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 184 transitions. [2018-04-13 06:37:08,318 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 184 transitions. Word has length 16 [2018-04-13 06:37:08,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:37:08,318 INFO L459 AbstractCegarLoop]: Abstraction has 160 states and 184 transitions. [2018-04-13 06:37:08,318 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 06:37:08,318 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 184 transitions. [2018-04-13 06:37:08,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-13 06:37:08,319 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:37:08,319 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] [2018-04-13 06:37:08,319 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:37:08,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1407261537, now seen corresponding path program 1 times [2018-04-13 06:37:08,320 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:37:08,320 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:37:08,320 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:08,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:37:08,321 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:08,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:37:08,329 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:37:08,345 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-13 06:37:08,346 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:37:08,346 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 06:37:08,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 06:37:08,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 06:37:08,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 06:37:08,346 INFO L87 Difference]: Start difference. First operand 160 states and 184 transitions. Second operand 4 states. [2018-04-13 06:37:08,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:37:08,359 INFO L93 Difference]: Finished difference Result 161 states and 184 transitions. [2018-04-13 06:37:08,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 06:37:08,359 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-04-13 06:37:08,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:37:08,360 INFO L225 Difference]: With dead ends: 161 [2018-04-13 06:37:08,360 INFO L226 Difference]: Without dead ends: 161 [2018-04-13 06:37:08,360 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-13 06:37:08,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-04-13 06:37:08,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2018-04-13 06:37:08,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-04-13 06:37:08,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 183 transitions. [2018-04-13 06:37:08,363 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 183 transitions. Word has length 21 [2018-04-13 06:37:08,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:37:08,363 INFO L459 AbstractCegarLoop]: Abstraction has 160 states and 183 transitions. [2018-04-13 06:37:08,363 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 06:37:08,363 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 183 transitions. [2018-04-13 06:37:08,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-13 06:37:08,364 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:37:08,364 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-13 06:37:08,364 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:37:08,364 INFO L82 PathProgramCache]: Analyzing trace with hash 675431961, now seen corresponding path program 1 times [2018-04-13 06:37:08,365 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:37:08,365 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:37:08,365 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:08,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:37:08,365 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:08,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:37:08,375 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:37:08,399 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-13 06:37:08,399 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:37:08,399 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 06:37:08,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 06:37:08,400 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 06:37:08,400 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-13 06:37:08,400 INFO L87 Difference]: Start difference. First operand 160 states and 183 transitions. Second operand 5 states. [2018-04-13 06:37:08,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:37:08,474 INFO L93 Difference]: Finished difference Result 177 states and 201 transitions. [2018-04-13 06:37:08,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 06:37:08,474 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-04-13 06:37:08,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:37:08,475 INFO L225 Difference]: With dead ends: 177 [2018-04-13 06:37:08,475 INFO L226 Difference]: Without dead ends: 177 [2018-04-13 06:37:08,475 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-04-13 06:37:08,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-04-13 06:37:08,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 159. [2018-04-13 06:37:08,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-04-13 06:37:08,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 183 transitions. [2018-04-13 06:37:08,478 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 183 transitions. Word has length 22 [2018-04-13 06:37:08,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:37:08,479 INFO L459 AbstractCegarLoop]: Abstraction has 159 states and 183 transitions. [2018-04-13 06:37:08,479 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 06:37:08,479 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 183 transitions. [2018-04-13 06:37:08,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-13 06:37:08,479 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:37:08,480 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-13 06:37:08,480 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:37:08,480 INFO L82 PathProgramCache]: Analyzing trace with hash 675431962, now seen corresponding path program 1 times [2018-04-13 06:37:08,480 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:37:08,480 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:37:08,481 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:08,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:37:08,481 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:08,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:37:08,491 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:37:08,526 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-13 06:37:08,526 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:37:08,526 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 06:37:08,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 06:37:08,526 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 06:37:08,526 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 06:37:08,527 INFO L87 Difference]: Start difference. First operand 159 states and 183 transitions. Second operand 5 states. [2018-04-13 06:37:08,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:37:08,663 INFO L93 Difference]: Finished difference Result 183 states and 208 transitions. [2018-04-13 06:37:08,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 06:37:08,663 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-04-13 06:37:08,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:37:08,664 INFO L225 Difference]: With dead ends: 183 [2018-04-13 06:37:08,664 INFO L226 Difference]: Without dead ends: 183 [2018-04-13 06:37:08,664 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-13 06:37:08,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-04-13 06:37:08,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 161. [2018-04-13 06:37:08,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-04-13 06:37:08,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 184 transitions. [2018-04-13 06:37:08,666 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 184 transitions. Word has length 22 [2018-04-13 06:37:08,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:37:08,666 INFO L459 AbstractCegarLoop]: Abstraction has 161 states and 184 transitions. [2018-04-13 06:37:08,667 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 06:37:08,667 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 184 transitions. [2018-04-13 06:37:08,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-13 06:37:08,667 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:37:08,667 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] [2018-04-13 06:37:08,668 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:37:08,668 INFO L82 PathProgramCache]: Analyzing trace with hash -684849302, now seen corresponding path program 1 times [2018-04-13 06:37:08,668 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:37:08,668 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:37:08,669 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:08,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:37:08,669 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:08,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:37:08,677 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:37:08,688 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-13 06:37:08,688 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:37:08,688 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 06:37:08,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-13 06:37:08,689 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-13 06:37:08,689 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 06:37:08,689 INFO L87 Difference]: Start difference. First operand 161 states and 184 transitions. Second operand 3 states. [2018-04-13 06:37:08,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:37:08,699 INFO L93 Difference]: Finished difference Result 163 states and 186 transitions. [2018-04-13 06:37:08,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-13 06:37:08,699 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-04-13 06:37:08,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:37:08,700 INFO L225 Difference]: With dead ends: 163 [2018-04-13 06:37:08,700 INFO L226 Difference]: Without dead ends: 163 [2018-04-13 06:37:08,700 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-13 06:37:08,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-04-13 06:37:08,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-04-13 06:37:08,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-04-13 06:37:08,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 186 transitions. [2018-04-13 06:37:08,705 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 186 transitions. Word has length 22 [2018-04-13 06:37:08,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:37:08,705 INFO L459 AbstractCegarLoop]: Abstraction has 163 states and 186 transitions. [2018-04-13 06:37:08,705 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-13 06:37:08,706 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 186 transitions. [2018-04-13 06:37:08,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-13 06:37:08,706 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:37:08,706 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:37:08,706 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:37:08,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1056809095, now seen corresponding path program 1 times [2018-04-13 06:37:08,708 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:37:08,708 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:37:08,709 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:08,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:37:08,709 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:08,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:37:08,720 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:37:08,725 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:37:08,725 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:37:08,725 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:37:08,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:37:08,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:37:08,758 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:37:08,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 06:37:08,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:37:08,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:37:08,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:37:08,812 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-13 06:37:08,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 10 treesize of output 9 [2018-04-13 06:37:08,815 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:37:08,816 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:37:08,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:37:08,820 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2018-04-13 06:37:08,840 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-13 06:37:08,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-13 06:37:08,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:37:08,858 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:37:08,883 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-13 06:37:08,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-13 06:37:08,889 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:37:08,891 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:37:08,893 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-13 06:37:08,894 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:37, output treesize:7 [2018-04-13 06:37:08,907 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-13 06:37:08,908 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:37:08,908 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-13 06:37:08,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 06:37:08,908 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 06:37:08,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-13 06:37:08,909 INFO L87 Difference]: Start difference. First operand 163 states and 186 transitions. Second operand 6 states. [2018-04-13 06:37:09,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:37:09,053 INFO L93 Difference]: Finished difference Result 215 states and 248 transitions. [2018-04-13 06:37:09,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-13 06:37:09,053 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-04-13 06:37:09,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:37:09,054 INFO L225 Difference]: With dead ends: 215 [2018-04-13 06:37:09,054 INFO L226 Difference]: Without dead ends: 215 [2018-04-13 06:37:09,054 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-04-13 06:37:09,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-04-13 06:37:09,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 181. [2018-04-13 06:37:09,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-04-13 06:37:09,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 210 transitions. [2018-04-13 06:37:09,057 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 210 transitions. Word has length 24 [2018-04-13 06:37:09,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:37:09,057 INFO L459 AbstractCegarLoop]: Abstraction has 181 states and 210 transitions. [2018-04-13 06:37:09,057 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 06:37:09,057 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 210 transitions. [2018-04-13 06:37:09,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-13 06:37:09,058 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:37:09,058 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-13 06:37:09,058 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:37:09,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1890326275, now seen corresponding path program 1 times [2018-04-13 06:37:09,058 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:37:09,058 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:37:09,059 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:09,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:37:09,059 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:09,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:37:09,065 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:37:09,094 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-13 06:37:09,095 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:37:09,095 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 06:37:09,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 06:37:09,095 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 06:37:09,095 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 06:37:09,096 INFO L87 Difference]: Start difference. First operand 181 states and 210 transitions. Second operand 5 states. [2018-04-13 06:37:09,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:37:09,261 INFO L93 Difference]: Finished difference Result 267 states and 312 transitions. [2018-04-13 06:37:09,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 06:37:09,261 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-04-13 06:37:09,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:37:09,262 INFO L225 Difference]: With dead ends: 267 [2018-04-13 06:37:09,262 INFO L226 Difference]: Without dead ends: 267 [2018-04-13 06:37:09,262 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-13 06:37:09,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-04-13 06:37:09,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 180. [2018-04-13 06:37:09,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-04-13 06:37:09,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 208 transitions. [2018-04-13 06:37:09,265 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 208 transitions. Word has length 25 [2018-04-13 06:37:09,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:37:09,265 INFO L459 AbstractCegarLoop]: Abstraction has 180 states and 208 transitions. [2018-04-13 06:37:09,265 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 06:37:09,265 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 208 transitions. [2018-04-13 06:37:09,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-13 06:37:09,266 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:37:09,266 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-13 06:37:09,266 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:37:09,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1890326274, now seen corresponding path program 1 times [2018-04-13 06:37:09,266 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:37:09,266 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:37:09,266 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:09,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:37:09,267 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:09,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:37:09,272 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:37:09,309 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-13 06:37:09,310 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:37:09,310 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 06:37:09,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 06:37:09,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 06:37:09,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 06:37:09,310 INFO L87 Difference]: Start difference. First operand 180 states and 208 transitions. Second operand 5 states. [2018-04-13 06:37:09,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:37:09,552 INFO L93 Difference]: Finished difference Result 312 states and 358 transitions. [2018-04-13 06:37:09,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 06:37:09,552 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-04-13 06:37:09,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:37:09,553 INFO L225 Difference]: With dead ends: 312 [2018-04-13 06:37:09,554 INFO L226 Difference]: Without dead ends: 312 [2018-04-13 06:37:09,554 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-13 06:37:09,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-04-13 06:37:09,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 179. [2018-04-13 06:37:09,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-04-13 06:37:09,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 206 transitions. [2018-04-13 06:37:09,558 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 206 transitions. Word has length 25 [2018-04-13 06:37:09,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:37:09,558 INFO L459 AbstractCegarLoop]: Abstraction has 179 states and 206 transitions. [2018-04-13 06:37:09,558 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 06:37:09,558 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 206 transitions. [2018-04-13 06:37:09,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-13 06:37:09,560 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:37:09,560 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:37:09,560 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:37:09,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1446644267, now seen corresponding path program 1 times [2018-04-13 06:37:09,561 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:37:09,561 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:37:09,561 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:09,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:37:09,561 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:09,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:37:09,573 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:37:09,579 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:37:09,579 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:37:09,579 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:37:09,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:37:09,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:37:09,603 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:37:09,631 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:37:09,632 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:37:09,633 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-13 06:37:09,634 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:37:09,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:37:09,640 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-04-13 06:37:09,664 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-13 06:37:09,665 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-13 06:37:09,666 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:37:09,667 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:37:09,672 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-13 06:37:09,673 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-04-13 06:37:09,697 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 27 treesize of output 21 [2018-04-13 06:37:09,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2018-04-13 06:37:09,704 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-13 06:37:09,713 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-13 06:37:09,725 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-13 06:37:09,726 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:37 [2018-04-13 06:37:09,830 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:37:09,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-04-13 06:37:09,832 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:37:09,837 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-13 06:37:09,837 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2018-04-13 06:37:09,861 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-13 06:37:09,861 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:37:09,862 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-04-13 06:37:09,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-13 06:37:09,862 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-13 06:37:09,862 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-04-13 06:37:09,862 INFO L87 Difference]: Start difference. First operand 179 states and 206 transitions. Second operand 13 states. [2018-04-13 06:37:10,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:37:10,494 INFO L93 Difference]: Finished difference Result 193 states and 222 transitions. [2018-04-13 06:37:10,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-13 06:37:10,494 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2018-04-13 06:37:10,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:37:10,495 INFO L225 Difference]: With dead ends: 193 [2018-04-13 06:37:10,495 INFO L226 Difference]: Without dead ends: 193 [2018-04-13 06:37:10,495 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2018-04-13 06:37:10,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-04-13 06:37:10,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 182. [2018-04-13 06:37:10,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-04-13 06:37:10,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 210 transitions. [2018-04-13 06:37:10,498 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 210 transitions. Word has length 27 [2018-04-13 06:37:10,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:37:10,498 INFO L459 AbstractCegarLoop]: Abstraction has 182 states and 210 transitions. [2018-04-13 06:37:10,498 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-13 06:37:10,498 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 210 transitions. [2018-04-13 06:37:10,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-13 06:37:10,498 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:37:10,498 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:37:10,499 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:37:10,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1446644268, now seen corresponding path program 1 times [2018-04-13 06:37:10,499 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:37:10,499 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:37:10,500 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:10,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:37:10,500 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:10,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:37:10,510 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:37:10,515 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:37:10,515 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:37:10,515 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:37:10,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:37:10,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:37:10,539 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:37:10,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 06:37:10,542 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:37:10,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:37:10,544 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 06:37:10,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-13 06:37:10,564 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:37:10,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:37:10,569 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2018-04-13 06:37:10,592 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-13 06:37:10,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-13 06:37:10,595 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:37:10,596 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:37:10,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-13 06:37:10,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 8 treesize of output 7 [2018-04-13 06:37:10,608 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:37:10,609 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:37:10,616 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-13 06:37:10,616 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:39, output treesize:29 [2018-04-13 06:37:10,638 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-13 06:37:10,646 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 15 treesize of output 16 [2018-04-13 06:37:10,647 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-13 06:37:10,665 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-13 06:37:10,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, 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-13 06:37:10,682 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 18 treesize of output 17 [2018-04-13 06:37:10,683 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-13 06:37:10,687 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 06:37:10,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-04-13 06:37:10,696 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:47, output treesize:75 [2018-04-13 06:37:10,781 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-13 06:37:10,782 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:37:10,782 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-13 06:37:10,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-13 06:37:10,782 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-13 06:37:10,782 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-04-13 06:37:10,783 INFO L87 Difference]: Start difference. First operand 182 states and 210 transitions. Second operand 12 states. [2018-04-13 06:37:11,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:37:11,404 INFO L93 Difference]: Finished difference Result 248 states and 276 transitions. [2018-04-13 06:37:11,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-13 06:37:11,404 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2018-04-13 06:37:11,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:37:11,405 INFO L225 Difference]: With dead ends: 248 [2018-04-13 06:37:11,405 INFO L226 Difference]: Without dead ends: 248 [2018-04-13 06:37:11,405 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=164, Invalid=436, Unknown=0, NotChecked=0, Total=600 [2018-04-13 06:37:11,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-04-13 06:37:11,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 198. [2018-04-13 06:37:11,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-04-13 06:37:11,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 233 transitions. [2018-04-13 06:37:11,409 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 233 transitions. Word has length 27 [2018-04-13 06:37:11,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:37:11,409 INFO L459 AbstractCegarLoop]: Abstraction has 198 states and 233 transitions. [2018-04-13 06:37:11,409 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-13 06:37:11,410 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 233 transitions. [2018-04-13 06:37:11,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-13 06:37:11,410 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:37:11,410 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] [2018-04-13 06:37:11,410 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:37:11,410 INFO L82 PathProgramCache]: Analyzing trace with hash 901181277, now seen corresponding path program 1 times [2018-04-13 06:37:11,410 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:37:11,410 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:37:11,413 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:11,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:37:11,413 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:11,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:37:11,420 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:37:11,422 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:37:11,422 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:37:11,422 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:37:11,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:37:11,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:37:11,446 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:37:11,462 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:37:11,462 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:37:11,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-13 06:37:11,463 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:37:11,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:37:11,467 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-13 06:37:11,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-13 06:37:11,477 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-13 06:37:11,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:37:11,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:37:11,483 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-13 06:37:11,483 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-04-13 06:37:11,500 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 37 treesize of output 33 [2018-04-13 06:37:11,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-13 06:37:11,502 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:37:11,507 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:37:11,511 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-13 06:37:11,511 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2018-04-13 06:37:11,523 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 36 treesize of output 24 [2018-04-13 06:37:11,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-13 06:37:11,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:37:11,539 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-13 06:37:11,540 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:37:11,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:37:11,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:37:11,547 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2018-04-13 06:37:11,555 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-13 06:37:11,555 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:37:11,555 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-13 06:37:11,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-13 06:37:11,555 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-13 06:37:11,555 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-04-13 06:37:11,555 INFO L87 Difference]: Start difference. First operand 198 states and 233 transitions. Second operand 8 states. [2018-04-13 06:37:11,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:37:11,870 INFO L93 Difference]: Finished difference Result 235 states and 277 transitions. [2018-04-13 06:37:11,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-13 06:37:11,870 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-04-13 06:37:11,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:37:11,871 INFO L225 Difference]: With dead ends: 235 [2018-04-13 06:37:11,871 INFO L226 Difference]: Without dead ends: 235 [2018-04-13 06:37:11,872 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-04-13 06:37:11,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-04-13 06:37:11,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 197. [2018-04-13 06:37:11,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-04-13 06:37:11,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 231 transitions. [2018-04-13 06:37:11,876 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 231 transitions. Word has length 28 [2018-04-13 06:37:11,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:37:11,876 INFO L459 AbstractCegarLoop]: Abstraction has 197 states and 231 transitions. [2018-04-13 06:37:11,876 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-13 06:37:11,876 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 231 transitions. [2018-04-13 06:37:11,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-13 06:37:11,877 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:37:11,877 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] [2018-04-13 06:37:11,877 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:37:11,877 INFO L82 PathProgramCache]: Analyzing trace with hash 901181278, now seen corresponding path program 1 times [2018-04-13 06:37:11,877 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:37:11,877 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:37:11,878 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:11,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:37:11,878 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:11,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:37:11,885 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:37:11,891 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:37:11,891 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:37:11,892 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:37:11,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:37:11,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:37:11,912 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:37:11,939 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:37:11,939 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:37:11,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-04-13 06:37:11,940 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:37:11,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, 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-13 06:37:11,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:37:11,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:37:11,948 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-13 06:37:11,958 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-13 06:37:11,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:37:11,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:37:11,961 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:37:11,968 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-13 06:37:11,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, 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-13 06:37:11,970 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:37:11,975 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:37:11,979 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-13 06:37:11,980 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:25 [2018-04-13 06:37:12,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2018-04-13 06:37:12,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:37:12,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:37:12,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:37:12,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-04-13 06:37:12,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-13 06:37:12,020 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:37:12,023 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:37:12,029 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-13 06:37:12,030 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:63, output treesize:47 [2018-04-13 06:37:12,045 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 47 treesize of output 33 [2018-04-13 06:37:12,050 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 28 treesize of output 17 [2018-04-13 06:37:12,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:37:12,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-13 06:37:12,068 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:37:12,074 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:37:12,084 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 22 treesize of output 20 [2018-04-13 06:37:12,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-13 06:37:12,087 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:37:12,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-13 06:37:12,093 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 06:37:12,096 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:37:12,101 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-13 06:37:12,101 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:61, output treesize:9 [2018-04-13 06:37:12,110 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-13 06:37:12,111 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:37:12,111 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-13 06:37:12,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-13 06:37:12,111 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-13 06:37:12,111 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-13 06:37:12,112 INFO L87 Difference]: Start difference. First operand 197 states and 231 transitions. Second operand 8 states. [2018-04-13 06:37:12,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:37:12,445 INFO L93 Difference]: Finished difference Result 234 states and 275 transitions. [2018-04-13 06:37:12,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-13 06:37:12,445 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-04-13 06:37:12,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:37:12,446 INFO L225 Difference]: With dead ends: 234 [2018-04-13 06:37:12,446 INFO L226 Difference]: Without dead ends: 234 [2018-04-13 06:37:12,447 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2018-04-13 06:37:12,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-04-13 06:37:12,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 196. [2018-04-13 06:37:12,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-04-13 06:37:12,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 229 transitions. [2018-04-13 06:37:12,451 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 229 transitions. Word has length 28 [2018-04-13 06:37:12,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:37:12,451 INFO L459 AbstractCegarLoop]: Abstraction has 196 states and 229 transitions. [2018-04-13 06:37:12,451 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-13 06:37:12,451 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 229 transitions. [2018-04-13 06:37:12,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-13 06:37:12,452 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:37:12,452 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] [2018-04-13 06:37:12,452 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:37:12,452 INFO L82 PathProgramCache]: Analyzing trace with hash -2057254630, now seen corresponding path program 1 times [2018-04-13 06:37:12,452 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:37:12,452 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:37:12,453 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:12,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:37:12,453 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:12,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:37:12,461 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:37:12,481 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-13 06:37:12,481 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:37:12,481 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 06:37:12,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 06:37:12,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 06:37:12,482 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 06:37:12,482 INFO L87 Difference]: Start difference. First operand 196 states and 229 transitions. Second operand 5 states. [2018-04-13 06:37:12,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:37:12,689 INFO L93 Difference]: Finished difference Result 280 states and 327 transitions. [2018-04-13 06:37:12,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 06:37:12,689 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-04-13 06:37:12,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:37:12,690 INFO L225 Difference]: With dead ends: 280 [2018-04-13 06:37:12,690 INFO L226 Difference]: Without dead ends: 280 [2018-04-13 06:37:12,691 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-13 06:37:12,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-04-13 06:37:12,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 195. [2018-04-13 06:37:12,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-04-13 06:37:12,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 227 transitions. [2018-04-13 06:37:12,695 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 227 transitions. Word has length 29 [2018-04-13 06:37:12,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:37:12,695 INFO L459 AbstractCegarLoop]: Abstraction has 195 states and 227 transitions. [2018-04-13 06:37:12,695 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 06:37:12,695 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 227 transitions. [2018-04-13 06:37:12,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-13 06:37:12,695 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:37:12,696 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] [2018-04-13 06:37:12,696 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:37:12,696 INFO L82 PathProgramCache]: Analyzing trace with hash -2057254629, now seen corresponding path program 1 times [2018-04-13 06:37:12,696 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:37:12,696 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:37:12,697 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:12,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:37:12,697 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:12,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:37:12,703 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:37:12,732 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-13 06:37:12,732 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:37:12,732 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 06:37:12,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 06:37:12,732 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 06:37:12,733 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 06:37:12,733 INFO L87 Difference]: Start difference. First operand 195 states and 227 transitions. Second operand 5 states. [2018-04-13 06:37:13,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:37:13,014 INFO L93 Difference]: Finished difference Result 344 states and 400 transitions. [2018-04-13 06:37:13,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 06:37:13,015 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-04-13 06:37:13,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:37:13,016 INFO L225 Difference]: With dead ends: 344 [2018-04-13 06:37:13,016 INFO L226 Difference]: Without dead ends: 344 [2018-04-13 06:37:13,016 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-13 06:37:13,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-04-13 06:37:13,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 194. [2018-04-13 06:37:13,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-04-13 06:37:13,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 225 transitions. [2018-04-13 06:37:13,021 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 225 transitions. Word has length 29 [2018-04-13 06:37:13,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:37:13,021 INFO L459 AbstractCegarLoop]: Abstraction has 194 states and 225 transitions. [2018-04-13 06:37:13,021 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 06:37:13,021 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 225 transitions. [2018-04-13 06:37:13,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-13 06:37:13,021 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:37:13,021 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:37:13,022 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:37:13,022 INFO L82 PathProgramCache]: Analyzing trace with hash 952419245, now seen corresponding path program 1 times [2018-04-13 06:37:13,022 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:37:13,022 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:37:13,023 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:13,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:37:13,023 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:13,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:37:13,029 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:37:13,045 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-13 06:37:13,045 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:37:13,045 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 06:37:13,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 06:37:13,046 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 06:37:13,046 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 06:37:13,046 INFO L87 Difference]: Start difference. First operand 194 states and 225 transitions. Second operand 4 states. [2018-04-13 06:37:13,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:37:13,144 INFO L93 Difference]: Finished difference Result 224 states and 259 transitions. [2018-04-13 06:37:13,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 06:37:13,145 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-04-13 06:37:13,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:37:13,145 INFO L225 Difference]: With dead ends: 224 [2018-04-13 06:37:13,146 INFO L226 Difference]: Without dead ends: 224 [2018-04-13 06:37:13,146 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-13 06:37:13,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-04-13 06:37:13,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 193. [2018-04-13 06:37:13,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-04-13 06:37:13,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 223 transitions. [2018-04-13 06:37:13,149 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 223 transitions. Word has length 31 [2018-04-13 06:37:13,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:37:13,150 INFO L459 AbstractCegarLoop]: Abstraction has 193 states and 223 transitions. [2018-04-13 06:37:13,150 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 06:37:13,150 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 223 transitions. [2018-04-13 06:37:13,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-13 06:37:13,150 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:37:13,150 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:37:13,150 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:37:13,151 INFO L82 PathProgramCache]: Analyzing trace with hash 952419246, now seen corresponding path program 1 times [2018-04-13 06:37:13,151 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:37:13,151 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:37:13,151 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:13,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:37:13,151 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:13,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:37:13,158 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:37:13,176 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-13 06:37:13,176 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:37:13,176 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 06:37:13,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 06:37:13,177 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 06:37:13,177 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 06:37:13,177 INFO L87 Difference]: Start difference. First operand 193 states and 223 transitions. Second operand 4 states. [2018-04-13 06:37:13,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:37:13,306 INFO L93 Difference]: Finished difference Result 254 states and 289 transitions. [2018-04-13 06:37:13,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 06:37:13,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-04-13 06:37:13,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:37:13,307 INFO L225 Difference]: With dead ends: 254 [2018-04-13 06:37:13,307 INFO L226 Difference]: Without dead ends: 254 [2018-04-13 06:37:13,307 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-13 06:37:13,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-04-13 06:37:13,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 191. [2018-04-13 06:37:13,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-04-13 06:37:13,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 219 transitions. [2018-04-13 06:37:13,311 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 219 transitions. Word has length 31 [2018-04-13 06:37:13,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:37:13,311 INFO L459 AbstractCegarLoop]: Abstraction has 191 states and 219 transitions. [2018-04-13 06:37:13,311 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 06:37:13,311 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 219 transitions. [2018-04-13 06:37:13,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-13 06:37:13,312 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:37:13,312 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-13 06:37:13,312 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:37:13,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1510720002, now seen corresponding path program 1 times [2018-04-13 06:37:13,312 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:37:13,312 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:37:13,313 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:13,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:37:13,313 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:13,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:37:13,320 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:37:13,321 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:37:13,322 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:37:13,322 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:37:13,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:37:13,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:37:13,340 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:37:13,348 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:37:13,349 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:37:13,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-13 06:37:13,350 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:37:13,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:37:13,355 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-13 06:37:13,364 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-13 06:37:13,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, 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-13 06:37:13,366 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:37:13,367 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:37:13,376 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-13 06:37:13,376 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:27 [2018-04-13 06:37:13,400 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-13 06:37:13,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:37:13,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:37:13,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:37:13,413 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-13 06:37:13,413 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:40 [2018-04-13 06:37:13,431 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 44 treesize of output 30 [2018-04-13 06:37:13,434 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-13 06:37:13,435 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:37:13,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-13 06:37:13,440 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:37:13,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:37:13,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:37:13,446 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:49, output treesize:15 [2018-04-13 06:37:13,456 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-13 06:37:13,456 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:37:13,456 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-13 06:37:13,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-13 06:37:13,457 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-13 06:37:13,457 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-04-13 06:37:13,457 INFO L87 Difference]: Start difference. First operand 191 states and 219 transitions. Second operand 8 states. [2018-04-13 06:37:13,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:37:13,720 INFO L93 Difference]: Finished difference Result 198 states and 228 transitions. [2018-04-13 06:37:13,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-13 06:37:13,722 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-04-13 06:37:13,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:37:13,723 INFO L225 Difference]: With dead ends: 198 [2018-04-13 06:37:13,723 INFO L226 Difference]: Without dead ends: 198 [2018-04-13 06:37:13,723 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-04-13 06:37:13,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-04-13 06:37:13,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 190. [2018-04-13 06:37:13,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-04-13 06:37:13,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 218 transitions. [2018-04-13 06:37:13,726 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 218 transitions. Word has length 32 [2018-04-13 06:37:13,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:37:13,726 INFO L459 AbstractCegarLoop]: Abstraction has 190 states and 218 transitions. [2018-04-13 06:37:13,726 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-13 06:37:13,726 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 218 transitions. [2018-04-13 06:37:13,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-13 06:37:13,727 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:37:13,727 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-13 06:37:13,727 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:37:13,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1510720003, now seen corresponding path program 1 times [2018-04-13 06:37:13,727 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:37:13,727 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:37:13,728 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:13,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:37:13,728 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:13,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:37:13,737 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:37:13,739 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:37:13,740 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:37:13,740 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:37:13,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:37:13,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:37:13,759 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:37:13,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-13 06:37:13,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:37:13,777 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:37:13,778 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:37:13,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-13 06:37:13,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:37:13,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:37:13,784 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2018-04-13 06:37:13,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-13 06:37:13,798 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-13 06:37:13,798 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:37:13,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:37:13,809 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-13 06:37:13,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 06:37:13,811 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:37:13,812 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:37:13,819 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-13 06:37:13,819 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:39, output treesize:34 [2018-04-13 06:37:13,848 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 11 treesize of output 1 [2018-04-13 06:37:13,848 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:37:13,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 62 [2018-04-13 06:37:13,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:37:13,870 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:37:13,878 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:37:13,893 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 42 treesize of output 43 [2018-04-13 06:37:13,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-13 06:37:13,896 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:37:13,902 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:37:13,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:37:13,912 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:100, output treesize:69 [2018-04-13 06:37:13,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 41 [2018-04-13 06:37:13,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-13 06:37:13,940 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:37:13,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-13 06:37:13,948 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:37:13,952 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:37:13,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2018-04-13 06:37:13,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-13 06:37:13,988 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:37:14,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, 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 7 [2018-04-13 06:37:14,018 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 06:37:14,021 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:37:14,026 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-13 06:37:14,026 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:87, output treesize:9 [2018-04-13 06:37:14,032 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-13 06:37:14,032 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:37:14,032 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-13 06:37:14,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-13 06:37:14,032 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-13 06:37:14,032 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-13 06:37:14,033 INFO L87 Difference]: Start difference. First operand 190 states and 218 transitions. Second operand 8 states. [2018-04-13 06:37:14,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:37:14,365 INFO L93 Difference]: Finished difference Result 197 states and 227 transitions. [2018-04-13 06:37:14,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-13 06:37:14,365 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-04-13 06:37:14,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:37:14,365 INFO L225 Difference]: With dead ends: 197 [2018-04-13 06:37:14,366 INFO L226 Difference]: Without dead ends: 197 [2018-04-13 06:37:14,366 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2018-04-13 06:37:14,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-04-13 06:37:14,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 189. [2018-04-13 06:37:14,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-04-13 06:37:14,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 217 transitions. [2018-04-13 06:37:14,368 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 217 transitions. Word has length 32 [2018-04-13 06:37:14,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:37:14,368 INFO L459 AbstractCegarLoop]: Abstraction has 189 states and 217 transitions. [2018-04-13 06:37:14,368 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-13 06:37:14,368 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 217 transitions. [2018-04-13 06:37:14,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-13 06:37:14,368 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:37:14,369 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] [2018-04-13 06:37:14,369 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:37:14,369 INFO L82 PathProgramCache]: Analyzing trace with hash 862110831, now seen corresponding path program 1 times [2018-04-13 06:37:14,369 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:37:14,369 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:37:14,369 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:14,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:37:14,370 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:14,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:37:14,373 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:37:14,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:37:14,386 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:37:14,386 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 06:37:14,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 06:37:14,386 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 06:37:14,386 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 06:37:14,386 INFO L87 Difference]: Start difference. First operand 189 states and 217 transitions. Second operand 4 states. [2018-04-13 06:37:14,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:37:14,473 INFO L93 Difference]: Finished difference Result 207 states and 236 transitions. [2018-04-13 06:37:14,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 06:37:14,473 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-04-13 06:37:14,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:37:14,474 INFO L225 Difference]: With dead ends: 207 [2018-04-13 06:37:14,474 INFO L226 Difference]: Without dead ends: 207 [2018-04-13 06:37:14,474 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-13 06:37:14,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-04-13 06:37:14,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 188. [2018-04-13 06:37:14,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-04-13 06:37:14,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 215 transitions. [2018-04-13 06:37:14,477 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 215 transitions. Word has length 33 [2018-04-13 06:37:14,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:37:14,477 INFO L459 AbstractCegarLoop]: Abstraction has 188 states and 215 transitions. [2018-04-13 06:37:14,477 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 06:37:14,477 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 215 transitions. [2018-04-13 06:37:14,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-13 06:37:14,478 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:37:14,478 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] [2018-04-13 06:37:14,478 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:37:14,478 INFO L82 PathProgramCache]: Analyzing trace with hash 862110832, now seen corresponding path program 1 times [2018-04-13 06:37:14,478 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:37:14,478 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:37:14,479 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:14,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:37:14,479 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:14,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:37:14,486 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:37:14,509 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-13 06:37:14,510 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:37:14,510 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 06:37:14,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 06:37:14,510 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 06:37:14,510 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 06:37:14,510 INFO L87 Difference]: Start difference. First operand 188 states and 215 transitions. Second operand 4 states. [2018-04-13 06:37:14,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:37:14,633 INFO L93 Difference]: Finished difference Result 232 states and 259 transitions. [2018-04-13 06:37:14,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 06:37:14,634 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-04-13 06:37:14,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:37:14,635 INFO L225 Difference]: With dead ends: 232 [2018-04-13 06:37:14,635 INFO L226 Difference]: Without dead ends: 232 [2018-04-13 06:37:14,635 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-13 06:37:14,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-04-13 06:37:14,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 186. [2018-04-13 06:37:14,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-04-13 06:37:14,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 211 transitions. [2018-04-13 06:37:14,638 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 211 transitions. Word has length 33 [2018-04-13 06:37:14,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:37:14,638 INFO L459 AbstractCegarLoop]: Abstraction has 186 states and 211 transitions. [2018-04-13 06:37:14,638 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 06:37:14,638 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 211 transitions. [2018-04-13 06:37:14,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-13 06:37:14,639 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:37:14,639 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:37:14,639 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:37:14,639 INFO L82 PathProgramCache]: Analyzing trace with hash -746127005, now seen corresponding path program 1 times [2018-04-13 06:37:14,639 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:37:14,639 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:37:14,640 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:14,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:37:14,640 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:14,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:37:14,647 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:37:14,649 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:37:14,649 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:37:14,649 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:37:14,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:37:14,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:37:14,666 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:37:14,671 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-13 06:37:14,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:37:14,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:37:14,676 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:37:14,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-13 06:37:14,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 06:37:14,684 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:37:14,685 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:37:14,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:37:14,689 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:23, output treesize:15 [2018-04-13 06:37:14,699 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-13 06:37:14,701 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:37:14,703 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-13 06:37:14,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:37:14,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:37:14,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-13 06:37:14,721 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:37:14,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-13 06:37:14,723 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:37:14,731 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:37:14,736 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-13 06:37:14,736 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2018-04-13 06:37:14,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-13 06:37:14,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-13 06:37:14,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:37:14,744 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:37:14,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-13 06:37:14,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-13 06:37:14,751 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:37:14,752 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:37:14,754 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-13 06:37:14,754 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-04-13 06:37:14,766 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:37:14,767 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 06:37:14,767 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-04-13 06:37:14,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 06:37:14,767 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 06:37:14,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 06:37:14,767 INFO L87 Difference]: Start difference. First operand 186 states and 211 transitions. Second operand 5 states. [2018-04-13 06:37:14,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:37:14,834 INFO L93 Difference]: Finished difference Result 199 states and 225 transitions. [2018-04-13 06:37:14,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 06:37:14,834 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2018-04-13 06:37:14,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:37:14,835 INFO L225 Difference]: With dead ends: 199 [2018-04-13 06:37:14,835 INFO L226 Difference]: Without dead ends: 199 [2018-04-13 06:37:14,836 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-13 06:37:14,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-04-13 06:37:14,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 193. [2018-04-13 06:37:14,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-04-13 06:37:14,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 219 transitions. [2018-04-13 06:37:14,839 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 219 transitions. Word has length 36 [2018-04-13 06:37:14,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:37:14,839 INFO L459 AbstractCegarLoop]: Abstraction has 193 states and 219 transitions. [2018-04-13 06:37:14,839 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 06:37:14,839 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 219 transitions. [2018-04-13 06:37:14,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-13 06:37:14,839 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:37:14,840 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] [2018-04-13 06:37:14,840 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:37:14,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1655100458, now seen corresponding path program 1 times [2018-04-13 06:37:14,840 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:37:14,840 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:37:14,841 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:14,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:37:14,841 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:14,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:37:14,849 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:37:14,851 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:37:14,851 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:37:14,851 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:37:14,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:37:14,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:37:14,872 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:37:14,929 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-13 06:37:14,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:37:14,931 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:37:14,947 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:37:14,953 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-13 06:37:14,953 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:35 [2018-04-13 06:37:14,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2018-04-13 06:37:14,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 33 [2018-04-13 06:37:14,983 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-13 06:37:14,993 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-13 06:37:15,002 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-13 06:37:15,002 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:53 [2018-04-13 06:37:15,168 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~st~0.base Int) (main_~n~0.base Int)) (let ((.cse0 (store |c_old(#valid)| main_~n~0.base 1))) (and (= (store (store .cse0 main_~st~0.base 0) main_~n~0.base 0) |c_#valid|) (= (select |c_old(#valid)| main_~n~0.base) 0) (= 0 (select .cse0 main_~st~0.base))))) is different from true [2018-04-13 06:37:15,176 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-04-13 06:37:15,177 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 06:37:15,177 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-13 06:37:15,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-13 06:37:15,177 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-13 06:37:15,177 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=155, Unknown=2, NotChecked=24, Total=210 [2018-04-13 06:37:15,177 INFO L87 Difference]: Start difference. First operand 193 states and 219 transitions. Second operand 15 states. [2018-04-13 06:37:15,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:37:15,948 INFO L93 Difference]: Finished difference Result 222 states and 249 transitions. [2018-04-13 06:37:15,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-13 06:37:15,949 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2018-04-13 06:37:15,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:37:15,949 INFO L225 Difference]: With dead ends: 222 [2018-04-13 06:37:15,949 INFO L226 Difference]: Without dead ends: 215 [2018-04-13 06:37:15,950 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=80, Invalid=426, Unknown=4, NotChecked=42, Total=552 [2018-04-13 06:37:15,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-04-13 06:37:15,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 211. [2018-04-13 06:37:15,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-04-13 06:37:15,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 238 transitions. [2018-04-13 06:37:15,952 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 238 transitions. Word has length 37 [2018-04-13 06:37:15,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:37:15,952 INFO L459 AbstractCegarLoop]: Abstraction has 211 states and 238 transitions. [2018-04-13 06:37:15,952 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-13 06:37:15,952 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 238 transitions. [2018-04-13 06:37:15,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-13 06:37:15,952 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:37:15,952 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] [2018-04-13 06:37:15,952 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:37:15,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1326396508, now seen corresponding path program 1 times [2018-04-13 06:37:15,952 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:37:15,952 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:37:15,953 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:15,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:37:15,953 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:15,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:37:15,958 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:37:15,959 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:37:15,960 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:37:15,960 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:37:15,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:37:15,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:37:15,979 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:37:15,987 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:37:15,988 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:37:15,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-13 06:37:15,989 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:37:15,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:37:15,992 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-13 06:37:16,009 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:37:16,009 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-13 06:37:16,010 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:37:16,013 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-13 06:37:16,014 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2018-04-13 06:37:16,020 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-13 06:37:16,021 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:37:16,021 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-13 06:37:16,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-13 06:37:16,021 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-13 06:37:16,021 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-04-13 06:37:16,021 INFO L87 Difference]: Start difference. First operand 211 states and 238 transitions. Second operand 7 states. [2018-04-13 06:37:16,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:37:16,231 INFO L93 Difference]: Finished difference Result 228 states and 256 transitions. [2018-04-13 06:37:16,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-13 06:37:16,231 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2018-04-13 06:37:16,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:37:16,232 INFO L225 Difference]: With dead ends: 228 [2018-04-13 06:37:16,232 INFO L226 Difference]: Without dead ends: 228 [2018-04-13 06:37:16,233 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-04-13 06:37:16,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-04-13 06:37:16,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 218. [2018-04-13 06:37:16,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-04-13 06:37:16,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 248 transitions. [2018-04-13 06:37:16,236 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 248 transitions. Word has length 42 [2018-04-13 06:37:16,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:37:16,236 INFO L459 AbstractCegarLoop]: Abstraction has 218 states and 248 transitions. [2018-04-13 06:37:16,236 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-13 06:37:16,236 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 248 transitions. [2018-04-13 06:37:16,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-13 06:37:16,237 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:37:16,237 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] [2018-04-13 06:37:16,237 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:37:16,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1326396509, now seen corresponding path program 1 times [2018-04-13 06:37:16,237 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:37:16,238 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:37:16,238 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:16,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:37:16,238 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:16,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:37:16,246 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:37:16,286 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-13 06:37:16,287 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:37:16,287 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 06:37:16,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 06:37:16,287 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 06:37:16,287 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 06:37:16,288 INFO L87 Difference]: Start difference. First operand 218 states and 248 transitions. Second operand 5 states. [2018-04-13 06:37:16,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:37:16,406 INFO L93 Difference]: Finished difference Result 285 states and 316 transitions. [2018-04-13 06:37:16,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 06:37:16,407 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-04-13 06:37:16,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:37:16,407 INFO L225 Difference]: With dead ends: 285 [2018-04-13 06:37:16,407 INFO L226 Difference]: Without dead ends: 285 [2018-04-13 06:37:16,408 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-13 06:37:16,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-04-13 06:37:16,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 222. [2018-04-13 06:37:16,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-04-13 06:37:16,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 252 transitions. [2018-04-13 06:37:16,410 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 252 transitions. Word has length 42 [2018-04-13 06:37:16,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:37:16,410 INFO L459 AbstractCegarLoop]: Abstraction has 222 states and 252 transitions. [2018-04-13 06:37:16,410 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 06:37:16,410 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 252 transitions. [2018-04-13 06:37:16,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-13 06:37:16,411 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:37:16,411 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] [2018-04-13 06:37:16,411 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:37:16,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1155279748, now seen corresponding path program 1 times [2018-04-13 06:37:16,411 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:37:16,411 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:37:16,411 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:16,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:37:16,412 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:16,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:37:16,419 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:37:16,421 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:37:16,421 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:37:16,421 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:37:16,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:37:16,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:37:16,444 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:37:16,455 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:37:16,456 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:37:16,457 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:37:16,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2018-04-13 06:37:16,459 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:37:16,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:37:16,463 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-13 06:37:16,495 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:37:16,496 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:37:16,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2018-04-13 06:37:16,497 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:37:16,502 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-13 06:37:16,502 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2018-04-13 06:37:16,513 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-13 06:37:16,513 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:37:16,513 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-13 06:37:16,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-13 06:37:16,514 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-13 06:37:16,514 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-04-13 06:37:16,514 INFO L87 Difference]: Start difference. First operand 222 states and 252 transitions. Second operand 7 states. [2018-04-13 06:37:16,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:37:16,731 INFO L93 Difference]: Finished difference Result 259 states and 291 transitions. [2018-04-13 06:37:16,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-13 06:37:16,732 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2018-04-13 06:37:16,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:37:16,732 INFO L225 Difference]: With dead ends: 259 [2018-04-13 06:37:16,732 INFO L226 Difference]: Without dead ends: 259 [2018-04-13 06:37:16,732 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-04-13 06:37:16,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-04-13 06:37:16,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 230. [2018-04-13 06:37:16,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-04-13 06:37:16,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 265 transitions. [2018-04-13 06:37:16,736 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 265 transitions. Word has length 42 [2018-04-13 06:37:16,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:37:16,736 INFO L459 AbstractCegarLoop]: Abstraction has 230 states and 265 transitions. [2018-04-13 06:37:16,736 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-13 06:37:16,736 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 265 transitions. [2018-04-13 06:37:16,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-13 06:37:16,737 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:37:16,737 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] [2018-04-13 06:37:16,737 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:37:16,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1155279747, now seen corresponding path program 1 times [2018-04-13 06:37:16,737 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:37:16,737 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:37:16,738 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:16,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:37:16,738 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:16,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:37:16,745 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:37:16,787 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-13 06:37:16,788 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:37:16,788 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 06:37:16,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 06:37:16,788 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 06:37:16,788 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 06:37:16,789 INFO L87 Difference]: Start difference. First operand 230 states and 265 transitions. Second operand 5 states. [2018-04-13 06:37:16,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:37:16,962 INFO L93 Difference]: Finished difference Result 322 states and 360 transitions. [2018-04-13 06:37:16,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 06:37:16,963 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-04-13 06:37:16,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:37:16,963 INFO L225 Difference]: With dead ends: 322 [2018-04-13 06:37:16,963 INFO L226 Difference]: Without dead ends: 322 [2018-04-13 06:37:16,964 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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-13 06:37:16,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-04-13 06:37:16,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 223. [2018-04-13 06:37:16,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-04-13 06:37:16,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 255 transitions. [2018-04-13 06:37:16,966 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 255 transitions. Word has length 42 [2018-04-13 06:37:16,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:37:16,967 INFO L459 AbstractCegarLoop]: Abstraction has 223 states and 255 transitions. [2018-04-13 06:37:16,967 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 06:37:16,967 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 255 transitions. [2018-04-13 06:37:16,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-13 06:37:16,967 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:37:16,967 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] [2018-04-13 06:37:16,967 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:37:16,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1831380995, now seen corresponding path program 1 times [2018-04-13 06:37:16,968 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:37:16,968 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:37:16,968 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:16,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:37:16,969 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:16,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:37:16,975 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:37:17,004 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-13 06:37:17,004 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:37:17,004 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 06:37:17,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 06:37:17,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 06:37:17,005 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 06:37:17,005 INFO L87 Difference]: Start difference. First operand 223 states and 255 transitions. Second operand 5 states. [2018-04-13 06:37:17,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:37:17,043 INFO L93 Difference]: Finished difference Result 306 states and 347 transitions. [2018-04-13 06:37:17,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 06:37:17,051 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-04-13 06:37:17,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:37:17,052 INFO L225 Difference]: With dead ends: 306 [2018-04-13 06:37:17,052 INFO L226 Difference]: Without dead ends: 306 [2018-04-13 06:37:17,052 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-13 06:37:17,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-04-13 06:37:17,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 229. [2018-04-13 06:37:17,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-04-13 06:37:17,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 262 transitions. [2018-04-13 06:37:17,056 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 262 transitions. Word has length 43 [2018-04-13 06:37:17,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:37:17,056 INFO L459 AbstractCegarLoop]: Abstraction has 229 states and 262 transitions. [2018-04-13 06:37:17,056 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 06:37:17,056 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 262 transitions. [2018-04-13 06:37:17,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-13 06:37:17,056 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:37:17,057 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] [2018-04-13 06:37:17,057 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:37:17,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1453933603, now seen corresponding path program 1 times [2018-04-13 06:37:17,057 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:37:17,057 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:37:17,058 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:17,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:37:17,058 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:17,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:37:17,064 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:37:17,108 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-13 06:37:17,109 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:37:17,109 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 06:37:17,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 06:37:17,109 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 06:37:17,109 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 06:37:17,109 INFO L87 Difference]: Start difference. First operand 229 states and 262 transitions. Second operand 5 states. [2018-04-13 06:37:17,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:37:17,153 INFO L93 Difference]: Finished difference Result 319 states and 355 transitions. [2018-04-13 06:37:17,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 06:37:17,153 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2018-04-13 06:37:17,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:37:17,154 INFO L225 Difference]: With dead ends: 319 [2018-04-13 06:37:17,154 INFO L226 Difference]: Without dead ends: 319 [2018-04-13 06:37:17,154 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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-13 06:37:17,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-04-13 06:37:17,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 223. [2018-04-13 06:37:17,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-04-13 06:37:17,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 254 transitions. [2018-04-13 06:37:17,156 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 254 transitions. Word has length 43 [2018-04-13 06:37:17,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:37:17,156 INFO L459 AbstractCegarLoop]: Abstraction has 223 states and 254 transitions. [2018-04-13 06:37:17,156 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 06:37:17,156 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 254 transitions. [2018-04-13 06:37:17,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-13 06:37:17,157 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:37:17,157 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:37:17,157 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:37:17,157 INFO L82 PathProgramCache]: Analyzing trace with hash -938238723, now seen corresponding path program 1 times [2018-04-13 06:37:17,157 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:37:17,157 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:37:17,157 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:17,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:37:17,158 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:17,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:37:17,163 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:37:17,172 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-13 06:37:17,172 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:37:17,172 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 06:37:17,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 06:37:17,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 06:37:17,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 06:37:17,173 INFO L87 Difference]: Start difference. First operand 223 states and 254 transitions. Second operand 4 states. [2018-04-13 06:37:17,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:37:17,264 INFO L93 Difference]: Finished difference Result 228 states and 256 transitions. [2018-04-13 06:37:17,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 06:37:17,264 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-04-13 06:37:17,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:37:17,264 INFO L225 Difference]: With dead ends: 228 [2018-04-13 06:37:17,264 INFO L226 Difference]: Without dead ends: 228 [2018-04-13 06:37:17,265 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-13 06:37:17,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-04-13 06:37:17,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 222. [2018-04-13 06:37:17,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-04-13 06:37:17,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 252 transitions. [2018-04-13 06:37:17,266 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 252 transitions. Word has length 44 [2018-04-13 06:37:17,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:37:17,266 INFO L459 AbstractCegarLoop]: Abstraction has 222 states and 252 transitions. [2018-04-13 06:37:17,266 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 06:37:17,266 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 252 transitions. [2018-04-13 06:37:17,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-13 06:37:17,267 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:37:17,267 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] [2018-04-13 06:37:17,267 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:37:17,267 INFO L82 PathProgramCache]: Analyzing trace with hash 2140724876, now seen corresponding path program 1 times [2018-04-13 06:37:17,267 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:37:17,267 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:37:17,267 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:17,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:37:17,268 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:17,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:37:17,276 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:37:17,427 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:37:17,428 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:37:17,428 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:37:17,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:37:17,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:37:17,463 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:37:17,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-13 06:37:17,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 11 treesize of output 3 [2018-04-13 06:37:17,595 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:37:17,596 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:37:17,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 15 treesize of output 11 [2018-04-13 06:37:17,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-13 06:37:17,603 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:37:17,604 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:37:17,606 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-13 06:37:17,606 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-04-13 06:37:17,622 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:37:17,623 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 06:37:17,623 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2018-04-13 06:37:17,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-13 06:37:17,623 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-13 06:37:17,623 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-04-13 06:37:17,623 INFO L87 Difference]: Start difference. First operand 222 states and 252 transitions. Second operand 14 states. [2018-04-13 06:37:18,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:37:18,319 INFO L93 Difference]: Finished difference Result 271 states and 308 transitions. [2018-04-13 06:37:18,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-13 06:37:18,319 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 48 [2018-04-13 06:37:18,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:37:18,320 INFO L225 Difference]: With dead ends: 271 [2018-04-13 06:37:18,320 INFO L226 Difference]: Without dead ends: 271 [2018-04-13 06:37:18,321 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 41 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=191, Invalid=565, Unknown=0, NotChecked=0, Total=756 [2018-04-13 06:37:18,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-04-13 06:37:18,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 248. [2018-04-13 06:37:18,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-04-13 06:37:18,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 282 transitions. [2018-04-13 06:37:18,324 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 282 transitions. Word has length 48 [2018-04-13 06:37:18,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:37:18,324 INFO L459 AbstractCegarLoop]: Abstraction has 248 states and 282 transitions. [2018-04-13 06:37:18,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-13 06:37:18,325 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 282 transitions. [2018-04-13 06:37:18,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-13 06:37:18,325 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:37:18,325 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] [2018-04-13 06:37:18,325 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:37:18,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1839300468, now seen corresponding path program 1 times [2018-04-13 06:37:18,326 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:37:18,326 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:37:18,326 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:18,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:37:18,326 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:37:18,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:37:18,337 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:37:18,341 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:37:18,341 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:37:18,341 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:37:18,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:37:18,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:37:18,360 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:37:18,373 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:37:18,374 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:37:18,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-13 06:37:18,375 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:37:18,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:37:18,381 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-04-13 06:37:18,393 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-13 06:37:18,396 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-13 06:37:18,396 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:37:18,398 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:37:18,406 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-13 06:37:18,406 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:33 [2018-04-13 06:37:18,445 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:37:18,451 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 0 case distinctions, treesize of input 45 treesize of output 52 [2018-04-13 06:37:18,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:37:18,454 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:37:18,461 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:37:18,470 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-13 06:37:18,470 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:46 [2018-04-13 06:37:18,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, 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-13 06:37:18,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 29 [2018-04-13 06:37:18,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:37:18,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:37:18,531 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-13 06:37:18,531 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:55 [2018-04-13 06:37:24,568 WARN L151 SmtUtils]: Spent 2009ms on a formula simplification. DAG size of input: 27 DAG size of output 23 [2018-04-13 06:37:26,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, 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 32 [2018-04-13 06:37:26,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 25 treesize of output 10 [2018-04-13 06:37:26,622 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:37:26,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-13 06:37:26,627 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:37:26,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:37:26,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:37:26,633 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:51, output treesize:15 [2018-04-13 06:37:26,660 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:37:26,661 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 06:37:26,661 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-13 06:37:26,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-13 06:37:26,661 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-13 06:37:26,661 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=114, Unknown=3, NotChecked=0, Total=156 [2018-04-13 06:37:26,662 INFO L87 Difference]: Start difference. First operand 248 states and 282 transitions. Second operand 13 states. [2018-04-13 06:37:50,282 WARN L151 SmtUtils]: Spent 586ms on a formula simplification. DAG size of input: 60 DAG size of output 37 [2018-04-13 06:38:08,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:38:08,729 INFO L93 Difference]: Finished difference Result 547 states and 646 transitions. [2018-04-13 06:38:08,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-13 06:38:08,730 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 48 [2018-04-13 06:38:08,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:38:08,731 INFO L225 Difference]: With dead ends: 547 [2018-04-13 06:38:08,731 INFO L226 Difference]: Without dead ends: 547 [2018-04-13 06:38:08,731 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 41.0s TimeCoverageRelationStatistics Valid=180, Invalid=401, Unknown=19, NotChecked=0, Total=600 [2018-04-13 06:38:08,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2018-04-13 06:38:08,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 296. [2018-04-13 06:38:08,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-04-13 06:38:08,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 353 transitions. [2018-04-13 06:38:08,735 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 353 transitions. Word has length 48 [2018-04-13 06:38:08,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:38:08,735 INFO L459 AbstractCegarLoop]: Abstraction has 296 states and 353 transitions. [2018-04-13 06:38:08,735 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-13 06:38:08,735 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 353 transitions. [2018-04-13 06:38:08,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-13 06:38:08,736 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:38:08,736 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] [2018-04-13 06:38:08,736 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:38:08,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1839300467, now seen corresponding path program 1 times [2018-04-13 06:38:08,736 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:38:08,736 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:38:08,737 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:38:08,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:38:08,737 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:38:08,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:38:08,745 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:38:08,748 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:38:08,748 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:38:08,748 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:38:08,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:38:08,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:38:08,775 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:38:08,784 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-13 06:38:08,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 06:38:08,789 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:08,790 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:08,798 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-13 06:38:08,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 8 treesize of output 7 [2018-04-13 06:38:08,800 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:08,801 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:08,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:08,807 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-04-13 06:38:08,819 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-13 06:38:08,821 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:08,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-13 06:38:08,822 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:08,827 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:08,839 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-13 06:38:08,841 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:08,842 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-13 06:38:08,842 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:08,846 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:08,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:08,854 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-04-13 06:38:08,950 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:08,951 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:08,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-13 06:38:08,952 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:08,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:08,966 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:71, output treesize:69 [2018-04-13 06:38:08,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-04-13 06:38:08,993 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:09,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-04-13 06:38:09,020 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:09,021 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:09,023 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:09,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 59 [2018-04-13 06:38:09,031 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-13 06:38:09,065 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 06:38:09,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 30 treesize of output 26 [2018-04-13 06:38:09,094 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:09,094 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:09,101 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 2 case distinctions, treesize of input 23 treesize of output 46 [2018-04-13 06:38:09,101 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-13 06:38:09,116 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 06:38:09,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-13 06:38:09,142 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:100, output treesize:256 [2018-04-13 06:38:09,245 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:09,250 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 129 treesize of output 123 [2018-04-13 06:38:09,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:38:09,253 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:09,271 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:09,325 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 119 treesize of output 110 [2018-04-13 06:38:09,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:38:09,327 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:09,344 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:09,413 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:09,417 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 104 treesize of output 98 [2018-04-13 06:38:09,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:38:09,419 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:09,432 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:09,474 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 94 treesize of output 85 [2018-04-13 06:38:09,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:38:09,476 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:09,489 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:09,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 06:38:09,528 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:234, output treesize:194 [2018-04-13 06:38:09,655 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 156 treesize of output 142 [2018-04-13 06:38:09,659 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 22 treesize of output 29 [2018-04-13 06:38:09,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:09,683 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:09,745 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 128 treesize of output 114 [2018-04-13 06:38:09,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 29 [2018-04-13 06:38:09,748 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:09,765 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:09,822 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 146 treesize of output 129 [2018-04-13 06:38:09,825 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 22 treesize of output 29 [2018-04-13 06:38:09,825 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:09,847 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:09,923 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 118 treesize of output 101 [2018-04-13 06:38:09,925 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 22 treesize of output 29 [2018-04-13 06:38:09,926 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:09,938 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:09,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 4 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-13 06:38:09,975 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 9 variables, input treesize:285, output treesize:245 [2018-04-13 06:38:10,236 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 156 treesize of output 135 [2018-04-13 06:38:10,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-04-13 06:38:10,239 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:10,264 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:10,265 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:10,265 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:38:10,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 51 [2018-04-13 06:38:10,272 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-13 06:38:10,302 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-13 06:38:10,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 79 [2018-04-13 06:38:10,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-04-13 06:38:10,368 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:10,384 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:10,384 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:10,384 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:38:10,385 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:10,386 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:10,386 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:38:10,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 43 [2018-04-13 06:38:10,387 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:10,398 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:10,400 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 87 treesize of output 71 [2018-04-13 06:38:10,403 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:10,403 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:10,404 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:38:10,405 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:10,406 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:38:10,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-04-13 06:38:10,407 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:10,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, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-04-13 06:38:10,421 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:10,437 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:10,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 89 [2018-04-13 06:38:10,479 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:38:10,480 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:10,481 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:38:10,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-04-13 06:38:10,481 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:10,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-13 06:38:10,493 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:10,501 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:10,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 49 [2018-04-13 06:38:10,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-13 06:38:10,531 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:10,539 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:10,540 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 19 treesize of output 17 [2018-04-13 06:38:10,541 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:10,546 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:10,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:10,573 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 14 variables, input treesize:255, output treesize:10 [2018-04-13 06:38:10,614 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-13 06:38:10,615 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 06:38:10,615 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-13 06:38:10,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-13 06:38:10,615 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-13 06:38:10,615 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=263, Unknown=5, NotChecked=0, Total=342 [2018-04-13 06:38:10,615 INFO L87 Difference]: Start difference. First operand 296 states and 353 transitions. Second operand 19 states. [2018-04-13 06:38:11,565 WARN L151 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 78 DAG size of output 77 [2018-04-13 06:38:12,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:38:12,430 INFO L93 Difference]: Finished difference Result 382 states and 455 transitions. [2018-04-13 06:38:12,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-13 06:38:12,457 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48 [2018-04-13 06:38:12,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:38:12,458 INFO L225 Difference]: With dead ends: 382 [2018-04-13 06:38:12,458 INFO L226 Difference]: Without dead ends: 382 [2018-04-13 06:38:12,458 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=303, Invalid=1168, Unknown=11, NotChecked=0, Total=1482 [2018-04-13 06:38:12,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-04-13 06:38:12,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 354. [2018-04-13 06:38:12,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-04-13 06:38:12,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 425 transitions. [2018-04-13 06:38:12,461 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 425 transitions. Word has length 48 [2018-04-13 06:38:12,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:38:12,461 INFO L459 AbstractCegarLoop]: Abstraction has 354 states and 425 transitions. [2018-04-13 06:38:12,461 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-13 06:38:12,461 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 425 transitions. [2018-04-13 06:38:12,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-13 06:38:12,461 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:38:12,462 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:38:12,462 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:38:12,462 INFO L82 PathProgramCache]: Analyzing trace with hash 920609223, now seen corresponding path program 1 times [2018-04-13 06:38:12,462 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:38:12,462 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:38:12,462 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:38:12,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:38:12,462 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:38:12,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:38:12,470 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:38:12,473 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:38:12,474 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:38:12,474 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:38:12,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:38:12,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:38:12,502 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:38:12,513 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-13 06:38:12,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:38:12,514 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:12,515 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:12,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 06:38:12,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 06:38:12,523 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:12,525 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:12,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:12,530 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:38, output treesize:30 [2018-04-13 06:38:12,539 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:12,540 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:12,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, 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-13 06:38:12,541 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:12,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:12,546 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:32 [2018-04-13 06:38:12,571 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-13 06:38:12,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-13 06:38:12,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:12,593 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:12,609 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-13 06:38:12,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 8 treesize of output 7 [2018-04-13 06:38:12,611 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:12,615 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:12,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:12,626 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:54, output treesize:46 [2018-04-13 06:38:12,643 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-13 06:38:12,646 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 14 treesize of output 15 [2018-04-13 06:38:12,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:12,650 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:12,662 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 31 [2018-04-13 06:38:12,663 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:38:12,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 22 [2018-04-13 06:38:12,664 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:12,668 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:12,675 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-13 06:38:12,675 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:65, output treesize:79 [2018-04-13 06:38:12,889 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:12,890 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:12,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 131 [2018-04-13 06:38:12,891 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:12,918 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:12,919 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:12,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 131 [2018-04-13 06:38:12,920 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:12,946 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 2 xjuncts. [2018-04-13 06:38:12,946 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:233, output treesize:237 [2018-04-13 06:38:13,082 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 118 treesize of output 104 [2018-04-13 06:38:13,082 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:13,095 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 118 treesize of output 104 [2018-04-13 06:38:13,095 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:13,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 93 [2018-04-13 06:38:13,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-13 06:38:13,121 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:13,131 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 45 treesize of output 32 [2018-04-13 06:38:13,132 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-13 06:38:13,139 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:38:13,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 89 [2018-04-13 06:38:13,161 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 20 treesize of output 17 [2018-04-13 06:38:13,161 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:13,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2018-04-13 06:38:13,172 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:38:13,179 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-13 06:38:13,198 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 64 treesize of output 48 [2018-04-13 06:38:13,199 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:13,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2018-04-13 06:38:13,200 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-13 06:38:13,208 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 16 treesize of output 13 [2018-04-13 06:38:13,208 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:13,214 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:13,229 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 66 treesize of output 50 [2018-04-13 06:38:13,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-04-13 06:38:13,230 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:13,238 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:13,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2018-04-13 06:38:13,239 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-04-13 06:38:13,243 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:13,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:13,249 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 7 variables, input treesize:237, output treesize:3 [2018-04-13 06:38:13,269 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:38:13,269 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:38:13,269 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-04-13 06:38:13,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-13 06:38:13,269 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-13 06:38:13,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=329, Unknown=1, NotChecked=0, Total=380 [2018-04-13 06:38:13,270 INFO L87 Difference]: Start difference. First operand 354 states and 425 transitions. Second operand 20 states. [2018-04-13 06:38:14,408 WARN L151 SmtUtils]: Spent 139ms on a formula simplification. DAG size of input: 97 DAG size of output 95 [2018-04-13 06:38:14,681 WARN L151 SmtUtils]: Spent 169ms on a formula simplification. DAG size of input: 104 DAG size of output 104 [2018-04-13 06:38:14,955 WARN L151 SmtUtils]: Spent 179ms on a formula simplification. DAG size of input: 136 DAG size of output 136 [2018-04-13 06:38:15,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:38:15,261 INFO L93 Difference]: Finished difference Result 368 states and 438 transitions. [2018-04-13 06:38:15,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-13 06:38:15,262 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 49 [2018-04-13 06:38:15,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:38:15,262 INFO L225 Difference]: With dead ends: 368 [2018-04-13 06:38:15,262 INFO L226 Difference]: Without dead ends: 359 [2018-04-13 06:38:15,263 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=293, Invalid=1266, Unknown=1, NotChecked=0, Total=1560 [2018-04-13 06:38:15,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-04-13 06:38:15,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 352. [2018-04-13 06:38:15,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2018-04-13 06:38:15,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 422 transitions. [2018-04-13 06:38:15,265 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 422 transitions. Word has length 49 [2018-04-13 06:38:15,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:38:15,266 INFO L459 AbstractCegarLoop]: Abstraction has 352 states and 422 transitions. [2018-04-13 06:38:15,266 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-13 06:38:15,266 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 422 transitions. [2018-04-13 06:38:15,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-13 06:38:15,266 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:38:15,266 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:38:15,266 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:38:15,266 INFO L82 PathProgramCache]: Analyzing trace with hash -2072224345, now seen corresponding path program 1 times [2018-04-13 06:38:15,266 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:38:15,267 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:38:15,267 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:38:15,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:38:15,267 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:38:15,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:38:15,274 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:38:15,278 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:38:15,278 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:38:15,278 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:38:15,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:38:15,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:38:15,300 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:38:15,308 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-13 06:38:15,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:38:15,309 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:15,310 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:15,316 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-13 06:38:15,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:38:15,317 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:15,318 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:15,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:15,323 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-04-13 06:38:15,331 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-13 06:38:15,333 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:15,333 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-13 06:38:15,334 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:15,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:15,354 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-13 06:38:15,356 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:15,356 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-13 06:38:15,357 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:15,360 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:15,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:15,366 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-04-13 06:38:15,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 38 [2018-04-13 06:38:15,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 29 treesize of output 28 [2018-04-13 06:38:15,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:15,461 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:15,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 38 [2018-04-13 06:38:15,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2018-04-13 06:38:15,480 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:15,490 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:15,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:15,498 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:64, output treesize:56 [2018-04-13 06:38:15,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 45 [2018-04-13 06:38:15,525 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:15,526 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:38:15,526 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 36 treesize of output 50 [2018-04-13 06:38:15,526 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:15,551 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:15,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 45 [2018-04-13 06:38:15,579 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:15,580 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 36 treesize of output 43 [2018-04-13 06:38:15,580 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:15,598 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:15,598 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:15,599 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:38:15,600 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 26 treesize of output 42 [2018-04-13 06:38:15,601 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:15,617 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 06:38:15,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 06:38:15,634 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:82, output treesize:202 [2018-04-13 06:38:15,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 123 [2018-04-13 06:38:15,906 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:15,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 66 [2018-04-13 06:38:15,931 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:15,953 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 2 xjuncts. [2018-04-13 06:38:15,953 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:192, output treesize:190 [2018-04-13 06:38:16,111 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:16,111 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:16,112 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:16,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 142 [2018-04-13 06:38:16,113 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:16,150 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:16,151 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:16,151 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:16,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 142 [2018-04-13 06:38:16,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:16,185 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 2 xjuncts. [2018-04-13 06:38:16,186 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:291, output treesize:285 [2018-04-13 06:38:16,281 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 148 treesize of output 143 [2018-04-13 06:38:16,281 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:16,283 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 148 treesize of output 143 [2018-04-13 06:38:16,283 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:16,330 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 143 treesize of output 138 [2018-04-13 06:38:16,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 144 treesize of output 143 [2018-04-13 06:38:16,333 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:16,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 119 treesize of output 117 [2018-04-13 06:38:16,392 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-13 06:38:16,444 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-13 06:38:16,501 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 139 treesize of output 111 [2018-04-13 06:38:16,503 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:16,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 10 [2018-04-13 06:38:16,504 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:16,516 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 46 treesize of output 34 [2018-04-13 06:38:16,517 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:38:16,526 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-13 06:38:16,528 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 109 treesize of output 89 [2018-04-13 06:38:16,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 38 [2018-04-13 06:38:16,529 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-13 06:38:16,542 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:16,543 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-13 06:38:16,543 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:16,553 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:38:16,599 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 143 treesize of output 109 [2018-04-13 06:38:16,601 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:16,602 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 23 treesize of output 29 [2018-04-13 06:38:16,602 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:16,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 44 [2018-04-13 06:38:16,624 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:38:16,637 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:38:16,682 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 82 treesize of output 85 [2018-04-13 06:38:16,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 82 [2018-04-13 06:38:16,685 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:16,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 68 [2018-04-13 06:38:16,739 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-13 06:38:16,772 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-13 06:38:16,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2018-04-13 06:38:16,824 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 7 variables, input treesize:297, output treesize:271 [2018-04-13 06:38:17,012 WARN L151 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 102 DAG size of output 59 [2018-04-13 06:38:17,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2018-04-13 06:38:17,018 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:17,018 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 13 treesize of output 6 [2018-04-13 06:38:17,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:17,027 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:17,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 06:38:17,028 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:17,033 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:17,056 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 78 treesize of output 69 [2018-04-13 06:38:17,058 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:17,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, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2018-04-13 06:38:17,058 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:17,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 36 [2018-04-13 06:38:17,084 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-13 06:38:17,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 53 [2018-04-13 06:38:17,114 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:17,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 44 [2018-04-13 06:38:17,137 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:17,160 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:17,161 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 36 treesize of output 30 [2018-04-13 06:38:17,161 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:17,194 INFO L267 ElimStorePlain]: Start of recursive call 5: 5 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-13 06:38:17,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-13 06:38:17,217 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:136, output treesize:92 [2018-04-13 06:38:17,285 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:38:17,285 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:38:17,285 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-04-13 06:38:17,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-13 06:38:17,286 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-13 06:38:17,286 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=435, Unknown=7, NotChecked=0, Total=506 [2018-04-13 06:38:17,286 INFO L87 Difference]: Start difference. First operand 352 states and 422 transitions. Second operand 23 states. [2018-04-13 06:38:18,348 WARN L151 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 101 DAG size of output 93 [2018-04-13 06:38:18,588 WARN L151 SmtUtils]: Spent 141ms on a formula simplification. DAG size of input: 134 DAG size of output 126 [2018-04-13 06:38:18,790 WARN L151 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 125 DAG size of output 123 [2018-04-13 06:38:19,046 WARN L151 SmtUtils]: Spent 204ms on a formula simplification. DAG size of input: 103 DAG size of output 101 [2018-04-13 06:38:19,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:38:19,545 INFO L93 Difference]: Finished difference Result 371 states and 441 transitions. [2018-04-13 06:38:19,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-13 06:38:19,545 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 49 [2018-04-13 06:38:19,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:38:19,546 INFO L225 Difference]: With dead ends: 371 [2018-04-13 06:38:19,546 INFO L226 Difference]: Without dead ends: 340 [2018-04-13 06:38:19,547 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=279, Invalid=1516, Unknown=11, NotChecked=0, Total=1806 [2018-04-13 06:38:19,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-04-13 06:38:19,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 336. [2018-04-13 06:38:19,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-04-13 06:38:19,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 404 transitions. [2018-04-13 06:38:19,549 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 404 transitions. Word has length 49 [2018-04-13 06:38:19,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:38:19,549 INFO L459 AbstractCegarLoop]: Abstraction has 336 states and 404 transitions. [2018-04-13 06:38:19,549 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-13 06:38:19,549 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 404 transitions. [2018-04-13 06:38:19,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-13 06:38:19,550 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:38:19,550 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:38:19,550 INFO L408 AbstractCegarLoop]: === Iteration 40 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:38:19,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1231044758, now seen corresponding path program 1 times [2018-04-13 06:38:19,550 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:38:19,550 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:38:19,550 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:38:19,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:38:19,550 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:38:19,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:38:19,556 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:38:19,602 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-13 06:38:19,603 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:38:19,603 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-13 06:38:19,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-13 06:38:19,603 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-13 06:38:19,603 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-13 06:38:19,603 INFO L87 Difference]: Start difference. First operand 336 states and 404 transitions. Second operand 7 states. [2018-04-13 06:38:19,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:38:19,726 INFO L93 Difference]: Finished difference Result 426 states and 507 transitions. [2018-04-13 06:38:19,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-13 06:38:19,726 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-04-13 06:38:19,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:38:19,727 INFO L225 Difference]: With dead ends: 426 [2018-04-13 06:38:19,727 INFO L226 Difference]: Without dead ends: 426 [2018-04-13 06:38:19,727 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-04-13 06:38:19,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-04-13 06:38:19,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 364. [2018-04-13 06:38:19,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-04-13 06:38:19,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 432 transitions. [2018-04-13 06:38:19,730 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 432 transitions. Word has length 50 [2018-04-13 06:38:19,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:38:19,730 INFO L459 AbstractCegarLoop]: Abstraction has 364 states and 432 transitions. [2018-04-13 06:38:19,730 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-13 06:38:19,730 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 432 transitions. [2018-04-13 06:38:19,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-13 06:38:19,731 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:38:19,731 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:38:19,731 INFO L408 AbstractCegarLoop]: === Iteration 41 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:38:19,731 INFO L82 PathProgramCache]: Analyzing trace with hash 155158636, now seen corresponding path program 1 times [2018-04-13 06:38:19,731 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:38:19,731 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:38:19,731 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:38:19,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:38:19,732 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:38:19,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:38:19,735 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:38:19,736 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:38:19,736 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:38:19,736 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:38:19,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:38:19,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:38:19,749 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:38:19,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 06:38:19,760 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:19,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:19,761 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-13 06:38:19,769 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-13 06:38:19,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 06:38:19,770 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:19,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:19,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-13 06:38:19,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:38:19,782 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:19,783 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:19,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:19,789 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2018-04-13 06:38:19,801 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-13 06:38:19,803 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:19,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-13 06:38:19,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:19,808 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:19,828 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-13 06:38:19,831 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:19,831 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-13 06:38:19,832 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:19,836 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:19,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:19,842 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:49, output treesize:41 [2018-04-13 06:38:19,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2018-04-13 06:38:19,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:19,873 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-13 06:38:19,873 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:54, output treesize:45 [2018-04-13 06:38:19,889 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-13 06:38:19,895 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:38:19,895 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:19,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-04-13 06:38:19,896 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:19,898 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:19,904 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-13 06:38:19,905 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:38:19,906 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:19,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-04-13 06:38:19,906 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:19,908 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:19,911 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-13 06:38:19,911 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:56, output treesize:7 [2018-04-13 06:38:19,926 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-13 06:38:19,926 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 06:38:19,927 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-13 06:38:19,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-13 06:38:19,927 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-13 06:38:19,927 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-04-13 06:38:19,927 INFO L87 Difference]: Start difference. First operand 364 states and 432 transitions. Second operand 10 states. [2018-04-13 06:38:20,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:38:20,257 INFO L93 Difference]: Finished difference Result 361 states and 426 transitions. [2018-04-13 06:38:20,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-13 06:38:20,257 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2018-04-13 06:38:20,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:38:20,258 INFO L225 Difference]: With dead ends: 361 [2018-04-13 06:38:20,258 INFO L226 Difference]: Without dead ends: 349 [2018-04-13 06:38:20,258 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2018-04-13 06:38:20,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-04-13 06:38:20,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 340. [2018-04-13 06:38:20,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-04-13 06:38:20,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 405 transitions. [2018-04-13 06:38:20,261 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 405 transitions. Word has length 50 [2018-04-13 06:38:20,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:38:20,261 INFO L459 AbstractCegarLoop]: Abstraction has 340 states and 405 transitions. [2018-04-13 06:38:20,261 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-13 06:38:20,261 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 405 transitions. [2018-04-13 06:38:20,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-13 06:38:20,261 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:38:20,261 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] [2018-04-13 06:38:20,261 INFO L408 AbstractCegarLoop]: === Iteration 42 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:38:20,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1631945113, now seen corresponding path program 1 times [2018-04-13 06:38:20,261 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:38:20,262 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:38:20,262 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:38:20,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:38:20,262 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:38:20,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:38:20,272 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:38:20,275 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:38:20,275 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:38:20,275 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:38:20,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:38:20,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:38:20,296 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:38:20,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 06:38:20,308 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:20,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:20,312 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-04-13 06:38:20,322 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-13 06:38:20,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:38:20,324 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:20,325 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:20,356 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-13 06:38:20,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 06:38:20,358 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:20,360 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:20,371 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-13 06:38:20,371 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:30 [2018-04-13 06:38:20,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 64 [2018-04-13 06:38:20,431 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:20,433 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 47 treesize of output 60 [2018-04-13 06:38:20,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:20,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 48 [2018-04-13 06:38:20,464 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:20,474 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:20,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 61 [2018-04-13 06:38:20,510 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:38:20,510 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:20,536 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:20,549 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-13 06:38:20,549 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:88, output treesize:68 [2018-04-13 06:38:20,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 81 [2018-04-13 06:38:20,598 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:20,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 65 [2018-04-13 06:38:20,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 06:38:20,646 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 71 treesize of output 78 [2018-04-13 06:38:20,646 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:20,669 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 06:38:20,694 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:38:20,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 65 [2018-04-13 06:38:20,696 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:20,697 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:38:20,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-04-13 06:38:20,697 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:20,706 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:20,719 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 96 treesize of output 104 [2018-04-13 06:38:20,722 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:20,724 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:38:20,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 101 [2018-04-13 06:38:20,725 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:20,752 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 79 treesize of output 86 [2018-04-13 06:38:20,752 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:20,766 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:20,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-13 06:38:20,792 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:112, output treesize:140 [2018-04-13 06:38:21,058 WARN L151 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 50 DAG size of output 48 [2018-04-13 06:38:21,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 41 [2018-04-13 06:38:21,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 37 treesize of output 32 [2018-04-13 06:38:21,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:21,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 21 [2018-04-13 06:38:21,097 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:21,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2018-04-13 06:38:21,107 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:21,114 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:21,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 29 [2018-04-13 06:38:21,125 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:21,126 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:38:21,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 14 [2018-04-13 06:38:21,126 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:21,134 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:21,138 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-13 06:38:21,138 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:71, output treesize:16 [2018-04-13 06:38:21,170 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:38:21,170 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 06:38:21,170 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-13 06:38:21,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-13 06:38:21,170 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-13 06:38:21,170 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2018-04-13 06:38:21,170 INFO L87 Difference]: Start difference. First operand 340 states and 405 transitions. Second operand 17 states. [2018-04-13 06:38:22,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:38:22,525 INFO L93 Difference]: Finished difference Result 579 states and 680 transitions. [2018-04-13 06:38:22,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-13 06:38:22,525 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2018-04-13 06:38:22,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:38:22,527 INFO L225 Difference]: With dead ends: 579 [2018-04-13 06:38:22,527 INFO L226 Difference]: Without dead ends: 579 [2018-04-13 06:38:22,527 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=324, Invalid=1082, Unknown=0, NotChecked=0, Total=1406 [2018-04-13 06:38:22,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2018-04-13 06:38:22,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 378. [2018-04-13 06:38:22,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2018-04-13 06:38:22,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 451 transitions. [2018-04-13 06:38:22,532 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 451 transitions. Word has length 56 [2018-04-13 06:38:22,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:38:22,532 INFO L459 AbstractCegarLoop]: Abstraction has 378 states and 451 transitions. [2018-04-13 06:38:22,532 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-13 06:38:22,532 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 451 transitions. [2018-04-13 06:38:22,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-13 06:38:22,533 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:38:22,533 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] [2018-04-13 06:38:22,533 INFO L408 AbstractCegarLoop]: === Iteration 43 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:38:22,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1626219474, now seen corresponding path program 1 times [2018-04-13 06:38:22,533 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:38:22,533 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:38:22,534 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:38:22,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:38:22,534 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:38:22,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:38:22,544 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:38:22,547 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:38:22,547 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:38:22,547 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:38:22,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:38:22,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:38:22,600 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:38:22,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 06:38:22,615 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:22,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:22,618 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 06:38:22,640 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:22,641 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:22,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-13 06:38:22,642 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:22,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:22,652 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-04-13 06:38:22,668 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-13 06:38:22,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, 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-13 06:38:22,670 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:22,672 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:22,684 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-13 06:38:22,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:38:22,686 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:22,687 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:22,696 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-13 06:38:22,696 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:54, output treesize:39 [2018-04-13 06:38:22,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-04-13 06:38:22,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-13 06:38:22,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:22,714 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:22,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:22,722 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:42 [2018-04-13 06:38:22,755 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:22,783 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 37 treesize of output 44 [2018-04-13 06:38:22,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:38:22,785 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:22,790 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:22,798 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-13 06:38:22,799 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:57, output treesize:49 [2018-04-13 06:38:22,835 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:38:22,835 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:22,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 51 [2018-04-13 06:38:22,844 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 20 treesize of output 25 [2018-04-13 06:38:22,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:22,849 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:22,858 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-13 06:38:22,858 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:70, output treesize:62 [2018-04-13 06:38:22,879 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:22,880 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:22,880 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:22,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 50 [2018-04-13 06:38:22,881 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:22,893 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-13 06:38:22,893 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:66 [2018-04-13 06:38:22,916 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:22,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 51 [2018-04-13 06:38:22,923 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:22,923 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 45 treesize of output 63 [2018-04-13 06:38:22,924 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:22,934 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:22,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:38:22,949 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:79, output treesize:84 [2018-04-13 06:38:23,014 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:23,014 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:23,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 105 [2018-04-13 06:38:23,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-13 06:38:23,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:23,035 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:23,050 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-13 06:38:23,050 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:107, output treesize:97 [2018-04-13 06:38:23,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 91 [2018-04-13 06:38:23,131 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 22 treesize of output 29 [2018-04-13 06:38:23,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:23,139 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:38:23,151 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-13 06:38:23,151 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:116, output treesize:106 [2018-04-13 06:38:29,274 WARN L151 SmtUtils]: Spent 2107ms on a formula simplification. DAG size of input: 43 DAG size of output 39 [2018-04-13 06:38:33,349 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 62 [2018-04-13 06:38:33,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-13 06:38:33,353 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:33,360 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:38:33,360 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:38:33,361 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 40 treesize of output 30 [2018-04-13 06:38:33,361 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-13 06:38:33,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 5 treesize of output 1 [2018-04-13 06:38:33,368 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:38:33,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:38:33,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 06:38:33,379 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:95, output treesize:28 [2018-04-13 06:38:33,474 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:38:33,474 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 06:38:33,474 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-13 06:38:33,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-13 06:38:33,475 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-13 06:38:33,475 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=304, Unknown=4, NotChecked=0, Total=380 [2018-04-13 06:38:33,475 INFO L87 Difference]: Start difference. First operand 378 states and 451 transitions. Second operand 20 states. [2018-04-13 06:39:12,719 WARN L151 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 118 DAG size of output 74 [2018-04-13 06:40:48,805 WARN L151 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 76 DAG size of output 59 [2018-04-13 06:40:59,312 WARN L151 SmtUtils]: Spent 209ms on a formula simplification. DAG size of input: 109 DAG size of output 68 [2018-04-13 06:40:59,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:40:59,316 INFO L93 Difference]: Finished difference Result 942 states and 1130 transitions. [2018-04-13 06:40:59,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-04-13 06:40:59,317 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 56 [2018-04-13 06:40:59,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:40:59,319 INFO L225 Difference]: With dead ends: 942 [2018-04-13 06:40:59,319 INFO L226 Difference]: Without dead ends: 942 [2018-04-13 06:40:59,319 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 816 ImplicationChecksByTransitivity, 121.3s TimeCoverageRelationStatistics Valid=820, Invalid=2662, Unknown=58, NotChecked=0, Total=3540 [2018-04-13 06:40:59,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2018-04-13 06:40:59,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 675. [2018-04-13 06:40:59,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 675 states. [2018-04-13 06:40:59,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 837 transitions. [2018-04-13 06:40:59,326 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 837 transitions. Word has length 56 [2018-04-13 06:40:59,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:40:59,327 INFO L459 AbstractCegarLoop]: Abstraction has 675 states and 837 transitions. [2018-04-13 06:40:59,327 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-13 06:40:59,327 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 837 transitions. [2018-04-13 06:40:59,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-13 06:40:59,327 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:40:59,327 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] [2018-04-13 06:40:59,327 INFO L408 AbstractCegarLoop]: === Iteration 44 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:40:59,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1626219475, now seen corresponding path program 1 times [2018-04-13 06:40:59,327 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:40:59,327 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:40:59,328 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:40:59,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:40:59,328 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:40:59,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:40:59,335 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:40:59,338 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:40:59,338 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:40:59,338 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:40:59,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:40:59,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:40:59,384 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:40:59,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:40:59,412 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:40:59,423 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:40:59,424 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:40:59,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-13 06:40:59,425 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:40:59,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:40:59,434 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:35 [2018-04-13 06:40:59,459 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-13 06:40:59,473 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-13 06:40:59,473 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:40:59,475 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:40:59,489 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-13 06:40:59,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:40:59,491 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:40:59,492 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:40:59,503 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-13 06:40:59,503 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:59, output treesize:51 [2018-04-13 06:40:59,537 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:40:59,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 72 [2018-04-13 06:40:59,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:40:59,543 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:40:59,549 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:40:59,562 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:40:59,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-04-13 06:40:59,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:40:59,565 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:40:59,568 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:40:59,579 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-13 06:40:59,579 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:89, output treesize:73 [2018-04-13 06:40:59,627 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:40:59,628 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:40:59,632 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 40 treesize of output 46 [2018-04-13 06:40:59,652 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 20 treesize of output 25 [2018-04-13 06:40:59,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:40:59,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:40:59,676 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:40:59,676 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:40:59,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 84 [2018-04-13 06:40:59,683 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 20 treesize of output 25 [2018-04-13 06:40:59,684 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:40:59,692 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:40:59,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 06:40:59,705 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:115, output treesize:99 [2018-04-13 06:41:03,765 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:41:03,765 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-13 06:41:03,765 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:41:03,793 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:41:03,793 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:41:03,794 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:41:03,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-13 06:41:03,795 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:41:03,808 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-13 06:41:03,808 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:91, output treesize:83 [2018-04-13 06:41:03,834 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:41:03,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 64 [2018-04-13 06:41:03,840 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:41:03,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, 5 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 78 [2018-04-13 06:41:03,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:41:03,849 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:41:03,870 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 34 treesize of output 40 [2018-04-13 06:41:03,872 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:41:03,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-13 06:41:03,873 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:41:03,878 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:41:03,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:41:03,892 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:106, output treesize:107 [2018-04-13 06:41:03,951 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:41:03,952 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:41:03,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 88 [2018-04-13 06:41:03,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:41:03,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:41:03,979 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:41:04,013 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:41:04,014 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:41:04,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 133 [2018-04-13 06:41:04,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-13 06:41:04,022 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:41:04,035 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:41:04,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 06:41:04,056 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:165, output treesize:145 [2018-04-13 06:41:04,201 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 86 treesize of output 101 [2018-04-13 06:41:04,203 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:41:04,204 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-13 06:41:04,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:41:04,223 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:41:04,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 134 [2018-04-13 06:41:04,257 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:41:04,258 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-13 06:41:04,258 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:41:04,272 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:41:04,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-13 06:41:04,295 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:198, output treesize:178 [2018-04-13 06:41:04,600 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:41:04,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 122 [2018-04-13 06:41:04,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 7 treesize of output 1 [2018-04-13 06:41:04,602 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:41:04,617 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:41:04,618 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-13 06:41:04,618 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:41:04,631 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:41:04,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, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 61 [2018-04-13 06:41:04,632 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-13 06:41:04,642 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:41:04,667 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 67 treesize of output 63 [2018-04-13 06:41:04,669 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:41:04,669 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-13 06:41:04,669 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 06:41:04,680 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:41:04,680 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:41:04,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 19 [2018-04-13 06:41:04,681 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-13 06:41:04,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, 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-13 06:41:04,686 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 06:41:04,689 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:41:04,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:41:04,701 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:206, output treesize:25 [2018-04-13 06:41:04,800 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:41:04,801 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 06:41:04,801 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-13 06:41:04,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-13 06:41:04,801 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-13 06:41:04,801 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=494, Unknown=2, NotChecked=0, Total=600 [2018-04-13 06:41:04,802 INFO L87 Difference]: Start difference. First operand 675 states and 837 transitions. Second operand 25 states. [2018-04-13 06:41:07,202 WARN L151 SmtUtils]: Spent 2038ms on a formula simplification. DAG size of input: 65 DAG size of output 56 [2018-04-13 06:41:07,802 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 101 DAG size of output 88 [2018-04-13 06:41:08,190 WARN L151 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 118 DAG size of output 87 [2018-04-13 06:41:08,925 WARN L151 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 175 DAG size of output 103 [2018-04-13 06:41:09,110 WARN L151 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 175 DAG size of output 99 [2018-04-13 06:41:11,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:41:11,185 INFO L93 Difference]: Finished difference Result 1045 states and 1280 transitions. [2018-04-13 06:41:11,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-13 06:41:11,185 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 56 [2018-04-13 06:41:11,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:41:11,187 INFO L225 Difference]: With dead ends: 1045 [2018-04-13 06:41:11,187 INFO L226 Difference]: Without dead ends: 1045 [2018-04-13 06:41:11,188 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 732 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=854, Invalid=2804, Unknown=2, NotChecked=0, Total=3660 [2018-04-13 06:41:11,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2018-04-13 06:41:11,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 899. [2018-04-13 06:41:11,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2018-04-13 06:41:11,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1123 transitions. [2018-04-13 06:41:11,194 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1123 transitions. Word has length 56 [2018-04-13 06:41:11,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:41:11,194 INFO L459 AbstractCegarLoop]: Abstraction has 899 states and 1123 transitions. [2018-04-13 06:41:11,194 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-13 06:41:11,194 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1123 transitions. [2018-04-13 06:41:11,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-13 06:41:11,194 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:41:11,194 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-13 06:41:11,194 INFO L408 AbstractCegarLoop]: === Iteration 45 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:41:11,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1865966095, now seen corresponding path program 1 times [2018-04-13 06:41:11,195 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:41:11,195 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:41:11,195 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:41:11,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:41:11,195 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:41:11,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:41:11,205 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:41:11,210 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:41:11,210 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:41:11,210 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:41:11,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:41:11,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:41:11,254 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:41:11,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 6 treesize of output 5 [2018-04-13 06:41:11,271 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:41:11,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:41:11,275 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 06:41:11,320 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:41:11,321 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:41:11,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-13 06:41:11,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:41:11,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 06:41:11,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:41:11,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:41:11,335 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2018-04-13 06:41:11,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-13 06:41:11,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-13 06:41:11,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:41:11,352 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:41:11,361 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-13 06:41:11,361 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:42 [2018-04-13 06:41:11,393 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:41:11,396 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 45 treesize of output 44 [2018-04-13 06:41:11,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-13 06:41:11,404 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:41:11,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:41:11,434 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-13 06:41:11,434 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:53 [2018-04-13 06:41:11,478 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:41:11,479 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:41:11,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2018-04-13 06:41:11,488 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 20 treesize of output 25 [2018-04-13 06:41:11,488 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:41:11,495 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:41:11,506 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-13 06:41:11,506 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:74, output treesize:66 [2018-04-13 06:41:17,540 WARN L151 SmtUtils]: Spent 2016ms on a formula simplification. DAG size of input: 35 DAG size of output 31 [2018-04-13 06:41:17,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, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 12 [2018-04-13 06:41:17,542 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:41:17,547 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-13 06:41:17,547 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:59, output treesize:41 [2018-04-13 06:41:17,589 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:41:17,589 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:41:17,589 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-13 06:41:17,589 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:41:17,595 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-13 06:41:17,595 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:43 [2018-04-13 06:41:17,627 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:41:17,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 69 [2018-04-13 06:41:17,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 57 [2018-04-13 06:41:17,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:41:17,650 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:41:17,656 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-13 06:41:17,656 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:46 [2018-04-13 06:41:17,674 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:41:17,676 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:41:17,679 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:41:17,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 80 [2018-04-13 06:41:17,695 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 83 [2018-04-13 06:41:17,695 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-13 06:41:17,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 45 [2018-04-13 06:41:17,730 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-13 06:41:17,744 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 06:41:17,757 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 2 xjuncts. [2018-04-13 06:41:17,757 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:54, output treesize:97 [2018-04-13 06:41:17,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-13 06:41:17,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:41:17,885 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:41:17,886 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:41:17,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 60 [2018-04-13 06:41:17,900 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 59 [2018-04-13 06:41:17,901 INFO L267 ElimStorePlain]: Start of recursive call 4: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 7 xjuncts. [2018-04-13 06:41:17,927 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 44 treesize of output 41 [2018-04-13 06:41:17,928 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-13 06:41:17,949 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 23 treesize of output 16 [2018-04-13 06:41:17,950 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:41:17,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 33 treesize of output 24 [2018-04-13 06:41:17,951 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 06:41:17,970 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 1 case distinctions, treesize of input 23 treesize of output 19 [2018-04-13 06:41:17,971 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-04-13 06:41:17,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 23 [2018-04-13 06:41:17,975 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-04-13 06:41:17,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 4 [2018-04-13 06:41:17,990 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-13 06:41:17,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 4 [2018-04-13 06:41:17,991 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-13 06:41:17,996 INFO L267 ElimStorePlain]: Start of recursive call 3: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 06:41:18,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 06:41:18,001 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:82, output treesize:22 [2018-04-13 06:41:18,051 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-13 06:41:18,052 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 06:41:18,052 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-13 06:41:18,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-13 06:41:18,052 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-13 06:41:18,052 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=479, Unknown=2, NotChecked=0, Total=552 [2018-04-13 06:41:18,052 INFO L87 Difference]: Start difference. First operand 899 states and 1123 transitions. Second operand 24 states. [2018-04-13 06:41:20,405 WARN L151 SmtUtils]: Spent 2031ms on a formula simplification. DAG size of input: 53 DAG size of output 49 [2018-04-13 06:41:22,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:41:22,165 INFO L93 Difference]: Finished difference Result 1175 states and 1455 transitions. [2018-04-13 06:41:22,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-13 06:41:22,165 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 61 [2018-04-13 06:41:22,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:41:22,169 INFO L225 Difference]: With dead ends: 1175 [2018-04-13 06:41:22,169 INFO L226 Difference]: Without dead ends: 1165 [2018-04-13 06:41:22,169 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=445, Invalid=2103, Unknown=2, NotChecked=0, Total=2550 [2018-04-13 06:41:22,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2018-04-13 06:41:22,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 1039. [2018-04-13 06:41:22,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1039 states. [2018-04-13 06:41:22,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 1306 transitions. [2018-04-13 06:41:22,182 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 1306 transitions. Word has length 61 [2018-04-13 06:41:22,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:41:22,182 INFO L459 AbstractCegarLoop]: Abstraction has 1039 states and 1306 transitions. [2018-04-13 06:41:22,182 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-13 06:41:22,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1306 transitions. [2018-04-13 06:41:22,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-13 06:41:22,183 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:41:22,183 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-13 06:41:22,183 INFO L408 AbstractCegarLoop]: === Iteration 46 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:41:22,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1069104113, now seen corresponding path program 1 times [2018-04-13 06:41:22,184 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:41:22,184 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:41:22,184 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:41:22,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:41:22,185 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:41:22,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:41:22,195 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:41:22,199 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:41:22,199 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:41:22,199 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:41:22,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:41:22,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:41:22,234 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:41:22,260 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:41:22,260 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:41:22,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-13 06:41:22,261 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:41:22,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:41:22,270 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:28 [2018-04-13 06:41:22,286 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-13 06:41:22,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-13 06:41:22,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:41:22,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:41:22,300 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-13 06:41:22,300 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:46 [2018-04-13 06:41:22,337 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:41:22,342 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 55 treesize of output 52 [2018-04-13 06:41:22,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-13 06:41:22,345 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:41:22,351 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:41:22,362 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-13 06:41:22,362 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:59 [2018-04-13 06:41:22,408 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 70 treesize of output 56 [2018-04-13 06:41:22,411 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 22 treesize of output 29 [2018-04-13 06:41:22,411 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:41:22,419 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:41:22,430 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-13 06:41:22,431 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:81, output treesize:71 [2018-04-13 06:41:26,452 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:41:26,453 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:41:26,454 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:41:26,454 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-04-13 06:41:26,454 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:41:26,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-13 06:41:26,464 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:79, output treesize:72 [2018-04-13 06:41:26,507 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 70 treesize of output 68 [2018-04-13 06:41:26,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:41:26,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:41:26,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:41:26,526 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-13 06:41:26,527 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:83, output treesize:79 [2018-04-13 06:41:26,548 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:41:26,549 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 77 treesize of output 82 [2018-04-13 06:41:26,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2018-04-13 06:41:26,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:41:26,558 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:41:26,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-13 06:41:26,567 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:87, output treesize:96 [2018-04-13 06:41:26,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, 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-13 06:41:26,700 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:41:26,711 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-13 06:41:26,711 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:111, output treesize:106 [2018-04-13 06:41:26,742 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:41:26,744 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:41:26,744 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 73 [2018-04-13 06:41:26,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-04-13 06:41:26,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:41:26,755 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 22 treesize of output 13 [2018-04-13 06:41:26,755 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:41:26,763 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 24 treesize of output 21 [2018-04-13 06:41:26,763 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-13 06:41:26,766 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 06:41:26,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 06:41:26,773 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:112, output treesize:22 [2018-04-13 06:41:26,832 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-13 06:41:26,832 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 06:41:26,832 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-13 06:41:26,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-13 06:41:26,832 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-13 06:41:26,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=451, Unknown=2, NotChecked=0, Total=506 [2018-04-13 06:41:26,833 INFO L87 Difference]: Start difference. First operand 1039 states and 1306 transitions. Second operand 23 states. [2018-04-13 06:41:45,330 WARN L151 SmtUtils]: Spent 4045ms on a formula simplification. DAG size of input: 52 DAG size of output 49 [2018-04-13 06:42:05,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:42:05,281 INFO L93 Difference]: Finished difference Result 1403 states and 1731 transitions. [2018-04-13 06:42:05,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-13 06:42:05,281 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 61 [2018-04-13 06:42:05,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:42:05,284 INFO L225 Difference]: With dead ends: 1403 [2018-04-13 06:42:05,284 INFO L226 Difference]: Without dead ends: 1402 [2018-04-13 06:42:05,284 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 35.6s TimeCoverageRelationStatistics Valid=401, Invalid=2034, Unknown=15, NotChecked=0, Total=2450 [2018-04-13 06:42:05,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2018-04-13 06:42:05,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1103. [2018-04-13 06:42:05,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1103 states. [2018-04-13 06:42:05,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1381 transitions. [2018-04-13 06:42:05,293 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1381 transitions. Word has length 61 [2018-04-13 06:42:05,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:42:05,293 INFO L459 AbstractCegarLoop]: Abstraction has 1103 states and 1381 transitions. [2018-04-13 06:42:05,293 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-13 06:42:05,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1381 transitions. [2018-04-13 06:42:05,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-13 06:42:05,294 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:42:05,294 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:42:05,294 INFO L408 AbstractCegarLoop]: === Iteration 47 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:42:05,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1218577044, now seen corresponding path program 1 times [2018-04-13 06:42:05,294 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:42:05,294 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:42:05,295 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:42:05,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:42:05,295 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:42:05,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:42:05,303 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:42:05,306 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:42:05,306 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:42:05,306 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:42:05,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:42:05,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:42:05,335 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:42:05,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:42:05,336 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:42:05,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:42:05,337 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-13 06:42:05,356 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:42:05,356 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-13 06:42:05,356 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:42:05,367 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:42:05,368 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:42:05,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-13 06:42:05,368 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:42:05,384 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-13 06:42:05,384 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:34 [2018-04-13 06:42:05,455 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:42:05,456 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:42:05,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, 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 28 [2018-04-13 06:42:05,457 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:42:05,479 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:42:05,480 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:42:05,480 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:42:05,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 37 [2018-04-13 06:42:05,481 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:42:05,497 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-13 06:42:05,498 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:55 [2018-04-13 06:42:05,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-13 06:42:05,534 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:42:05,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-13 06:42:05,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-13 06:42:05,557 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:42:05,559 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:42:05,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-13 06:42:05,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-13 06:42:05,588 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:42:05,590 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:42:05,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:42:05,605 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:86, output treesize:64 [2018-04-13 06:42:05,677 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:42:05,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 46 [2018-04-13 06:42:05,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:42:05,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:42:05,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:42:05,714 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:42:05,729 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 0 case distinctions, treesize of input 68 treesize of output 65 [2018-04-13 06:42:05,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:42:05,731 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:42:05,738 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:42:05,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 06:42:05,758 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:122, output treesize:102 [2018-04-13 06:42:05,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 106 [2018-04-13 06:42:05,848 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:42:05,848 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-13 06:42:05,849 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:42:05,863 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:42:05,889 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 84 treesize of output 77 [2018-04-13 06:42:05,892 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:42:05,892 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-13 06:42:05,892 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:42:05,901 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:42:05,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 06:42:05,918 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:158, output treesize:138 [2018-04-13 06:42:05,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2018-04-13 06:42:05,993 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:42:06,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:42:06,009 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:145, output treesize:106 [2018-04-13 06:42:06,116 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 121 treesize of output 96 [2018-04-13 06:42:06,118 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:42:06,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2018-04-13 06:42:06,118 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:42:06,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 42 [2018-04-13 06:42:06,126 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-13 06:42:06,131 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-13 06:42:06,143 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 56 treesize of output 46 [2018-04-13 06:42:06,144 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:42:06,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 14 [2018-04-13 06:42:06,145 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:42:06,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-04-13 06:42:06,160 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 06:42:06,162 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:42:06,166 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-13 06:42:06,166 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:148, output treesize:7 [2018-04-13 06:42:06,228 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:42:06,228 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 06:42:06,228 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-13 06:42:06,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-13 06:42:06,229 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-13 06:42:06,229 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2018-04-13 06:42:06,229 INFO L87 Difference]: Start difference. First operand 1103 states and 1381 transitions. Second operand 19 states. [2018-04-13 06:42:10,698 WARN L151 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 129 DAG size of output 78 [2018-04-13 06:42:12,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:42:12,128 INFO L93 Difference]: Finished difference Result 1952 states and 2421 transitions. [2018-04-13 06:42:12,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-13 06:42:12,129 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 66 [2018-04-13 06:42:12,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:42:12,134 INFO L225 Difference]: With dead ends: 1952 [2018-04-13 06:42:12,134 INFO L226 Difference]: Without dead ends: 1952 [2018-04-13 06:42:12,135 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=605, Invalid=2151, Unknown=0, NotChecked=0, Total=2756 [2018-04-13 06:42:12,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1952 states. [2018-04-13 06:42:12,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1952 to 1442. [2018-04-13 06:42:12,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1442 states. [2018-04-13 06:42:12,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1442 states to 1442 states and 1823 transitions. [2018-04-13 06:42:12,151 INFO L78 Accepts]: Start accepts. Automaton has 1442 states and 1823 transitions. Word has length 66 [2018-04-13 06:42:12,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:42:12,151 INFO L459 AbstractCegarLoop]: Abstraction has 1442 states and 1823 transitions. [2018-04-13 06:42:12,151 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-13 06:42:12,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1442 states and 1823 transitions. [2018-04-13 06:42:12,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-13 06:42:12,152 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:42:12,152 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:42:12,152 INFO L408 AbstractCegarLoop]: === Iteration 48 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:42:12,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1175150810, now seen corresponding path program 1 times [2018-04-13 06:42:12,152 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:42:12,152 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:42:12,153 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:42:12,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:42:12,153 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:42:12,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:42:12,165 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:42:12,169 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:42:12,169 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:42:12,170 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:42:12,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:42:12,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:42:12,226 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:42:12,267 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:42:12,268 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:42:12,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-13 06:42:12,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:42:12,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:42:12,281 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:30 [2018-04-13 06:42:12,315 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-13 06:42:12,317 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-13 06:42:12,317 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:42:12,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:42:12,335 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-13 06:42:12,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:42:12,337 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:42:12,339 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:42:12,351 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-13 06:42:12,351 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:54, output treesize:42 [2018-04-13 06:42:12,399 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:42:12,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 63 [2018-04-13 06:42:12,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:42:12,407 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:42:12,416 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:42:12,439 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:42:12,444 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 34 treesize of output 38 [2018-04-13 06:42:12,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 12 treesize of output 11 [2018-04-13 06:42:12,447 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:42:12,453 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:42:12,472 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-13 06:42:12,472 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:90, output treesize:74 [2018-04-13 06:42:12,545 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:42:12,546 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:42:12,547 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:42:12,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 83 [2018-04-13 06:42:12,559 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:42:12,560 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-13 06:42:12,560 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:42:12,572 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:42:12,608 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:42:12,613 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 54 treesize of output 52 [2018-04-13 06:42:12,615 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:42:12,615 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-13 06:42:12,616 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:42:12,624 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:42:12,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 06:42:12,646 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:123, output treesize:107 [2018-04-13 06:42:12,726 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:42:12,726 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:42:12,727 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:42:12,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 53 [2018-04-13 06:42:12,728 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:42:12,755 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-13 06:42:12,755 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:121, output treesize:127 [2018-04-13 06:42:12,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-04-13 06:42:12,839 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:42:12,875 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:42:12,880 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 0 case distinctions, treesize of input 78 treesize of output 73 [2018-04-13 06:42:12,882 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:42:12,883 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 69 treesize of output 83 [2018-04-13 06:42:12,883 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:42:12,895 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:42:12,930 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 59 treesize of output 61 [2018-04-13 06:42:12,932 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:42:12,934 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 26 treesize of output 40 [2018-04-13 06:42:12,934 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:42:12,943 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:42:12,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 06:42:12,966 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:158, output treesize:126 [2018-04-13 06:42:13,082 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:42:13,083 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:42:13,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 123 [2018-04-13 06:42:13,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-13 06:42:13,095 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:42:13,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:42:13,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 113 [2018-04-13 06:42:13,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-13 06:42:13,147 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:42:13,160 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:42:13,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-13 06:42:13,190 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:184, output treesize:164 [2018-04-13 06:42:13,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, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 142 [2018-04-13 06:42:13,340 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:42:13,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 35 [2018-04-13 06:42:13,340 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:42:13,357 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:42:13,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 126 [2018-04-13 06:42:13,397 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:42:13,398 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-13 06:42:13,398 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:42:13,415 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:42:13,444 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-13 06:42:13,445 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:217, output treesize:197 [2018-04-13 06:42:13,936 WARN L151 SmtUtils]: Spent 176ms on a formula simplification. DAG size of input: 70 DAG size of output 70 [2018-04-13 06:42:14,096 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:42:14,097 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:42:14,098 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:42:14,100 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:42:14,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 133 [2018-04-13 06:42:14,105 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:42:14,105 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:42:14,105 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:42:14,113 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 43 [2018-04-13 06:42:14,113 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-13 06:42:14,137 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 62 [2018-04-13 06:42:14,137 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 06:42:14,164 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:42:14,165 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-13 06:42:14,165 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:42:14,178 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-13 06:42:14,209 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 95 treesize of output 83 [2018-04-13 06:42:14,211 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:42:14,212 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-13 06:42:14,212 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 06:42:14,226 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:42:14,227 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:42:14,227 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:42:14,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2018-04-13 06:42:14,228 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-13 06:42:14,238 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:42:14,239 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:42:14,239 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 19 [2018-04-13 06:42:14,239 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 06:42:14,244 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:42:14,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:42:14,257 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 9 variables, input treesize:219, output treesize:7 [2018-04-13 06:42:14,329 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 14 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:42:14,329 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 06:42:14,329 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-13 06:42:14,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-13 06:42:14,329 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-13 06:42:14,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=590, Unknown=0, NotChecked=0, Total=702 [2018-04-13 06:42:14,330 INFO L87 Difference]: Start difference. First operand 1442 states and 1823 transitions. Second operand 27 states. [2018-04-13 06:42:15,482 WARN L151 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 92 DAG size of output 76 [2018-04-13 06:42:15,654 WARN L151 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 100 DAG size of output 84 [2018-04-13 06:42:15,903 WARN L151 SmtUtils]: Spent 155ms on a formula simplification. DAG size of input: 110 DAG size of output 94 [2018-04-13 06:42:16,140 WARN L151 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 103 DAG size of output 87 [2018-04-13 06:42:16,395 WARN L151 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 125 DAG size of output 93 [2018-04-13 06:42:16,801 WARN L151 SmtUtils]: Spent 172ms on a formula simplification. DAG size of input: 179 DAG size of output 107 [2018-04-13 06:42:17,119 WARN L151 SmtUtils]: Spent 158ms on a formula simplification. DAG size of input: 177 DAG size of output 105 [2018-04-13 06:42:17,559 WARN L151 SmtUtils]: Spent 136ms on a formula simplification. DAG size of input: 181 DAG size of output 109 [2018-04-13 06:42:18,094 WARN L151 SmtUtils]: Spent 236ms on a formula simplification. DAG size of input: 188 DAG size of output 116 [2018-04-13 06:42:18,448 WARN L151 SmtUtils]: Spent 219ms on a formula simplification. DAG size of input: 188 DAG size of output 108 [2018-04-13 06:42:18,824 WARN L151 SmtUtils]: Spent 213ms on a formula simplification. DAG size of input: 190 DAG size of output 112 [2018-04-13 06:42:19,115 WARN L151 SmtUtils]: Spent 154ms on a formula simplification. DAG size of input: 183 DAG size of output 107 [2018-04-13 06:42:19,401 WARN L151 SmtUtils]: Spent 148ms on a formula simplification. DAG size of input: 175 DAG size of output 103 [2018-04-13 06:42:19,719 WARN L151 SmtUtils]: Spent 169ms on a formula simplification. DAG size of input: 181 DAG size of output 122 [2018-04-13 06:42:20,300 WARN L148 SmtUtils]: Spent 109ms on a formula simplification that was a NOOP. DAG size: 119 [2018-04-13 06:42:24,971 WARN L151 SmtUtils]: Spent 2096ms on a formula simplification. DAG size of input: 135 DAG size of output 82 [2018-04-13 06:42:25,175 WARN L151 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 143 DAG size of output 90 [2018-04-13 06:42:25,454 WARN L151 SmtUtils]: Spent 185ms on a formula simplification. DAG size of input: 150 DAG size of output 97 [2018-04-13 06:42:25,696 WARN L151 SmtUtils]: Spent 173ms on a formula simplification. DAG size of input: 150 DAG size of output 89 [2018-04-13 06:42:25,951 WARN L151 SmtUtils]: Spent 176ms on a formula simplification. DAG size of input: 152 DAG size of output 94 [2018-04-13 06:42:26,291 WARN L151 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 139 DAG size of output 86 [2018-04-13 06:42:26,479 WARN L151 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 145 DAG size of output 88 [2018-04-13 06:42:26,898 WARN L151 SmtUtils]: Spent 138ms on a formula simplification. DAG size of input: 143 DAG size of output 103 [2018-04-13 06:42:27,117 WARN L151 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 146 DAG size of output 93 [2018-04-13 06:42:27,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:42:27,227 INFO L93 Difference]: Finished difference Result 1532 states and 1911 transitions. [2018-04-13 06:42:27,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-13 06:42:27,227 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 66 [2018-04-13 06:42:27,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:42:27,230 INFO L225 Difference]: With dead ends: 1532 [2018-04-13 06:42:27,230 INFO L226 Difference]: Without dead ends: 1532 [2018-04-13 06:42:27,231 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1143 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=1057, Invalid=4055, Unknown=0, NotChecked=0, Total=5112 [2018-04-13 06:42:27,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2018-04-13 06:42:27,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1411. [2018-04-13 06:42:27,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1411 states. [2018-04-13 06:42:27,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 1774 transitions. [2018-04-13 06:42:27,240 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 1774 transitions. Word has length 66 [2018-04-13 06:42:27,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:42:27,240 INFO L459 AbstractCegarLoop]: Abstraction has 1411 states and 1774 transitions. [2018-04-13 06:42:27,240 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-13 06:42:27,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 1774 transitions. [2018-04-13 06:42:27,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-13 06:42:27,241 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:42:27,241 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:42:27,241 INFO L408 AbstractCegarLoop]: === Iteration 49 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:42:27,241 INFO L82 PathProgramCache]: Analyzing trace with hash 748616595, now seen corresponding path program 1 times [2018-04-13 06:42:27,241 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:42:27,241 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:42:27,242 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:42:27,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:42:27,242 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:42:27,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:42:27,259 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:42:27,262 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:42:27,263 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:42:27,263 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:42:27,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:42:27,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:42:27,306 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:42:27,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:42:27,320 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:42:27,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:42:27,323 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 06:42:27,354 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:42:27,355 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:42:27,355 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-13 06:42:27,356 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:42:27,369 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-13 06:42:27,369 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:42:27,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:42:27,381 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:34 [2018-04-13 06:42:27,400 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-13 06:42:27,402 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-13 06:42:27,402 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:42:27,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:42:27,418 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-13 06:42:27,418 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:52 [2018-04-13 06:42:27,461 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:42:27,466 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 56 treesize of output 53 [2018-04-13 06:42:27,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:42:27,468 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:42:27,473 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:42:27,483 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-13 06:42:27,483 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:65 [2018-04-13 06:42:27,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 57 [2018-04-13 06:42:27,521 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 22 treesize of output 29 [2018-04-13 06:42:27,521 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:42:27,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:42:27,535 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-13 06:42:27,535 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:84, output treesize:74 [2018-04-13 06:42:33,566 WARN L151 SmtUtils]: Spent 2020ms on a formula simplification. DAG size of input: 34 DAG size of output 30 [2018-04-13 06:42:37,602 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:42:37,603 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:42:37,604 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:42:37,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 52 [2018-04-13 06:42:37,604 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:42:37,618 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-13 06:42:37,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:42:37,630 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-13 06:42:37,630 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:88 [2018-04-13 06:42:37,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 62 [2018-04-13 06:42:37,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 50 [2018-04-13 06:42:37,666 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-13 06:42:37,690 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-13 06:42:37,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-13 06:42:37,719 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:104, output treesize:184 [2018-04-13 06:42:37,852 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:42:37,852 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:42:37,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 122 [2018-04-13 06:42:37,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:42:37,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:42:37,874 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:42:37,914 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:42:37,915 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:42:37,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 94 [2018-04-13 06:42:37,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 12 treesize of output 11 [2018-04-13 06:42:37,924 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:42:37,939 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:42:37,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-13 06:42:37,973 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:222, output treesize:206 [2018-04-13 06:42:46,173 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:42:46,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 129 [2018-04-13 06:42:46,185 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 20 treesize of output 25 [2018-04-13 06:42:46,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:42:46,200 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:42:46,253 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:42:46,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 101 [2018-04-13 06:42:46,264 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 20 treesize of output 25 [2018-04-13 06:42:46,264 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:42:46,279 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:42:46,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-04-13 06:42:46,316 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:248, output treesize:232 [2018-04-13 06:42:52,434 WARN L151 SmtUtils]: Spent 2083ms on a formula simplification. DAG size of input: 80 DAG size of output 72 [2018-04-13 06:42:52,441 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 06:42:52,441 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:42:52,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 36 [2018-04-13 06:42:52,468 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:42:52,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-13 06:42:52,480 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:223, output treesize:92 [2018-04-13 06:42:54,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 59 [2018-04-13 06:42:54,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 27 [2018-04-13 06:42:54,585 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-13 06:42:54,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-13 06:42:54,592 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:42:54,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-13 06:42:54,598 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:42:54,602 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:42:54,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 06:42:54,607 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:88, output treesize:28 [2018-04-13 06:42:54,740 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:42:54,741 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 06:42:54,741 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-13 06:42:54,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-13 06:42:54,741 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-13 06:42:54,741 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=409, Unknown=10, NotChecked=0, Total=506 [2018-04-13 06:42:54,741 INFO L87 Difference]: Start difference. First operand 1411 states and 1774 transitions. Second operand 23 states. [2018-04-13 06:42:57,314 WARN L151 SmtUtils]: Spent 2034ms on a formula simplification. DAG size of input: 66 DAG size of output 50 [2018-04-13 06:42:58,069 WARN L151 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 147 DAG size of output 78 [2018-04-13 06:42:58,210 WARN L151 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 138 DAG size of output 75 [2018-04-13 06:42:58,357 WARN L151 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 75 DAG size of output 62 [2018-04-13 06:42:58,529 WARN L151 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 152 DAG size of output 78 [2018-04-13 06:42:58,656 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 56 DAG size of output 54 [2018-04-13 06:43:01,110 WARN L151 SmtUtils]: Spent 2144ms on a formula simplification. DAG size of input: 80 DAG size of output 64 [2018-04-13 06:43:01,458 WARN L151 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 152 DAG size of output 78 [2018-04-13 06:43:02,370 WARN L151 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 96 DAG size of output 62 [2018-04-13 06:43:02,669 WARN L151 SmtUtils]: Spent 132ms on a formula simplification. DAG size of input: 140 DAG size of output 71 [2018-04-13 06:43:02,819 WARN L151 SmtUtils]: Spent 108ms on a formula simplification. DAG size of input: 131 DAG size of output 68 [2018-04-13 06:43:03,001 WARN L151 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 145 DAG size of output 71 [2018-04-13 06:43:03,717 WARN L151 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 145 DAG size of output 71 [2018-04-13 06:43:03,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:43:03,724 INFO L93 Difference]: Finished difference Result 2561 states and 3176 transitions. [2018-04-13 06:43:03,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-13 06:43:03,724 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 72 [2018-04-13 06:43:03,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:43:03,730 INFO L225 Difference]: With dead ends: 2561 [2018-04-13 06:43:03,730 INFO L226 Difference]: Without dead ends: 2561 [2018-04-13 06:43:03,731 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 953 ImplicationChecksByTransitivity, 34.2s TimeCoverageRelationStatistics Valid=1005, Invalid=3017, Unknown=10, NotChecked=0, Total=4032 [2018-04-13 06:43:03,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2561 states. [2018-04-13 06:43:03,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2561 to 1573. [2018-04-13 06:43:03,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1573 states. [2018-04-13 06:43:03,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 1993 transitions. [2018-04-13 06:43:03,749 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 1993 transitions. Word has length 72 [2018-04-13 06:43:03,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:43:03,749 INFO L459 AbstractCegarLoop]: Abstraction has 1573 states and 1993 transitions. [2018-04-13 06:43:03,749 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-13 06:43:03,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 1993 transitions. [2018-04-13 06:43:03,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-13 06:43:03,750 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:43:03,750 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:43:03,750 INFO L408 AbstractCegarLoop]: === Iteration 50 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:43:03,750 INFO L82 PathProgramCache]: Analyzing trace with hash 748616596, now seen corresponding path program 1 times [2018-04-13 06:43:03,751 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:43:03,751 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:43:03,751 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:43:03,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:43:03,751 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:43:03,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:43:03,764 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:43:03,771 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:43:03,771 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:43:03,771 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:43:03,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:43:03,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:43:03,827 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:43:03,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 6 treesize of output 5 [2018-04-13 06:43:03,842 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:03,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:03,855 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 06:43:03,869 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-13 06:43:03,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:43:03,871 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:03,872 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:03,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:03,877 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:16 [2018-04-13 06:43:03,886 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-13 06:43:03,888 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:03,889 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-13 06:43:03,889 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:03,893 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:03,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:03,899 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-04-13 06:43:03,941 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:03,942 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:03,943 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-13 06:43:03,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:03,961 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-13 06:43:03,961 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:03,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:03,978 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:53 [2018-04-13 06:43:04,002 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-13 06:43:04,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, 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-13 06:43:04,004 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:04,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:04,026 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 26 [2018-04-13 06:43:04,028 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:04,028 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:04,029 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:43:04,030 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 23 treesize of output 39 [2018-04-13 06:43:04,030 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:04,034 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:04,045 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-13 06:43:04,045 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:84, output treesize:68 [2018-04-13 06:43:04,084 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:04,089 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 79 treesize of output 76 [2018-04-13 06:43:04,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:43:04,091 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:04,098 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:04,122 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 49 treesize of output 53 [2018-04-13 06:43:04,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-13 06:43:04,125 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:04,130 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:04,146 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-13 06:43:04,146 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:126, output treesize:106 [2018-04-13 06:43:04,208 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 109 treesize of output 95 [2018-04-13 06:43:04,210 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 22 treesize of output 29 [2018-04-13 06:43:04,210 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:04,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:04,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 57 [2018-04-13 06:43:04,252 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 22 treesize of output 29 [2018-04-13 06:43:04,252 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:04,259 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:04,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 06:43:04,275 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:150, output treesize:130 [2018-04-13 06:43:04,392 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:04,393 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:04,393 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:04,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 58 [2018-04-13 06:43:04,394 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:04,423 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-13 06:43:04,424 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:04,449 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-13 06:43:04,450 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:126, output treesize:133 [2018-04-13 06:43:04,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-04-13 06:43:04,495 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:04,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 62 [2018-04-13 06:43:04,531 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:04,531 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 56 treesize of output 71 [2018-04-13 06:43:04,532 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:04,540 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:04,575 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 50 treesize of output 54 [2018-04-13 06:43:04,577 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:04,578 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:43:04,579 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 28 treesize of output 47 [2018-04-13 06:43:04,580 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:04,588 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:04,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:43:04,608 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:160, output treesize:121 [2018-04-13 06:43:04,679 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:04,679 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:04,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 141 [2018-04-13 06:43:04,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:43:04,691 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:04,705 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:04,732 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:04,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 93 [2018-04-13 06:43:04,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:43:04,740 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:04,750 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:04,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 06:43:04,777 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:169, output treesize:153 [2018-04-13 06:43:04,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 136 [2018-04-13 06:43:04,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 25 [2018-04-13 06:43:04,885 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:04,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:04,936 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 78 treesize of output 97 [2018-04-13 06:43:04,939 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 20 treesize of output 25 [2018-04-13 06:43:04,939 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:04,951 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:04,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-13 06:43:04,978 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:189, output treesize:173 [2018-04-13 06:43:05,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 73 [2018-04-13 06:43:05,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 5 treesize of output 1 [2018-04-13 06:43:05,225 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:05,236 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 58 treesize of output 37 [2018-04-13 06:43:05,236 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-13 06:43:05,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 5 treesize of output 1 [2018-04-13 06:43:05,245 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:05,253 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:43:05,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2018-04-13 06:43:05,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-13 06:43:05,273 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:05,281 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:43:05,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2018-04-13 06:43:05,282 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:05,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 5 treesize of output 1 [2018-04-13 06:43:05,286 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:05,289 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:05,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 06:43:05,298 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:144, output treesize:34 [2018-04-13 06:43:05,415 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 15 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:43:05,415 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 06:43:05,415 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-13 06:43:05,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-13 06:43:05,416 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-13 06:43:05,416 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=399, Unknown=0, NotChecked=0, Total=506 [2018-04-13 06:43:05,416 INFO L87 Difference]: Start difference. First operand 1573 states and 1993 transitions. Second operand 23 states. [2018-04-13 06:43:09,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:43:09,105 INFO L93 Difference]: Finished difference Result 4333 states and 5426 transitions. [2018-04-13 06:43:09,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-13 06:43:09,105 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 72 [2018-04-13 06:43:09,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:43:09,113 INFO L225 Difference]: With dead ends: 4333 [2018-04-13 06:43:09,113 INFO L226 Difference]: Without dead ends: 4333 [2018-04-13 06:43:09,114 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=653, Invalid=2427, Unknown=0, NotChecked=0, Total=3080 [2018-04-13 06:43:09,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4333 states. [2018-04-13 06:43:09,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4333 to 2609. [2018-04-13 06:43:09,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2609 states. [2018-04-13 06:43:09,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2609 states to 2609 states and 3332 transitions. [2018-04-13 06:43:09,139 INFO L78 Accepts]: Start accepts. Automaton has 2609 states and 3332 transitions. Word has length 72 [2018-04-13 06:43:09,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:43:09,139 INFO L459 AbstractCegarLoop]: Abstraction has 2609 states and 3332 transitions. [2018-04-13 06:43:09,139 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-13 06:43:09,139 INFO L276 IsEmpty]: Start isEmpty. Operand 2609 states and 3332 transitions. [2018-04-13 06:43:09,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-13 06:43:09,140 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:43:09,140 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:43:09,140 INFO L408 AbstractCegarLoop]: === Iteration 51 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:43:09,141 INFO L82 PathProgramCache]: Analyzing trace with hash 742890957, now seen corresponding path program 1 times [2018-04-13 06:43:09,141 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:43:09,141 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:43:09,141 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:43:09,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:43:09,142 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:43:09,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:43:09,152 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:43:09,156 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:43:09,156 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:43:09,156 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:43:09,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:43:09,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:43:09,184 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:43:09,211 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:09,212 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:09,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-13 06:43:09,213 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:09,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:09,221 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-04-13 06:43:09,241 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-13 06:43:09,243 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-13 06:43:09,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:09,244 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:09,258 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-13 06:43:09,259 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:35 [2018-04-13 06:43:09,295 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:09,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, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 44 [2018-04-13 06:43:09,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:43:09,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:09,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:09,322 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-13 06:43:09,322 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:46 [2018-04-13 06:43:09,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2018-04-13 06:43:09,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, 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 25 [2018-04-13 06:43:09,378 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:09,383 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:09,393 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-13 06:43:09,394 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:64, output treesize:56 [2018-04-13 06:43:17,457 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 49 treesize of output 36 [2018-04-13 06:43:17,458 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:43:17,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-04-13 06:43:17,459 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:17,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-04-13 06:43:17,465 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:17,467 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:17,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:43:17,472 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:66, output treesize:15 [2018-04-13 06:43:17,524 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 19 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-13 06:43:17,524 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 06:43:17,524 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-13 06:43:17,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-13 06:43:17,525 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-13 06:43:17,525 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=181, Unknown=4, NotChecked=0, Total=240 [2018-04-13 06:43:17,525 INFO L87 Difference]: Start difference. First operand 2609 states and 3332 transitions. Second operand 16 states. [2018-04-13 06:43:30,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:43:30,431 INFO L93 Difference]: Finished difference Result 2912 states and 3677 transitions. [2018-04-13 06:43:30,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-13 06:43:30,431 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 72 [2018-04-13 06:43:30,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:43:30,435 INFO L225 Difference]: With dead ends: 2912 [2018-04-13 06:43:30,436 INFO L226 Difference]: Without dead ends: 2912 [2018-04-13 06:43:30,436 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=324, Invalid=791, Unknown=7, NotChecked=0, Total=1122 [2018-04-13 06:43:30,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2912 states. [2018-04-13 06:43:30,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2912 to 2086. [2018-04-13 06:43:30,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2086 states. [2018-04-13 06:43:30,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2086 states to 2086 states and 2662 transitions. [2018-04-13 06:43:30,456 INFO L78 Accepts]: Start accepts. Automaton has 2086 states and 2662 transitions. Word has length 72 [2018-04-13 06:43:30,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:43:30,456 INFO L459 AbstractCegarLoop]: Abstraction has 2086 states and 2662 transitions. [2018-04-13 06:43:30,456 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-13 06:43:30,456 INFO L276 IsEmpty]: Start isEmpty. Operand 2086 states and 2662 transitions. [2018-04-13 06:43:30,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-13 06:43:30,457 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:43:30,457 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:43:30,457 INFO L408 AbstractCegarLoop]: === Iteration 52 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:43:30,457 INFO L82 PathProgramCache]: Analyzing trace with hash 742890958, now seen corresponding path program 1 times [2018-04-13 06:43:30,457 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:43:30,458 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:43:30,458 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:43:30,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:43:30,458 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:43:30,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:43:30,467 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:43:30,470 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:43:30,470 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:43:30,470 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:43:30,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:43:30,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:43:30,499 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:43:30,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:43:30,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:30,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:30,511 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 06:43:30,543 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:30,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 12 treesize of output 15 [2018-04-13 06:43:30,544 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:30,557 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:30,558 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:30,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-13 06:43:30,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:30,565 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-13 06:43:30,565 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:31 [2018-04-13 06:43:30,615 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:30,615 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:30,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2018-04-13 06:43:30,616 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:30,631 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:30,631 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:30,632 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:30,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 37 [2018-04-13 06:43:30,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:30,645 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-13 06:43:30,646 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:58 [2018-04-13 06:43:30,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-13 06:43:30,667 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:30,684 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-13 06:43:30,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:43:30,685 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:30,686 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:30,699 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-13 06:43:30,701 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-13 06:43:30,701 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:30,702 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:30,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:43:30,713 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:82, output treesize:59 [2018-04-13 06:43:30,754 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:30,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, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 63 [2018-04-13 06:43:30,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 12 treesize of output 11 [2018-04-13 06:43:30,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:30,766 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:30,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-04-13 06:43:30,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:43:30,785 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:30,788 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:30,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 06:43:30,801 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:97, output treesize:81 [2018-04-13 06:43:30,858 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:43:30,864 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 40 treesize of output 46 [2018-04-13 06:43:30,878 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 20 treesize of output 25 [2018-04-13 06:43:30,879 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:30,884 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:30,906 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:43:30,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 75 [2018-04-13 06:43:30,920 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 20 treesize of output 25 [2018-04-13 06:43:30,920 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:30,929 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:30,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-13 06:43:30,948 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:123, output treesize:107 [2018-04-13 06:43:31,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 48 [2018-04-13 06:43:31,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-13 06:43:31,074 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:31,079 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:43:31,079 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 36 treesize of output 26 [2018-04-13 06:43:31,079 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:31,083 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:31,097 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 24 treesize of output 22 [2018-04-13 06:43:31,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-13 06:43:31,098 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:31,102 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:43:31,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, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-13 06:43:31,102 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:31,104 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:31,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 06:43:31,112 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:106, output treesize:31 [2018-04-13 06:43:31,162 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 15 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:43:31,162 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 06:43:31,162 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-13 06:43:31,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-13 06:43:31,163 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-13 06:43:31,163 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=325, Unknown=2, NotChecked=0, Total=420 [2018-04-13 06:43:31,163 INFO L87 Difference]: Start difference. First operand 2086 states and 2662 transitions. Second operand 21 states. [2018-04-13 06:43:32,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:43:32,344 INFO L93 Difference]: Finished difference Result 2351 states and 2968 transitions. [2018-04-13 06:43:32,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-13 06:43:32,344 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 72 [2018-04-13 06:43:32,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:43:32,347 INFO L225 Difference]: With dead ends: 2351 [2018-04-13 06:43:32,347 INFO L226 Difference]: Without dead ends: 2351 [2018-04-13 06:43:32,347 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=467, Invalid=1168, Unknown=5, NotChecked=0, Total=1640 [2018-04-13 06:43:32,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2351 states. [2018-04-13 06:43:32,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2351 to 2138. [2018-04-13 06:43:32,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2138 states. [2018-04-13 06:43:32,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2138 states to 2138 states and 2726 transitions. [2018-04-13 06:43:32,359 INFO L78 Accepts]: Start accepts. Automaton has 2138 states and 2726 transitions. Word has length 72 [2018-04-13 06:43:32,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:43:32,359 INFO L459 AbstractCegarLoop]: Abstraction has 2138 states and 2726 transitions. [2018-04-13 06:43:32,359 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-13 06:43:32,359 INFO L276 IsEmpty]: Start isEmpty. Operand 2138 states and 2726 transitions. [2018-04-13 06:43:32,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-13 06:43:32,360 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:43:32,360 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:43:32,360 INFO L408 AbstractCegarLoop]: === Iteration 53 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:43:32,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1648786485, now seen corresponding path program 1 times [2018-04-13 06:43:32,361 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:43:32,361 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:43:32,361 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:43:32,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:43:32,362 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:43:32,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:43:32,371 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:43:32,373 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:43:32,374 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:43:32,374 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:43:32,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:43:32,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:43:32,410 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:43:32,429 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:32,430 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:32,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-13 06:43:32,431 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:32,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:32,437 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:25 [2018-04-13 06:43:32,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2018-04-13 06:43:32,445 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:32,452 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-13 06:43:32,453 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-13 06:43:32,453 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:32,454 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:32,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:32,458 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:43, output treesize:27 [2018-04-13 06:43:32,472 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:32,475 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 44 treesize of output 41 [2018-04-13 06:43:32,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:43:32,476 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:32,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:32,483 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-13 06:43:32,483 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:40 [2018-04-13 06:43:32,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 45 [2018-04-13 06:43:32,504 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 22 treesize of output 29 [2018-04-13 06:43:32,504 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:32,507 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:32,511 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-13 06:43:32,511 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:49 [2018-04-13 06:43:32,534 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 45 treesize of output 31 [2018-04-13 06:43:32,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2018-04-13 06:43:32,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:32,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-13 06:43:32,538 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:32,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:32,541 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-13 06:43:32,542 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:45, output treesize:4 [2018-04-13 06:43:32,560 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 32 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-13 06:43:32,560 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 06:43:32,560 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-13 06:43:32,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-13 06:43:32,560 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-13 06:43:32,561 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-04-13 06:43:32,561 INFO L87 Difference]: Start difference. First operand 2138 states and 2726 transitions. Second operand 13 states. [2018-04-13 06:43:33,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:43:33,280 INFO L93 Difference]: Finished difference Result 1396 states and 1690 transitions. [2018-04-13 06:43:33,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-13 06:43:33,280 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 72 [2018-04-13 06:43:33,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:43:33,282 INFO L225 Difference]: With dead ends: 1396 [2018-04-13 06:43:33,282 INFO L226 Difference]: Without dead ends: 1396 [2018-04-13 06:43:33,282 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=199, Invalid=613, Unknown=0, NotChecked=0, Total=812 [2018-04-13 06:43:33,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2018-04-13 06:43:33,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 1037. [2018-04-13 06:43:33,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1037 states. [2018-04-13 06:43:33,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1280 transitions. [2018-04-13 06:43:33,288 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1280 transitions. Word has length 72 [2018-04-13 06:43:33,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:43:33,289 INFO L459 AbstractCegarLoop]: Abstraction has 1037 states and 1280 transitions. [2018-04-13 06:43:33,289 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-13 06:43:33,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1280 transitions. [2018-04-13 06:43:33,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-04-13 06:43:33,289 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:43:33,289 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:43:33,289 INFO L408 AbstractCegarLoop]: === Iteration 54 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:43:33,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1134657346, now seen corresponding path program 1 times [2018-04-13 06:43:33,289 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:43:33,289 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:43:33,290 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:43:33,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:43:33,290 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:43:33,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:43:33,302 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:43:33,307 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:43:33,307 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:43:33,308 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:43:33,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:43:33,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:43:33,369 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:43:33,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 06:43:33,376 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:33,379 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:33,379 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 06:43:33,417 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:33,418 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-13 06:43:33,418 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:33,431 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:33,432 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:33,432 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-13 06:43:33,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:33,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:33,442 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:31 [2018-04-13 06:43:33,460 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-13 06:43:33,461 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-13 06:43:33,462 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:33,463 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:33,474 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-13 06:43:33,475 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:43 [2018-04-13 06:43:33,506 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:33,510 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 0 case distinctions, treesize of input 46 treesize of output 53 [2018-04-13 06:43:33,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:43:33,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:33,516 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:33,523 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-13 06:43:33,523 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:54 [2018-04-13 06:43:33,559 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:33,560 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:43:33,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 52 [2018-04-13 06:43:33,567 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 20 treesize of output 25 [2018-04-13 06:43:33,567 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:33,581 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:33,589 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-13 06:43:33,589 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:84, output treesize:67 [2018-04-13 06:43:33,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 12 [2018-04-13 06:43:33,618 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:33,623 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-13 06:43:33,623 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:42 [2018-04-13 06:43:33,639 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:33,640 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:33,640 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:33,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 46 [2018-04-13 06:43:33,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:33,651 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-13 06:43:33,651 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:62 [2018-04-13 06:43:33,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 54 [2018-04-13 06:43:33,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:43:33,728 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:33,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:33,744 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-13 06:43:33,744 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:73, output treesize:69 [2018-04-13 06:43:33,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 59 [2018-04-13 06:43:33,770 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 14 treesize of output 15 [2018-04-13 06:43:33,770 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:33,776 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:33,786 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-13 06:43:33,786 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:77, output treesize:94 [2018-04-13 06:43:33,907 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:33,907 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 34 treesize of output 64 [2018-04-13 06:43:33,907 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:33,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-13 06:43:33,918 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:107, output treesize:81 [2018-04-13 06:43:33,971 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:33,971 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:33,972 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:33,973 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:33,974 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:33,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 107 [2018-04-13 06:43:33,978 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 06:43:34,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-13 06:43:34,010 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:95, output treesize:214 [2018-04-13 06:43:34,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 89 [2018-04-13 06:43:34,129 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 4 case distinctions, treesize of input 42 treesize of output 47 [2018-04-13 06:43:34,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-04-13 06:43:34,158 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-13 06:43:34,228 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:34,228 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:34,229 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:34,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 124 [2018-04-13 06:43:34,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:43:34,237 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:34,253 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:34,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: 9 dim-0 vars, and 4 xjuncts. [2018-04-13 06:43:34,317 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:236, output treesize:314 [2018-04-13 06:43:34,505 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:34,506 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:34,506 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:34,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 138 [2018-04-13 06:43:34,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:43:34,514 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:34,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:34,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 87 [2018-04-13 06:43:34,635 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:34,636 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 27 [2018-04-13 06:43:34,636 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:34,649 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:34,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 89 [2018-04-13 06:43:34,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 40 [2018-04-13 06:43:34,756 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-04-13 06:43:34,782 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-13 06:43:34,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 87 [2018-04-13 06:43:34,900 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:43:34,901 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 20 treesize of output 19 [2018-04-13 06:43:34,901 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:34,912 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:35,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 4 dim-2 vars, End of recursive call: 13 dim-0 vars, and 6 xjuncts. [2018-04-13 06:43:35,007 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 13 variables, input treesize:382, output treesize:527 [2018-04-13 06:43:35,209 WARN L151 SmtUtils]: Spent 133ms on a formula simplification. DAG size of input: 150 DAG size of output 132 [2018-04-13 06:43:35,496 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:35,496 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 125 treesize of output 121 [2018-04-13 06:43:35,496 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:35,605 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:35,606 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 94 treesize of output 94 [2018-04-13 06:43:35,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:35,699 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:35,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 87 [2018-04-13 06:43:35,700 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:35,787 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:35,787 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:35,788 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:35,788 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:35,789 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 132 treesize of output 154 [2018-04-13 06:43:35,789 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:35,870 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:35,871 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 127 treesize of output 123 [2018-04-13 06:43:35,871 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:35,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 18 dim-0 vars, 5 dim-1 vars, End of recursive call: 18 dim-0 vars, and 5 xjuncts. [2018-04-13 06:43:35,940 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 23 variables, input treesize:566, output treesize:436 [2018-04-13 06:43:36,226 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:36,227 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:36,227 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:36,227 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:36,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 111 [2018-04-13 06:43:36,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-13 06:43:36,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:36,248 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 10 [2018-04-13 06:43:36,248 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-13 06:43:36,259 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:43:36,259 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2018-04-13 06:43:36,259 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:36,269 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-13 06:43:36,270 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:36,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:43:36,343 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:36,343 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:36,345 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 90 [2018-04-13 06:43:36,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-13 06:43:36,347 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:36,360 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:43:36,360 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 23 treesize of output 21 [2018-04-13 06:43:36,361 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:36,371 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:36,372 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:36,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2018-04-13 06:43:36,385 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 06:43:36,412 INFO L267 ElimStorePlain]: Start of recursive call 7: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 06:43:36,502 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:36,503 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:36,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 82 [2018-04-13 06:43:36,507 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:36,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 12 [2018-04-13 06:43:36,508 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:36,522 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:43:36,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-04-13 06:43:36,522 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:36,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-13 06:43:36,532 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:36,539 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:36,610 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:36,611 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:36,613 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 90 [2018-04-13 06:43:36,614 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:43:36,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 0 case distinctions, treesize of input 31 treesize of output 31 [2018-04-13 06:43:36,615 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:36,630 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:36,630 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:36,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 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-13 06:43:36,631 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:43:36,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-13 06:43:36,642 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:36,649 INFO L267 ElimStorePlain]: Start of recursive call 15: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:43:36,710 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:36,711 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:36,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 77 [2018-04-13 06:43:36,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-04-13 06:43:36,714 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:36,726 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:43:36,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-04-13 06:43:36,727 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:36,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-13 06:43:36,736 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:36,742 INFO L267 ElimStorePlain]: Start of recursive call 19: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:36,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 18 dim-0 vars, 5 dim-2 vars, End of recursive call: 7 dim-0 vars, and 6 xjuncts. [2018-04-13 06:43:36,795 INFO L202 ElimStorePlain]: Needed 22 recursive calls to eliminate 23 variables, input treesize:481, output treesize:162 [2018-04-13 06:43:36,911 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:36,911 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:36,912 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:36,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-04-13 06:43:36,912 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:36,917 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-13 06:43:36,917 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:20 [2018-04-13 06:43:37,011 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:43:37,011 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 06:43:37,011 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-04-13 06:43:37,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-13 06:43:37,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-13 06:43:37,011 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1154, Unknown=0, NotChecked=0, Total=1260 [2018-04-13 06:43:37,011 INFO L87 Difference]: Start difference. First operand 1037 states and 1280 transitions. Second operand 36 states. [2018-04-13 06:43:40,146 WARN L151 SmtUtils]: Spent 305ms on a formula simplification. DAG size of input: 188 DAG size of output 188 [2018-04-13 06:43:40,664 WARN L151 SmtUtils]: Spent 354ms on a formula simplification. DAG size of input: 225 DAG size of output 219 [2018-04-13 06:43:41,028 WARN L148 SmtUtils]: Spent 186ms on a formula simplification that was a NOOP. DAG size: 229 [2018-04-13 06:43:41,352 WARN L151 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 170 DAG size of output 168 [2018-04-13 06:43:41,525 WARN L151 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 168 DAG size of output 166 [2018-04-13 06:43:42,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:43:42,240 INFO L93 Difference]: Finished difference Result 1284 states and 1558 transitions. [2018-04-13 06:43:42,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-13 06:43:42,240 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 73 [2018-04-13 06:43:42,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:43:42,242 INFO L225 Difference]: With dead ends: 1284 [2018-04-13 06:43:42,242 INFO L226 Difference]: Without dead ends: 1284 [2018-04-13 06:43:42,242 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1357 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=539, Invalid=4863, Unknown=0, NotChecked=0, Total=5402 [2018-04-13 06:43:42,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1284 states. [2018-04-13 06:43:42,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1284 to 1058. [2018-04-13 06:43:42,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1058 states. [2018-04-13 06:43:42,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 1303 transitions. [2018-04-13 06:43:42,248 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 1303 transitions. Word has length 73 [2018-04-13 06:43:42,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:43:42,248 INFO L459 AbstractCegarLoop]: Abstraction has 1058 states and 1303 transitions. [2018-04-13 06:43:42,248 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-13 06:43:42,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1303 transitions. [2018-04-13 06:43:42,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-04-13 06:43:42,248 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:43:42,248 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:43:42,248 INFO L408 AbstractCegarLoop]: === Iteration 55 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:43:42,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1134657347, now seen corresponding path program 1 times [2018-04-13 06:43:42,249 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:43:42,249 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:43:42,249 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:43:42,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:43:42,249 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:43:42,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:43:42,260 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:43:42,265 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:43:42,265 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:43:42,265 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:43:42,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:43:42,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:43:42,305 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:43:42,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:43:42,312 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:42,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:43:42,317 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:42,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:42,321 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-13 06:43:42,335 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-13 06:43:42,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:43:42,337 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:42,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:42,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-13 06:43:42,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 06:43:42,346 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:42,347 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:42,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:42,352 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:39, output treesize:31 [2018-04-13 06:43:42,361 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-13 06:43:42,363 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:42,363 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-13 06:43:42,363 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:42,366 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:42,377 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-13 06:43:42,378 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:42,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-13 06:43:42,378 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:42,381 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:42,388 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:42,388 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:64, output treesize:49 [2018-04-13 06:43:42,426 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:42,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 06:43:42,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:42,442 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:42,443 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:42,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-13 06:43:42,443 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:42,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:42,455 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:76, output treesize:73 [2018-04-13 06:43:42,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 28 treesize of output 24 [2018-04-13 06:43:42,477 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:42,484 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 4 case distinctions, treesize of input 21 treesize of output 40 [2018-04-13 06:43:42,485 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-04-13 06:43:42,503 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-13 06:43:42,532 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 24 [2018-04-13 06:43:42,534 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:42,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 30 [2018-04-13 06:43:42,536 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:42,542 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:42,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-13 06:43:42,576 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:97, output treesize:272 [2018-04-13 06:43:42,700 WARN L151 SmtUtils]: Spent 113ms on a formula simplification. DAG size of input: 47 DAG size of output 47 [2018-04-13 06:43:42,764 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:42,768 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 120 treesize of output 116 [2018-04-13 06:43:42,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-13 06:43:42,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:42,784 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:42,884 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:42,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 116 [2018-04-13 06:43:42,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:43:42,889 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:42,905 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:42,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 105 [2018-04-13 06:43:42,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-13 06:43:42,995 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:43,009 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:43,086 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:43,089 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 131 treesize of output 132 [2018-04-13 06:43:43,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:43:43,090 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:43,108 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:43,183 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 123 treesize of output 119 [2018-04-13 06:43:43,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:43:43,185 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:43,201 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:43,278 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 112 treesize of output 105 [2018-04-13 06:43:43,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:43:43,280 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:43,296 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:43,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 6 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-04-13 06:43:43,356 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 9 variables, input treesize:372, output treesize:324 [2018-04-13 06:43:43,508 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 154 treesize of output 149 [2018-04-13 06:43:43,510 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 20 treesize of output 25 [2018-04-13 06:43:43,510 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:43,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:43,658 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 146 treesize of output 136 [2018-04-13 06:43:43,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 25 [2018-04-13 06:43:43,660 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:43,678 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:43,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 140 treesize of output 130 [2018-04-13 06:43:43,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 25 [2018-04-13 06:43:43,783 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:43,799 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:43,889 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 158 treesize of output 144 [2018-04-13 06:43:43,891 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 22 treesize of output 29 [2018-04-13 06:43:43,892 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:43,908 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:43,980 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 132 treesize of output 119 [2018-04-13 06:43:43,983 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 20 treesize of output 25 [2018-04-13 06:43:43,983 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:43,999 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:44,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, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 131 [2018-04-13 06:43:44,076 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 22 treesize of output 29 [2018-04-13 06:43:44,076 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:44,092 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:44,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 6 dim-2 vars, End of recursive call: 7 dim-0 vars, and 3 xjuncts. [2018-04-13 06:43:44,148 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 13 variables, input treesize:453, output treesize:401 [2018-04-13 06:43:44,276 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:44,276 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:44,277 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:44,277 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 116 treesize of output 116 [2018-04-13 06:43:44,278 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:44,349 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 109 treesize of output 108 [2018-04-13 06:43:44,350 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:44,418 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:44,419 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:44,419 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:44,420 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 126 treesize of output 126 [2018-04-13 06:43:44,420 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:44,486 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 119 treesize of output 118 [2018-04-13 06:43:44,487 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:44,552 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:44,553 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:44,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 163 [2018-04-13 06:43:44,553 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:44,618 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:44,619 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:44,619 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:44,620 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 151 treesize of output 151 [2018-04-13 06:43:44,620 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:44,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 6 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-04-13 06:43:44,686 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 11 variables, input treesize:395, output treesize:371 [2018-04-13 06:43:44,836 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:44,837 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 135 treesize of output 144 [2018-04-13 06:43:44,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 18 treesize of output 16 [2018-04-13 06:43:44,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:44,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:45,030 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 145 treesize of output 145 [2018-04-13 06:43:45,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:43:45,031 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:45,052 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:45,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 138 [2018-04-13 06:43:45,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:43:45,218 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:45,239 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:45,368 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 176 [2018-04-13 06:43:45,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-13 06:43:45,371 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:45,400 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:45,493 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:45,498 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 128 [2018-04-13 06:43:45,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:43:45,500 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:45,519 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:45,611 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 167 treesize of output 163 [2018-04-13 06:43:45,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:43:45,613 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:45,636 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:45,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 6 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-04-13 06:43:45,709 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 11 variables, input treesize:452, output treesize:424 [2018-04-13 06:43:45,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, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 183 [2018-04-13 06:43:45,814 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:45,815 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-13 06:43:45,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:45,849 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:46,006 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:46,008 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:46,011 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:46,012 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 149 treesize of output 168 [2018-04-13 06:43:46,015 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:46,023 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 52 [2018-04-13 06:43:46,023 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-13 06:43:46,058 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:46,202 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 198 [2018-04-13 06:43:46,204 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:46,204 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:43:46,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 30 [2018-04-13 06:43:46,205 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:46,236 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:46,376 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 168 [2018-04-13 06:43:46,378 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:46,378 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:43:46,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 30 [2018-04-13 06:43:46,379 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:46,407 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:46,517 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:46,518 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 159 treesize of output 168 [2018-04-13 06:43:46,520 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:46,521 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 27 treesize of output 31 [2018-04-13 06:43:46,521 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:46,546 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:46,646 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:46,650 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 156 [2018-04-13 06:43:46,652 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:46,652 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:43:46,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 30 [2018-04-13 06:43:46,653 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:46,676 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:46,760 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 6 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-04-13 06:43:46,761 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 17 variables, input treesize:502, output treesize:800 [2018-04-13 06:43:47,027 WARN L148 SmtUtils]: Spent 100ms on a formula simplification that was a NOOP. DAG size: 119 [2018-04-13 06:43:47,761 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:47,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 249 treesize of output 243 [2018-04-13 06:43:47,762 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:47,859 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:47,860 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 279 treesize of output 273 [2018-04-13 06:43:47,860 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:47,959 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:47,960 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 239 treesize of output 233 [2018-04-13 06:43:47,960 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:48,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 3 dim-1 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2018-04-13 06:43:48,054 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 11 variables, input treesize:768, output treesize:750 [2018-04-13 06:43:48,538 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:48,539 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:48,540 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:48,541 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:48,544 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 1 case distinctions, treesize of input 270 treesize of output 278 [2018-04-13 06:43:48,545 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 06:43:48,912 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:48,914 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 259 treesize of output 296 [2018-04-13 06:43:48,914 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:49,244 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:49,246 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:49,247 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 292 treesize of output 307 [2018-04-13 06:43:49,247 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:49,554 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:49,555 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:49,556 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:49,556 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:49,559 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 1 case distinctions, treesize of input 270 treesize of output 278 [2018-04-13 06:43:49,560 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-13 06:43:49,896 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:49,898 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 259 treesize of output 292 [2018-04-13 06:43:49,898 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:50,212 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:50,213 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:50,246 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:50,247 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:50,251 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 1 case distinctions, treesize of input 292 treesize of output 300 [2018-04-13 06:43:50,251 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-13 06:43:50,628 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 285 treesize of output 300 [2018-04-13 06:43:50,628 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:50,930 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:50,930 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:50,932 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 260 treesize of output 311 [2018-04-13 06:43:50,932 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:51,217 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:51,218 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:51,219 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:51,219 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:51,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 291 treesize of output 299 [2018-04-13 06:43:51,223 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-04-13 06:43:51,575 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:51,575 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:51,576 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:51,577 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:51,580 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 1 case distinctions, treesize of input 259 treesize of output 267 [2018-04-13 06:43:51,581 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-04-13 06:43:51,944 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:51,944 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:51,945 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:51,946 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:51,949 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 1 case distinctions, treesize of input 260 treesize of output 268 [2018-04-13 06:43:51,950 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-04-13 06:43:52,246 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:52,247 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 249 treesize of output 300 [2018-04-13 06:43:52,248 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:52,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 12 dim-1 vars, End of recursive call: 16 dim-0 vars, and 6 xjuncts. [2018-04-13 06:43:52,511 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 28 variables, input treesize:1661, output treesize:1589 [2018-04-13 06:43:52,766 WARN L148 SmtUtils]: Spent 119ms on a formula simplification that was a NOOP. DAG size: 335 [2018-04-13 06:43:53,027 WARN L148 SmtUtils]: Spent 112ms on a formula simplification that was a NOOP. DAG size: 335 [2018-04-13 06:43:53,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 303 treesize of output 285 [2018-04-13 06:43:53,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 288 treesize of output 287 [2018-04-13 06:43:53,073 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:53,387 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 2 case distinctions, treesize of input 240 treesize of output 233 [2018-04-13 06:43:53,388 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-13 06:43:53,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 06:43:55,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 307 treesize of output 348 [2018-04-13 06:43:55,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 344 treesize of output 343 [2018-04-13 06:43:55,071 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:55,429 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:43:56,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 307 treesize of output 273 [2018-04-13 06:43:56,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 276 treesize of output 275 [2018-04-13 06:43:56,610 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:56,831 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 2 case distinctions, treesize of input 236 treesize of output 229 [2018-04-13 06:43:56,832 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-04-13 06:43:57,112 INFO L267 ElimStorePlain]: Start of recursive call 7: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 06:43:58,458 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:43:58,486 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 281 treesize of output 321 [2018-04-13 06:43:58,492 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-13 06:43:58,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 278 treesize of output 277 [2018-04-13 06:43:58,732 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-13 06:43:58,902 INFO L267 ElimStorePlain]: Start of recursive call 10: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:44:00,010 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:44:00,015 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:44:00,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 277 treesize of output 283 [2018-04-13 06:44:00,040 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:44:00,055 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 265 treesize of output 277 [2018-04-13 06:44:00,057 INFO L267 ElimStorePlain]: Start of recursive call 14: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 7 xjuncts. [2018-04-13 06:44:00,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 246 treesize of output 245 [2018-04-13 06:44:00,352 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-13 06:44:00,579 INFO L267 ElimStorePlain]: Start of recursive call 13: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 06:44:01,791 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:44:01,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 267 treesize of output 287 [2018-04-13 06:44:01,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 300 treesize of output 299 [2018-04-13 06:44:01,837 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-13 06:44:02,343 INFO L267 ElimStorePlain]: Start of recursive call 16: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:44:03,296 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:44:03,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 277 treesize of output 297 [2018-04-13 06:44:03,333 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 0 case distinctions, treesize of input 281 treesize of output 264 [2018-04-13 06:44:03,334 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-13 06:44:03,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 274 treesize of output 273 [2018-04-13 06:44:03,527 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-13 06:44:03,690 INFO L267 ElimStorePlain]: Start of recursive call 18: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:44:04,572 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:44:04,576 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:44:04,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 273 treesize of output 281 [2018-04-13 06:44:04,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 284 treesize of output 283 [2018-04-13 06:44:04,613 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-13 06:44:04,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 222 treesize of output 219 [2018-04-13 06:44:04,961 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 2 xjuncts. [2018-04-13 06:44:05,216 INFO L267 ElimStorePlain]: Start of recursive call 21: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 06:44:06,114 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:44:06,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 267 treesize of output 291 [2018-04-13 06:44:06,151 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:44:06,151 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 289 treesize of output 301 [2018-04-13 06:44:06,152 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-13 06:44:06,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 268 treesize of output 267 [2018-04-13 06:44:06,372 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-13 06:44:06,539 INFO L267 ElimStorePlain]: Start of recursive call 24: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:44:07,284 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:44:07,288 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:44:07,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 267 treesize of output 273 [2018-04-13 06:44:07,332 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 253 treesize of output 269 [2018-04-13 06:44:07,336 INFO L267 ElimStorePlain]: Start of recursive call 28: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 14 xjuncts. [2018-04-13 06:44:07,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 240 treesize of output 239 [2018-04-13 06:44:07,682 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-13 06:44:07,901 INFO L267 ElimStorePlain]: Start of recursive call 27: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 06:44:08,653 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:44:08,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 222 treesize of output 208 [2018-04-13 06:44:08,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 84 [2018-04-13 06:44:08,659 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-04-13 06:44:08,688 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:44:08,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 259 treesize of output 292 [2018-04-13 06:44:08,724 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 0 case distinctions, treesize of input 269 treesize of output 264 [2018-04-13 06:44:08,725 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-04-13 06:44:09,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 260 treesize of output 259 [2018-04-13 06:44:09,251 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-04-13 06:44:09,328 INFO L267 ElimStorePlain]: Start of recursive call 32: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:44:09,973 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:44:09,977 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:44:09,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 267 treesize of output 267 [2018-04-13 06:44:10,024 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 247 treesize of output 269 [2018-04-13 06:44:10,027 INFO L267 ElimStorePlain]: Start of recursive call 36: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 14 xjuncts. [2018-04-13 06:44:10,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 236 treesize of output 235 [2018-04-13 06:44:10,363 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-04-13 06:44:10,589 INFO L267 ElimStorePlain]: Start of recursive call 35: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 06:44:11,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 12 dim-2 vars, End of recursive call: 26 dim-0 vars, and 12 xjuncts. [2018-04-13 06:44:11,241 INFO L202 ElimStorePlain]: Needed 37 recursive calls to eliminate 28 variables, input treesize:1703, output treesize:2647 [2018-04-13 06:44:12,178 WARN L148 SmtUtils]: Spent 671ms on a formula simplification that was a NOOP. DAG size: 486 [2018-04-13 06:44:12,193 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 301 treesize of output 292 [2018-04-13 06:44:12,193 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:44:12,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 198 [2018-04-13 06:44:12,896 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:44:13,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 198 [2018-04-13 06:44:13,615 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:44:14,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 331 treesize of output 322 [2018-04-13 06:44:14,311 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:44:14,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 213 treesize of output 208 [2018-04-13 06:44:14,989 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:44:15,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 301 treesize of output 292 [2018-04-13 06:44:15,689 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 06:44:16,361 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 331 treesize of output 322 [2018-04-13 06:44:16,361 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-13 06:44:17,028 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 291 treesize of output 282 [2018-04-13 06:44:17,029 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 06:44:17,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 291 treesize of output 282 [2018-04-13 06:44:17,714 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-13 06:44:18,396 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 223 treesize of output 218 [2018-04-13 06:44:18,397 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-13 06:44:19,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 223 treesize of output 218 [2018-04-13 06:44:19,059 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-13 06:44:19,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 213 treesize of output 208 [2018-04-13 06:44:19,704 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-13 06:44:20,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 32 dim-0 vars, 12 dim-1 vars, End of recursive call: 32 dim-0 vars, and 12 xjuncts. [2018-04-13 06:44:20,359 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 44 variables, input treesize:3125, output treesize:3041 [2018-04-13 06:44:21,181 WARN L148 SmtUtils]: Spent 491ms on a formula simplification that was a NOOP. DAG size: 628 [2018-04-13 06:44:21,203 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:44:21,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 312 treesize of output 322 [2018-04-13 06:44:21,239 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:44:21,240 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:44:21,240 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 337 treesize of output 360 [2018-04-13 06:44:21,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:44:21,692 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:44:21,693 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:44:21,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 281 treesize of output 309 [2018-04-13 06:44:21,699 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-13 06:44:21,926 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:44:21,928 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:44:21,929 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:44:21,935 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 2 case distinctions, treesize of input 269 treesize of output 335 [2018-04-13 06:44:21,936 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-13 06:44:22,245 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-13 06:44:29,971 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 238 treesize of output 227 [2018-04-13 06:44:29,974 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:44:29,987 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:44:29,987 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:44:29,990 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 72 treesize of output 103 [2018-04-13 06:44:29,990 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 06:44:30,037 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:44:38,263 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:44:38,269 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:44:38,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 302 treesize of output 299 [2018-04-13 06:44:38,300 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 06:44:38,300 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 06:44:38,800 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:44:38,801 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:44:38,812 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 3 case distinctions, treesize of input 255 treesize of output 257 [2018-04-13 06:44:38,813 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-13 06:44:39,277 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-13 06:44:39,686 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:44:39,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 297 treesize of output 304 [2018-04-13 06:44:39,688 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-13 06:44:39,978 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:44:39,978 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:44:39,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 273 treesize of output 294 [2018-04-13 06:44:39,986 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-04-13 06:44:40,231 INFO L267 ElimStorePlain]: Start of recursive call 8: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-13 06:44:55,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, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 234 treesize of output 226 [2018-04-13 06:44:55,185 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:44:55,186 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:44:55,187 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:44:55,187 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 44 [2018-04-13 06:44:55,187 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-13 06:44:55,235 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:45:08,083 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:45:08,089 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 228 treesize of output 206 [2018-04-13 06:45:08,092 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:45:08,092 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:45:08,093 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:45:08,095 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 144 treesize of output 185 [2018-04-13 06:45:08,095 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-13 06:45:08,133 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:45:19,717 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:45:19,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 312 treesize of output 322 [2018-04-13 06:45:19,763 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-13 06:45:20,229 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:45:20,230 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 307 treesize of output 314 [2018-04-13 06:45:20,231 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-13 06:45:20,528 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:45:20,528 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:45:20,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 253 treesize of output 281 [2018-04-13 06:45:20,536 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 2 xjuncts. [2018-04-13 06:45:20,770 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:45:20,772 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:45:20,780 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 269 treesize of output 319 [2018-04-13 06:45:20,781 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 2 xjuncts. [2018-04-13 06:45:21,102 INFO L267 ElimStorePlain]: Start of recursive call 18: 5 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-13 06:45:32,594 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:45:32,594 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:45:32,596 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:45:32,599 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 218 treesize of output 239 [2018-04-13 06:45:32,602 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:45:32,604 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:45:32,604 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:45:32,605 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:45:32,612 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 77 [2018-04-13 06:45:32,613 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-13 06:45:32,657 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:45:43,023 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:45:43,024 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:45:43,026 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:45:43,029 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 224 treesize of output 245 [2018-04-13 06:45:43,032 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:45:43,033 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:45:43,034 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:45:43,034 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:45:43,041 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 77 [2018-04-13 06:45:43,042 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-13 06:45:43,090 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:45:52,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 342 treesize of output 369 [2018-04-13 06:45:52,461 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:45:52,462 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:45:52,473 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 346 treesize of output 386 [2018-04-13 06:45:52,474 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 2 xjuncts. [2018-04-13 06:45:53,321 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:45:53,321 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:45:53,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 307 treesize of output 347 [2018-04-13 06:45:53,337 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 4 xjuncts. [2018-04-13 06:45:53,781 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:45:53,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 337 treesize of output 344 [2018-04-13 06:45:53,783 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-13 06:45:54,074 INFO L267 ElimStorePlain]: Start of recursive call 27: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-13 06:46:05,730 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:46:05,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 302 treesize of output 312 [2018-04-13 06:46:05,776 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:46:05,777 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 325 treesize of output 332 [2018-04-13 06:46:05,777 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-04-13 06:46:06,128 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:46:06,129 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:46:06,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 273 treesize of output 301 [2018-04-13 06:46:06,137 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 2 xjuncts. [2018-04-13 06:46:06,580 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:46:06,582 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:46:06,590 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 259 treesize of output 265 [2018-04-13 06:46:06,591 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 2 xjuncts. [2018-04-13 06:46:06,891 INFO L267 ElimStorePlain]: Start of recursive call 31: 5 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-13 06:46:18,231 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:46:18,234 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:46:18,236 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:46:18,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 247 treesize of output 273 [2018-04-13 06:46:18,242 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:46:18,242 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:46:18,243 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:46:18,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 65 [2018-04-13 06:46:18,243 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-04-13 06:46:18,277 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:46:18,282 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:46:18,289 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:46:18,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 308 treesize of output 303 [2018-04-13 06:46:18,314 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 06:46:18,314 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-04-13 06:46:18,732 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:46:18,732 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:46:18,733 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 303 treesize of output 326 [2018-04-13 06:46:18,733 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-04-13 06:46:19,007 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:46:19,007 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:46:19,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 291 treesize of output 312 [2018-04-13 06:46:19,013 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 2 xjuncts. [2018-04-13 06:46:19,236 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:46:19,238 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:46:19,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 267 treesize of output 267 [2018-04-13 06:46:19,247 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-13 06:46:19,450 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-0 vars, 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-13 06:46:19,453 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:46:19,455 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:46:19,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 267 treesize of output 236 [2018-04-13 06:46:19,464 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:46:19,465 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:46:19,475 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 218 treesize of output 227 [2018-04-13 06:46:19,477 INFO L267 ElimStorePlain]: Start of recursive call 43: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-13 06:46:19,564 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-13 06:46:32,239 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:46:32,240 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:46:32,248 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:46:32,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 267 treesize of output 267 [2018-04-13 06:46:32,253 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:46:32,254 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:46:32,254 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:46:32,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 65 [2018-04-13 06:46:32,254 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-04-13 06:46:32,289 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:46:32,292 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:46:32,292 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:46:32,293 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:46:32,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 257 treesize of output 241 [2018-04-13 06:46:32,302 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:46:32,313 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 227 treesize of output 221 [2018-04-13 06:46:32,315 INFO L267 ElimStorePlain]: Start of recursive call 47: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-13 06:46:32,410 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-13 06:46:32,413 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:46:32,417 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:46:32,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 298 treesize of output 293 [2018-04-13 06:46:32,447 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:46:32,448 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:46:32,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 318 treesize of output 339 [2018-04-13 06:46:32,455 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 2 xjuncts. [2018-04-13 06:46:32,828 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:46:32,829 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:46:32,829 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 293 treesize of output 316 [2018-04-13 06:46:32,829 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-04-13 06:46:33,041 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:46:33,042 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:46:33,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 251 treesize of output 253 [2018-04-13 06:46:33,051 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-13 06:46:33,239 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:46:33,622 INFO L267 ElimStorePlain]: Start of recursive call 48: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-13 06:46:47,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 342 treesize of output 393 [2018-04-13 06:46:47,496 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:46:47,497 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:46:47,497 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 389 treesize of output 412 [2018-04-13 06:46:47,497 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-04-13 06:46:47,926 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:46:47,926 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:46:47,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 299 treesize of output 339 [2018-04-13 06:46:47,942 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 4 xjuncts. [2018-04-13 06:46:48,338 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:46:48,339 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:46:48,340 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:46:48,347 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 2 case distinctions, treesize of input 309 treesize of output 365 [2018-04-13 06:46:48,347 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 2 xjuncts. [2018-04-13 06:46:48,929 INFO L267 ElimStorePlain]: Start of recursive call 53: 4 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-13 06:47:03,658 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 238 treesize of output 227 [2018-04-13 06:47:03,661 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:47:03,661 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:47:03,662 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:47:03,662 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:47:03,663 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 72 treesize of output 115 [2018-04-13 06:47:03,663 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-04-13 06:47:03,707 INFO L267 ElimStorePlain]: Start of recursive call 57: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:47:16,933 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:47:16,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 307 treesize of output 273 [2018-04-13 06:47:16,938 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:47:16,941 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:47:16,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 80 [2018-04-13 06:47:16,946 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 2 xjuncts. [2018-04-13 06:47:17,002 INFO L267 ElimStorePlain]: Start of recursive call 59: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 06:47:17,011 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:47:17,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 307 treesize of output 273 [2018-04-13 06:47:17,018 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:47:17,018 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:47:17,019 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:47:17,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 82 [2018-04-13 06:47:17,024 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 2 xjuncts. [2018-04-13 06:47:17,077 INFO L267 ElimStorePlain]: Start of recursive call 61: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 06:47:17,085 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:47:17,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 284 treesize of output 260 [2018-04-13 06:47:17,088 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:47:17,089 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:47:17,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 61 [2018-04-13 06:47:17,089 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-04-13 06:47:17,132 INFO L267 ElimStorePlain]: Start of recursive call 63: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:47:17,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 338 treesize of output 299 [2018-04-13 06:47:17,166 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 06:47:17,166 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-04-13 06:47:17,636 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:47:17,637 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:47:17,645 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 3 case distinctions, treesize of input 281 treesize of output 273 [2018-04-13 06:47:17,646 INFO L267 ElimStorePlain]: Start of recursive call 67: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-13 06:47:18,108 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:47:18,108 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:47:18,109 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 333 treesize of output 356 [2018-04-13 06:47:18,109 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-04-13 06:47:18,428 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:47:18,428 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:47:18,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 311 treesize of output 344 [2018-04-13 06:47:18,437 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 4 xjuncts. [2018-04-13 06:47:18,797 INFO L267 ElimStorePlain]: Start of recursive call 70: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:47:19,119 INFO L267 ElimStorePlain]: Start of recursive call 65: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 6 xjuncts. [2018-04-13 06:47:19,126 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:47:19,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 297 treesize of output 257 [2018-04-13 06:47:19,132 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:47:19,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 253 treesize of output 214 [2018-04-13 06:47:19,134 INFO L267 ElimStorePlain]: Start of recursive call 72: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:47:19,173 INFO L267 ElimStorePlain]: Start of recursive call 71: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:47:31,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 338 treesize of output 301 [2018-04-13 06:47:31,792 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:47:31,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 349 treesize of output 356 [2018-04-13 06:47:31,793 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2018-04-13 06:47:32,259 INFO L267 ElimStorePlain]: Start of recursive call 73: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:47:32,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 299 treesize of output 265 [2018-04-13 06:47:32,271 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:47:32,272 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:47:32,273 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:47:32,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 76 [2018-04-13 06:47:32,275 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2018-04-13 06:47:32,326 INFO L267 ElimStorePlain]: Start of recursive call 75: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:47:32,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 276 treesize of output 252 [2018-04-13 06:47:32,337 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:47:32,337 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:47:32,339 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 33 treesize of output 53 [2018-04-13 06:47:32,339 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-04-13 06:47:32,375 INFO L267 ElimStorePlain]: Start of recursive call 77: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:47:32,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 299 treesize of output 265 [2018-04-13 06:47:32,387 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:47:32,388 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:47:32,389 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:47:32,389 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:47:32,389 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:47:32,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 85 [2018-04-13 06:47:32,391 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2018-04-13 06:47:32,434 INFO L267 ElimStorePlain]: Start of recursive call 79: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:47:32,436 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:47:32,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 289 treesize of output 236 [2018-04-13 06:47:32,445 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:47:32,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 224 treesize of output 198 [2018-04-13 06:47:32,448 INFO L267 ElimStorePlain]: Start of recursive call 82: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:47:32,479 INFO L267 ElimStorePlain]: Start of recursive call 81: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:47:44,600 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 234 treesize of output 226 [2018-04-13 06:47:44,603 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:47:44,604 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:47:44,605 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:47:44,606 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 25 treesize of output 44 [2018-04-13 06:47:44,606 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2018-04-13 06:47:44,648 INFO L267 ElimStorePlain]: Start of recursive call 83: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:47:55,676 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:47:55,683 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 228 treesize of output 206 [2018-04-13 06:47:55,686 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:47:55,687 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:47:55,687 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:47:55,688 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:47:55,688 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 144 treesize of output 197 [2018-04-13 06:47:55,688 INFO L267 ElimStorePlain]: Start of recursive call 86: End of recursive call: and 1 xjuncts. [2018-04-13 06:47:55,736 INFO L267 ElimStorePlain]: Start of recursive call 85: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:48:05,741 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:48:05,747 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 218 treesize of output 196 [2018-04-13 06:48:05,749 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:48:05,750 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:48:05,750 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:48:05,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, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 192 [2018-04-13 06:48:05,751 INFO L267 ElimStorePlain]: Start of recursive call 88: End of recursive call: and 1 xjuncts. [2018-04-13 06:48:05,799 INFO L267 ElimStorePlain]: Start of recursive call 87: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:48:15,363 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:48:15,365 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:48:15,369 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:48:15,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 212 treesize of output 227 [2018-04-13 06:48:15,372 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:48:15,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 146 [2018-04-13 06:48:15,372 INFO L267 ElimStorePlain]: Start of recursive call 90: End of recursive call: and 1 xjuncts. [2018-04-13 06:48:15,405 INFO L267 ElimStorePlain]: Start of recursive call 89: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:48:15,408 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:48:15,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 298 treesize of output 308 [2018-04-13 06:48:15,438 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 06:48:15,438 INFO L267 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 1 xjuncts. [2018-04-13 06:48:15,851 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:48:15,852 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:48:15,852 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 293 treesize of output 316 [2018-04-13 06:48:15,853 INFO L267 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 1 xjuncts. [2018-04-13 06:48:16,113 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:48:16,113 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:48:16,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 269 treesize of output 297 [2018-04-13 06:48:16,119 INFO L267 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 2 xjuncts. [2018-04-13 06:48:16,328 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-13 06:48:16,529 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:48:16,530 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:48:16,530 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:48:16,536 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 2 case distinctions, treesize of input 255 treesize of output 273 [2018-04-13 06:48:16,536 INFO L267 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 2 xjuncts. [2018-04-13 06:48:16,690 INFO L267 ElimStorePlain]: Start of recursive call 91: 5 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-13 06:48:16,692 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:48:16,693 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:48:16,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 274 treesize of output 259 [2018-04-13 06:48:16,707 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:48:16,707 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:48:16,708 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:48:16,713 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 2 case distinctions, treesize of input 160 treesize of output 180 [2018-04-13 06:48:16,714 INFO L267 ElimStorePlain]: Start of recursive call 98: End of recursive call: and 2 xjuncts. [2018-04-13 06:48:16,799 INFO L267 ElimStorePlain]: Start of recursive call 97: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 06:48:16,802 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:48:16,808 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:48:16,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 274 treesize of output 283 [2018-04-13 06:48:16,812 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:48:16,813 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:48:16,813 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:48:16,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 65 [2018-04-13 06:48:16,814 INFO L267 ElimStorePlain]: Start of recursive call 100: End of recursive call: and 1 xjuncts. [2018-04-13 06:48:16,850 INFO L267 ElimStorePlain]: Start of recursive call 99: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:48:24,354 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:48:24,356 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:48:24,359 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:48:24,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 249 [2018-04-13 06:48:24,362 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:48:24,363 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:48:24,364 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:48:24,364 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:48:24,372 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 77 [2018-04-13 06:48:24,372 INFO L267 ElimStorePlain]: Start of recursive call 102: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-13 06:48:24,412 INFO L267 ElimStorePlain]: Start of recursive call 101: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:48:31,329 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:48:31,338 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:48:31,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 308 treesize of output 305 [2018-04-13 06:48:31,373 INFO L267 ElimStorePlain]: Start of recursive call 104: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 06:48:31,762 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:48:31,763 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 303 treesize of output 310 [2018-04-13 06:48:31,764 INFO L267 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 1 xjuncts. [2018-04-13 06:48:31,903 INFO L267 ElimStorePlain]: Start of recursive call 103: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:48:31,906 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:48:31,907 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:48:31,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 267 treesize of output 252 [2018-04-13 06:48:31,923 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:48:31,923 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:48:31,936 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 234 treesize of output 241 [2018-04-13 06:48:31,938 INFO L267 ElimStorePlain]: Start of recursive call 107: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-13 06:48:32,038 INFO L267 ElimStorePlain]: Start of recursive call 106: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-13 06:48:32,040 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:48:32,042 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:48:32,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 275 treesize of output 257 [2018-04-13 06:48:32,050 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:48:32,051 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:48:32,051 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:48:32,052 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 35 treesize of output 55 [2018-04-13 06:48:32,053 INFO L267 ElimStorePlain]: Start of recursive call 109: End of recursive call: and 1 xjuncts. [2018-04-13 06:48:32,086 INFO L267 ElimStorePlain]: Start of recursive call 108: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:48:38,502 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:48:38,503 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:48:38,506 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:48:38,508 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 214 treesize of output 235 [2018-04-13 06:48:38,510 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:48:38,511 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:48:38,512 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:48:38,514 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:48:38,522 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 77 [2018-04-13 06:48:38,523 INFO L267 ElimStorePlain]: Start of recursive call 111: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-13 06:48:38,575 INFO L267 ElimStorePlain]: Start of recursive call 110: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:48:44,525 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:48:44,529 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 214 treesize of output 192 [2018-04-13 06:48:44,531 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:48:44,532 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:48:44,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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 171 [2018-04-13 06:48:44,534 INFO L267 ElimStorePlain]: Start of recursive call 113: End of recursive call: and 1 xjuncts. [2018-04-13 06:48:44,567 INFO L267 ElimStorePlain]: Start of recursive call 112: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:48:49,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 32 dim-0 vars, 24 dim-2 vars, End of recursive call: 102 dim-0 vars, and 42 xjuncts. [2018-04-13 06:48:49,482 INFO L202 ElimStorePlain]: Needed 113 recursive calls to eliminate 56 variables, input treesize:3281, output treesize:10404 [2018-04-13 06:48:55,344 WARN L151 SmtUtils]: Spent 4899ms on a formula simplification. DAG size of input: 1976 DAG size of output 1156 [2018-04-13 06:48:57,642 WARN L148 SmtUtils]: Spent 1617ms on a formula simplification that was a NOOP. DAG size: 1156 [2018-04-13 06:48:58,808 WARN L151 SmtUtils]: Spent 355ms on a formula simplification. DAG size of input: 1226 DAG size of output 212 [2018-04-13 06:48:59,146 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:48:59,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 319 treesize of output 300 [2018-04-13 06:48:59,163 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 275 treesize of output 261 [2018-04-13 06:48:59,164 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:48:59,350 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:48:59,350 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:48:59,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 239 treesize of output 234 [2018-04-13 06:48:59,351 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:48:59,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 259 treesize of output 252 [2018-04-13 06:48:59,529 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:48:59,703 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:48:59,704 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:48:59,704 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:48:59,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 229 treesize of output 234 [2018-04-13 06:48:59,705 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:48:59,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 252 treesize of output 238 [2018-04-13 06:48:59,864 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 06:49:00,032 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:49:00,032 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:49:00,033 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 238 treesize of output 233 [2018-04-13 06:49:00,033 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-13 06:49:00,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 255 treesize of output 248 [2018-04-13 06:49:00,193 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 06:49:00,357 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:49:00,358 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:49:00,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 220 treesize of output 204 [2018-04-13 06:49:00,358 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-13 06:49:00,507 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:49:00,508 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:49:00,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 211 treesize of output 183 [2018-04-13 06:49:00,508 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-13 06:49:00,623 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:49:00,624 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:49:00,625 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:49:00,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 234 treesize of output 221 [2018-04-13 06:49:00,626 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-13 06:49:00,723 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:49:00,724 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:49:00,724 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 202 treesize of output 188 [2018-04-13 06:49:00,725 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-13 06:49:00,788 INFO L267 ElimStorePlain]: Start of recursive call 2: 12 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:49:00,928 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:49:00,929 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:49:00,930 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 223 treesize of output 208 [2018-04-13 06:49:00,933 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:49:00,934 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:49:00,939 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 100 [2018-04-13 06:49:00,939 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-13 06:49:00,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-13 06:49:00,976 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-13 06:49:01,018 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:49:01,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 43 [2018-04-13 06:49:01,019 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-13 06:49:01,040 INFO L267 ElimStorePlain]: Start of recursive call 14: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:49:01,166 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:49:01,167 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:49:01,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 309 treesize of output 223 [2018-04-13 06:49:01,170 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:49:01,171 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:49:01,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2018-04-13 06:49:01,172 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-13 06:49:01,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 69 [2018-04-13 06:49:01,212 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:49:01,232 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:49:01,233 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 105 treesize of output 68 [2018-04-13 06:49:01,233 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-13 06:49:01,251 INFO L267 ElimStorePlain]: Start of recursive call 18: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:49:01,358 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 117 treesize of output 91 [2018-04-13 06:49:01,359 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:49:01,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-04-13 06:49:01,360 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-13 06:49:01,374 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:49:01,375 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:49:01,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-04-13 06:49:01,375 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-13 06:49:01,386 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 23 treesize of output 7 [2018-04-13 06:49:01,386 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-13 06:49:01,394 INFO L267 ElimStorePlain]: Start of recursive call 22: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:49:01,490 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 118 treesize of output 94 [2018-04-13 06:49:01,492 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:49:01,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-04-13 06:49:01,493 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-13 06:49:01,512 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:49:01,513 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:49:01,513 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:49:01,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 22 [2018-04-13 06:49:01,514 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-13 06:49:01,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-13 06:49:01,527 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-13 06:49:01,535 INFO L267 ElimStorePlain]: Start of recursive call 26: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:49:01,618 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:49:01,620 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:49:01,621 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 201 treesize of output 188 [2018-04-13 06:49:01,624 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:49:01,625 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:49:01,634 INFO L477 Elim1Store]: Elim1 applied some 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 77 treesize of output 104 [2018-04-13 06:49:01,636 INFO L267 ElimStorePlain]: Start of recursive call 31: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-13 06:49:01,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 7 treesize of output 1 [2018-04-13 06:49:01,683 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-04-13 06:49:01,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, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 33 [2018-04-13 06:49:01,707 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-04-13 06:49:01,741 INFO L267 ElimStorePlain]: Start of recursive call 30: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:49:01,814 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 107 treesize of output 87 [2018-04-13 06:49:01,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-13 06:49:01,819 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-04-13 06:49:01,859 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:49:01,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, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2018-04-13 06:49:01,860 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-04-13 06:49:01,907 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:49:01,907 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:49:01,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-04-13 06:49:01,908 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-04-13 06:49:01,938 INFO L267 ElimStorePlain]: Start of recursive call 34: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:49:02,073 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:49:02,077 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:49:02,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 171 treesize of output 143 [2018-04-13 06:49:02,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, 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 120 [2018-04-13 06:49:02,089 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-04-13 06:49:02,214 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 116 treesize of output 101 [2018-04-13 06:49:02,215 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:49:02,326 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:49:02,327 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:49:02,328 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:49:02,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 122 [2018-04-13 06:49:02,333 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-13 06:49:02,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 77 [2018-04-13 06:49:02,480 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-04-13 06:49:02,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 87 [2018-04-13 06:49:02,482 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-04-13 06:49:02,604 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:49:02,604 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:49:02,605 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:49:02,605 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:49:02,606 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 132 [2018-04-13 06:49:02,606 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-04-13 06:49:02,724 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 109 treesize of output 94 [2018-04-13 06:49:02,724 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:49:02,839 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:49:02,839 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:49:02,840 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:49:02,840 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:49:02,841 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 128 [2018-04-13 06:49:02,841 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-04-13 06:49:02,958 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 71 [2018-04-13 06:49:02,958 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-04-13 06:49:03,069 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:49:03,070 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:49:03,070 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 74 [2018-04-13 06:49:03,070 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-04-13 06:49:03,072 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:49:03,072 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:49:03,072 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 77 treesize of output 72 [2018-04-13 06:49:03,073 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-04-13 06:49:03,177 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:49:03,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 105 treesize of output 101 [2018-04-13 06:49:03,187 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-13 06:49:03,308 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:49:03,309 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:49:03,309 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:49:03,310 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:49:03,310 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 118 [2018-04-13 06:49:03,310 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-04-13 06:49:03,427 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 95 treesize of output 67 [2018-04-13 06:49:03,427 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-04-13 06:49:03,527 INFO L267 ElimStorePlain]: Start of recursive call 38: 12 dim-1 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-04-13 06:49:03,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 14 dim-0 vars, 8 dim-2 vars, End of recursive call: 22 dim-0 vars, and 9 xjuncts. [2018-04-13 06:49:03,661 INFO L202 ElimStorePlain]: Needed 52 recursive calls to eliminate 22 variables, input treesize:1100, output treesize:435 [2018-04-13 06:49:04,464 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:49:04,464 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 06:49:04,464 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-04-13 06:49:04,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-13 06:49:04,464 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-13 06:49:04,464 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1236, Unknown=0, NotChecked=0, Total=1332 [2018-04-13 06:49:04,465 INFO L87 Difference]: Start difference. First operand 1058 states and 1303 transitions. Second operand 37 states. [2018-04-13 06:49:06,156 WARN L151 SmtUtils]: Spent 139ms on a formula simplification. DAG size of input: 86 DAG size of output 68 [2018-04-13 06:49:06,735 WARN L151 SmtUtils]: Spent 198ms on a formula simplification. DAG size of input: 120 DAG size of output 106 [2018-04-13 06:49:07,243 WARN L151 SmtUtils]: Spent 255ms on a formula simplification. DAG size of input: 148 DAG size of output 120 [2018-04-13 06:49:07,666 WARN L151 SmtUtils]: Spent 194ms on a formula simplification. DAG size of input: 126 DAG size of output 110 [2018-04-13 06:49:08,721 WARN L151 SmtUtils]: Spent 196ms on a formula simplification. DAG size of input: 119 DAG size of output 119 [2018-04-13 06:49:09,243 WARN L151 SmtUtils]: Spent 278ms on a formula simplification. DAG size of input: 138 DAG size of output 138 [2018-04-13 06:49:09,781 WARN L151 SmtUtils]: Spent 339ms on a formula simplification. DAG size of input: 146 DAG size of output 146 [2018-04-13 06:49:10,636 WARN L151 SmtUtils]: Spent 619ms on a formula simplification. DAG size of input: 235 DAG size of output 234 [2018-04-13 06:49:11,615 WARN L151 SmtUtils]: Spent 600ms on a formula simplification. DAG size of input: 237 DAG size of output 233 [2018-04-13 06:49:12,536 WARN L151 SmtUtils]: Spent 674ms on a formula simplification. DAG size of input: 338 DAG size of output 242 [2018-04-13 06:49:13,264 WARN L151 SmtUtils]: Spent 505ms on a formula simplification. DAG size of input: 221 DAG size of output 221 [2018-04-13 06:49:13,975 WARN L151 SmtUtils]: Spent 509ms on a formula simplification. DAG size of input: 226 DAG size of output 226 [2018-04-13 06:49:14,781 WARN L151 SmtUtils]: Spent 517ms on a formula simplification. DAG size of input: 226 DAG size of output 226 [2018-04-13 06:49:15,666 WARN L151 SmtUtils]: Spent 596ms on a formula simplification. DAG size of input: 231 DAG size of output 227 [2018-04-13 06:49:16,448 WARN L148 SmtUtils]: Spent 181ms on a formula simplification that was a NOOP. DAG size: 265 [2018-04-13 06:49:16,908 WARN L148 SmtUtils]: Spent 230ms on a formula simplification that was a NOOP. DAG size: 424 [2018-04-13 06:49:17,372 WARN L148 SmtUtils]: Spent 256ms on a formula simplification that was a NOOP. DAG size: 417 [2018-04-13 06:49:18,828 WARN L151 SmtUtils]: Spent 1026ms on a formula simplification. DAG size of input: 486 DAG size of output 423 [2018-04-13 06:49:25,631 WARN L151 SmtUtils]: Spent 3958ms on a formula simplification. DAG size of input: 893 DAG size of output 887 [2018-04-13 06:49:46,105 WARN L151 SmtUtils]: Spent 18574ms on a formula simplification. DAG size of input: 1594 DAG size of output 1594 [2018-04-13 06:50:07,184 WARN L151 SmtUtils]: Spent 19743ms on a formula simplification. DAG size of input: 1668 DAG size of output 880 [2018-04-13 06:50:17,027 WARN L151 SmtUtils]: Spent 2567ms on a formula simplification. DAG size of input: 1208 DAG size of output 641 [2018-04-13 06:50:20,227 WARN L151 SmtUtils]: Spent 2766ms on a formula simplification. DAG size of input: 1236 DAG size of output 648 [2018-04-13 06:50:20,984 WARN L151 SmtUtils]: Spent 300ms on a formula simplification. DAG size of input: 1235 DAG size of output 220 [2018-04-13 06:50:23,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:50:23,724 INFO L93 Difference]: Finished difference Result 1179 states and 1434 transitions. [2018-04-13 06:50:23,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-13 06:50:23,725 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 73 [2018-04-13 06:50:23,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:50:23,726 INFO L225 Difference]: With dead ends: 1179 [2018-04-13 06:50:23,726 INFO L226 Difference]: Without dead ends: 1179 [2018-04-13 06:50:23,727 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1228 ImplicationChecksByTransitivity, 75.8s TimeCoverageRelationStatistics Valid=395, Invalid=4574, Unknown=1, NotChecked=0, Total=4970 [2018-04-13 06:50:23,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2018-04-13 06:50:23,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 1130. [2018-04-13 06:50:23,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1130 states. [2018-04-13 06:50:23,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1383 transitions. [2018-04-13 06:50:23,732 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1383 transitions. Word has length 73 [2018-04-13 06:50:23,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:50:23,733 INFO L459 AbstractCegarLoop]: Abstraction has 1130 states and 1383 transitions. [2018-04-13 06:50:23,733 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-13 06:50:23,733 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1383 transitions. [2018-04-13 06:50:23,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-04-13 06:50:23,733 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:50:23,733 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:50:23,733 INFO L408 AbstractCegarLoop]: === Iteration 56 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:50:23,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1585897118, now seen corresponding path program 1 times [2018-04-13 06:50:23,734 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:50:23,734 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:50:23,734 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:50:23,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:50:23,734 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:50:23,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:50:23,745 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:50:23,749 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:50:23,749 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:50:23,749 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:50:23,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:50:23,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:50:23,809 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:50:23,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 06:50:23,823 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:23,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:50:23,826 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 06:50:23,848 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:23,848 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:23,849 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-13 06:50:23,849 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:23,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:50:23,856 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-13 06:50:23,866 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-13 06:50:23,867 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-13 06:50:23,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:23,869 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:50:23,876 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-13 06:50:23,876 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:36 [2018-04-13 06:50:23,907 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:23,912 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 45 treesize of output 42 [2018-04-13 06:50:23,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:50:23,914 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:23,919 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:50:23,929 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-13 06:50:23,929 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:49 [2018-04-13 06:50:23,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 46 [2018-04-13 06:50:23,973 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 22 treesize of output 29 [2018-04-13 06:50:23,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:23,988 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:50:24,000 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-13 06:50:24,000 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:71, output treesize:61 [2018-04-13 06:50:24,023 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:24,023 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:24,024 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:24,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 58 [2018-04-13 06:50:24,024 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:24,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-13 06:50:24,038 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:75, output treesize:83 [2018-04-13 06:50:24,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 69 [2018-04-13 06:50:24,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:50:24,084 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:24,092 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:50:24,106 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-13 06:50:24,106 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:94, output treesize:90 [2018-04-13 06:50:24,135 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:24,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 83 [2018-04-13 06:50:24,138 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 23 treesize of output 23 [2018-04-13 06:50:24,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:24,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:50:24,162 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-13 06:50:24,162 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:98, output treesize:111 [2018-04-13 06:50:24,291 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:24,292 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:24,292 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 36 treesize of output 86 [2018-04-13 06:50:24,292 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:24,305 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-13 06:50:24,305 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:124, output treesize:104 [2018-04-13 06:50:24,366 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:24,367 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:24,368 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:24,369 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:24,369 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:24,373 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 117 [2018-04-13 06:50:24,373 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 06:50:24,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-04-13 06:50:24,409 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:118, output treesize:256 [2018-04-13 06:50:24,515 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:24,515 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:24,516 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:24,517 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:24,523 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 149 [2018-04-13 06:50:24,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-13 06:50:24,525 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:24,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:50:24,584 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:24,587 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:24,589 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 132 treesize of output 110 [2018-04-13 06:50:24,611 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 8 case distinctions, treesize of input 50 treesize of output 84 [2018-04-13 06:50:24,614 INFO L267 ElimStorePlain]: Start of recursive call 5: 16 dim-0 vars, End of recursive call: 16 dim-0 vars, and 25 xjuncts. [2018-04-13 06:50:24,766 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 8 dim-0 vars, and 11 xjuncts. [2018-04-13 06:50:25,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-2 vars, End of recursive call: 45 dim-0 vars, and 12 xjuncts. [2018-04-13 06:50:25,014 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 11 variables, input treesize:278, output treesize:1280 [2018-04-13 06:50:25,243 WARN L151 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 380 DAG size of output 126 [2018-04-13 06:50:25,406 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 130 DAG size of output 130 [2018-04-13 06:50:25,410 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:25,413 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:25,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, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 110 [2018-04-13 06:50:25,417 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:50:25,424 INFO L477 Elim1Store]: Elim1 applied some 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 3 case distinctions, treesize of input 28 treesize of output 52 [2018-04-13 06:50:25,425 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-13 06:50:25,444 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:50:25,551 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:25,553 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:25,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 112 [2018-04-13 06:50:25,580 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 33 treesize of output 79 [2018-04-13 06:50:25,582 INFO L267 ElimStorePlain]: Start of recursive call 5: 16 dim-0 vars, End of recursive call: 16 dim-0 vars, and 28 xjuncts. [2018-04-13 06:50:25,715 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 8 dim-0 vars, and 11 xjuncts. [2018-04-13 06:50:26,081 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:26,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 112 [2018-04-13 06:50:26,088 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:26,089 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 29 [2018-04-13 06:50:26,089 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:26,106 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:50:26,433 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:26,434 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:26,434 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:26,436 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:26,442 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 167 [2018-04-13 06:50:26,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 16 treesize of output 15 [2018-04-13 06:50:26,444 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:26,464 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:50:26,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 4 dim-2 vars, End of recursive call: 51 dim-0 vars, and 14 xjuncts. [2018-04-13 06:50:26,765 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 17 variables, input treesize:464, output treesize:1671 [2018-04-13 06:50:27,079 WARN L151 SmtUtils]: Spent 162ms on a formula simplification. DAG size of input: 431 DAG size of output 154 [2018-04-13 06:50:27,388 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:27,388 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:27,389 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 144 treesize of output 148 [2018-04-13 06:50:27,389 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:27,500 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:27,500 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:27,501 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:27,501 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:27,502 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 159 treesize of output 183 [2018-04-13 06:50:27,502 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:27,625 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:27,626 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:27,626 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 115 treesize of output 125 [2018-04-13 06:50:27,626 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:27,725 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:27,725 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 110 treesize of output 130 [2018-04-13 06:50:27,726 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:27,820 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:27,821 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:27,821 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 146 treesize of output 150 [2018-04-13 06:50:27,821 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:27,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 23 dim-0 vars, 5 dim-1 vars, End of recursive call: 23 dim-0 vars, and 5 xjuncts. [2018-04-13 06:50:27,911 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 28 variables, input treesize:675, output treesize:545 [2018-04-13 06:50:28,250 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:28,251 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:28,251 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:28,252 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:28,252 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:28,253 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:28,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 132 [2018-04-13 06:50:28,266 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 44 [2018-04-13 06:50:28,267 INFO L267 ElimStorePlain]: Start of recursive call 3: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-04-13 06:50:28,305 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:50:28,315 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:28,317 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 48 treesize of output 48 [2018-04-13 06:50:28,318 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:28,321 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:50:28,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 56 [2018-04-13 06:50:28,325 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-13 06:50:28,326 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:50:28,330 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 44 treesize of output 52 [2018-04-13 06:50:28,331 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-13 06:50:28,332 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:50:28,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-04-13 06:50:28,332 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:28,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, 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 30 [2018-04-13 06:50:28,375 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:28,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 26 [2018-04-13 06:50:28,377 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:28,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 26 [2018-04-13 06:50:28,378 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:28,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, 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 30 [2018-04-13 06:50:28,379 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:28,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-04-13 06:50:28,410 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:28,436 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-04-13 06:50:28,552 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:28,553 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:28,555 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:28,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 109 [2018-04-13 06:50:28,557 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:50:28,562 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 55 [2018-04-13 06:50:28,562 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-13 06:50:28,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-04-13 06:50:28,583 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:28,593 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:28,595 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:28,598 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 1 case distinctions, treesize of input 37 treesize of output 35 [2018-04-13 06:50:28,598 INFO L267 ElimStorePlain]: Start of recursive call 16: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 06:50:28,616 INFO L267 ElimStorePlain]: Start of recursive call 13: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-13 06:50:28,743 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:28,744 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:28,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 97 [2018-04-13 06:50:28,782 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:28,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 14 [2018-04-13 06:50:28,783 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:28,798 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:50:28,799 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-13 06:50:28,799 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:28,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-04-13 06:50:28,810 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:28,817 INFO L267 ElimStorePlain]: Start of recursive call 17: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:50:28,928 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:28,928 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:28,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 92 [2018-04-13 06:50:28,932 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:50:28,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-04-13 06:50:28,932 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:28,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-13 06:50:28,947 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:28,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-04-13 06:50:28,958 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:28,964 INFO L267 ElimStorePlain]: Start of recursive call 21: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:50:29,067 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:29,068 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:29,070 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:29,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 109 [2018-04-13 06:50:29,073 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:50:29,077 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 55 [2018-04-13 06:50:29,077 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-13 06:50:29,097 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:29,098 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:29,098 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 32 treesize of output 25 [2018-04-13 06:50:29,098 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:50:29,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-04-13 06:50:29,111 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:29,118 INFO L267 ElimStorePlain]: Start of recursive call 25: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:50:29,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 23 dim-0 vars, 5 dim-2 vars, End of recursive call: 12 dim-0 vars, and 9 xjuncts. [2018-04-13 06:50:29,210 INFO L202 ElimStorePlain]: Needed 28 recursive calls to eliminate 28 variables, input treesize:590, output treesize:249 [2018-04-13 06:50:29,348 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:29,348 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:29,348 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:29,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-04-13 06:50:29,349 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:29,354 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-13 06:50:29,354 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:20 [2018-04-13 06:50:29,455 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:50:29,455 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 06:50:29,455 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-04-13 06:50:29,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-13 06:50:29,456 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-13 06:50:29,456 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1040, Unknown=0, NotChecked=0, Total=1122 [2018-04-13 06:50:29,456 INFO L87 Difference]: Start difference. First operand 1130 states and 1383 transitions. Second operand 34 states. [2018-04-13 06:50:32,111 WARN L151 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 123 DAG size of output 123 [2018-04-13 06:50:32,688 WARN L151 SmtUtils]: Spent 320ms on a formula simplification. DAG size of input: 201 DAG size of output 198 [2018-04-13 06:50:33,378 WARN L151 SmtUtils]: Spent 386ms on a formula simplification. DAG size of input: 242 DAG size of output 233 [2018-04-13 06:50:34,601 WARN L148 SmtUtils]: Spent 276ms on a formula simplification that was a NOOP. DAG size: 244 [2018-04-13 06:50:34,898 WARN L151 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 184 DAG size of output 180 [2018-04-13 06:50:35,114 WARN L151 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 184 DAG size of output 180 [2018-04-13 06:50:35,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 06:50:35,793 INFO L93 Difference]: Finished difference Result 1498 states and 1804 transitions. [2018-04-13 06:50:35,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-13 06:50:35,794 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 73 [2018-04-13 06:50:35,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 06:50:35,795 INFO L225 Difference]: With dead ends: 1498 [2018-04-13 06:50:35,795 INFO L226 Difference]: Without dead ends: 1498 [2018-04-13 06:50:35,795 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 795 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=397, Invalid=3385, Unknown=0, NotChecked=0, Total=3782 [2018-04-13 06:50:35,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1498 states. [2018-04-13 06:50:35,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1498 to 1136. [2018-04-13 06:50:35,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1136 states. [2018-04-13 06:50:35,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 1136 states and 1389 transitions. [2018-04-13 06:50:35,801 INFO L78 Accepts]: Start accepts. Automaton has 1136 states and 1389 transitions. Word has length 73 [2018-04-13 06:50:35,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 06:50:35,801 INFO L459 AbstractCegarLoop]: Abstraction has 1136 states and 1389 transitions. [2018-04-13 06:50:35,801 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-13 06:50:35,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 1389 transitions. [2018-04-13 06:50:35,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-04-13 06:50:35,802 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 06:50:35,802 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 06:50:35,802 INFO L408 AbstractCegarLoop]: === Iteration 57 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr44AssertViolationMEMORY_FREE, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr45AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-13 06:50:35,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1585897117, now seen corresponding path program 1 times [2018-04-13 06:50:35,802 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 06:50:35,802 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 06:50:35,803 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:50:35,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:50:35,803 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 06:50:35,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:50:35,814 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 06:50:35,818 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 06:50:35,818 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 06:50:35,818 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 06:50:35,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 06:50:35,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 06:50:35,850 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 06:50:35,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 6 treesize of output 5 [2018-04-13 06:50:35,854 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:35,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:50:35,855 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-13 06:50:35,858 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:35,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-13 06:50:35,859 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:35,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:50:35,863 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:14 [2018-04-13 06:50:35,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-13 06:50:35,903 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:35,921 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:35,922 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:35,923 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:35,924 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:35,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2018-04-13 06:50:35,924 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:35,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:50:35,935 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:40 [2018-04-13 06:50:35,949 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-13 06:50:35,950 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-13 06:50:35,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:35,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:50:35,964 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-13 06:50:35,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:50:35,965 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:35,966 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:50:35,976 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-13 06:50:35,976 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:68, output treesize:64 [2018-04-13 06:50:36,013 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:36,016 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-13 06:50:36,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-13 06:50:36,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:36,021 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:50:36,036 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:36,039 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 69 treesize of output 66 [2018-04-13 06:50:36,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-13 06:50:36,041 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:36,046 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:50:36,057 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-13 06:50:36,057 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:110, output treesize:90 [2018-04-13 06:50:36,103 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 48 treesize of output 41 [2018-04-13 06:50:36,105 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 22 treesize of output 29 [2018-04-13 06:50:36,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:36,110 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:50:36,128 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 99 treesize of output 85 [2018-04-13 06:50:36,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 29 [2018-04-13 06:50:36,130 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:36,141 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:50:36,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 06:50:36,154 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:134, output treesize:114 [2018-04-13 06:50:36,189 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:36,189 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 18 treesize of output 27 [2018-04-13 06:50:36,189 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:36,209 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:36,210 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:36,210 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:36,211 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:36,211 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:36,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2018-04-13 06:50:36,212 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:36,231 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-13 06:50:36,231 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:112, output treesize:115 [2018-04-13 06:50:36,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 57 [2018-04-13 06:50:36,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:50:36,299 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:36,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:50:36,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 88 [2018-04-13 06:50:36,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 7 [2018-04-13 06:50:36,332 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:36,340 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:50:36,357 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-13 06:50:36,357 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:137, output treesize:129 [2018-04-13 06:50:36,403 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 43 treesize of output 62 [2018-04-13 06:50:36,405 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:50:36,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 22 [2018-04-13 06:50:36,405 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:36,413 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:50:36,439 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:36,440 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 91 treesize of output 102 [2018-04-13 06:50:36,442 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:36,442 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 23 treesize of output 31 [2018-04-13 06:50:36,442 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:36,453 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:50:36,472 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-13 06:50:36,473 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:148, output treesize:202 [2018-04-13 06:50:36,672 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:36,673 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:36,673 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:36,674 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:36,674 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:36,675 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 45 treesize of output 123 [2018-04-13 06:50:36,675 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:36,699 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-13 06:50:36,699 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:215, output treesize:195 [2018-04-13 06:50:36,775 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:36,777 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:36,777 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 31 treesize of output 66 [2018-04-13 06:50:36,777 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:36,809 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:36,810 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:36,810 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:36,811 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:36,812 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:36,813 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:36,814 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:36,815 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:36,822 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 207 [2018-04-13 06:50:36,822 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-04-13 06:50:36,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-13 06:50:36,904 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:219, output treesize:447 [2018-04-13 06:50:37,107 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:37,109 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:37,113 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 234 treesize of output 212 [2018-04-13 06:50:37,121 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:37,138 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 69 treesize of output 105 [2018-04-13 06:50:37,140 INFO L267 ElimStorePlain]: Start of recursive call 3: 12 dim-0 vars, End of recursive call: 12 dim-0 vars, and 17 xjuncts. [2018-04-13 06:50:37,304 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 9 xjuncts. [2018-04-13 06:50:37,715 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:37,716 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:37,717 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:37,717 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:37,725 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 256 treesize of output 266 [2018-04-13 06:50:37,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:50:37,727 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:37,762 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:50:38,139 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:38,140 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:38,140 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:38,147 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 254 [2018-04-13 06:50:38,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 06:50:38,149 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:38,188 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:50:38,545 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:38,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 198 treesize of output 182 [2018-04-13 06:50:38,552 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:38,553 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:38,559 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 127 treesize of output 128 [2018-04-13 06:50:38,559 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-13 06:50:38,604 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-13 06:50:38,606 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:38,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 205 treesize of output 189 [2018-04-13 06:50:38,612 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:38,613 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:38,613 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:50:38,614 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 127 treesize of output 154 [2018-04-13 06:50:38,615 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:38,645 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:50:38,647 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:38,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 209 treesize of output 193 [2018-04-13 06:50:38,655 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:38,665 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 127 treesize of output 131 [2018-04-13 06:50:38,667 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-04-13 06:50:38,741 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-04-13 06:50:38,743 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:38,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 209 treesize of output 193 [2018-04-13 06:50:38,750 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:38,761 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 127 treesize of output 131 [2018-04-13 06:50:38,762 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-04-13 06:50:38,829 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-04-13 06:50:38,831 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:38,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 210 treesize of output 194 [2018-04-13 06:50:38,838 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:38,849 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 127 treesize of output 131 [2018-04-13 06:50:38,850 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-04-13 06:50:38,919 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-04-13 06:50:38,921 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:38,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 209 treesize of output 193 [2018-04-13 06:50:38,928 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:38,929 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:50:38,930 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 127 treesize of output 150 [2018-04-13 06:50:38,930 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:38,967 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:50:38,969 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:38,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 210 treesize of output 194 [2018-04-13 06:50:38,976 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:38,976 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:50:38,978 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 127 treesize of output 150 [2018-04-13 06:50:38,978 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:39,010 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:50:39,012 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:39,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 178 [2018-04-13 06:50:39,019 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:39,020 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 0 case distinctions, treesize of input 123 treesize of output 112 [2018-04-13 06:50:39,021 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-13 06:50:39,047 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:50:39,049 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:39,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 198 treesize of output 182 [2018-04-13 06:50:39,056 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:39,056 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:50:39,058 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 127 treesize of output 150 [2018-04-13 06:50:39,058 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:39,086 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:50:39,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 4 dim-2 vars, End of recursive call: 29 dim-0 vars, and 14 xjuncts. [2018-04-13 06:50:39,637 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 11 variables, input treesize:491, output treesize:2375 [2018-04-13 06:50:40,110 WARN L151 SmtUtils]: Spent 275ms on a formula simplification. DAG size of input: 417 DAG size of output 160 [2018-04-13 06:50:40,472 WARN L151 SmtUtils]: Spent 281ms on a formula simplification. DAG size of input: 167 DAG size of output 167 [2018-04-13 06:50:40,479 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:40,481 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:40,485 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 222 treesize of output 226 [2018-04-13 06:50:40,491 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:50:40,506 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 78 [2018-04-13 06:50:40,507 INFO L267 ElimStorePlain]: Start of recursive call 3: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-04-13 06:50:40,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 06:50:40,961 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:40,961 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:40,962 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:40,964 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:40,971 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 248 treesize of output 296 [2018-04-13 06:50:40,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-13 06:50:40,973 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:41,014 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:50:41,328 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:41,328 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:41,329 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:41,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 240 treesize of output 288 [2018-04-13 06:50:41,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-13 06:50:41,341 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:41,378 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:50:41,691 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:41,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 218 treesize of output 229 [2018-04-13 06:50:41,703 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:41,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 155 treesize of output 161 [2018-04-13 06:50:41,716 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-04-13 06:50:41,816 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-04-13 06:50:42,266 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:42,268 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:42,271 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 222 treesize of output 236 [2018-04-13 06:50:42,277 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:42,298 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 8 case distinctions, treesize of input 81 treesize of output 125 [2018-04-13 06:50:42,301 INFO L267 ElimStorePlain]: Start of recursive call 11: 12 dim-0 vars, End of recursive call: 12 dim-0 vars, and 20 xjuncts. [2018-04-13 06:50:42,457 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 9 xjuncts. [2018-04-13 06:50:42,459 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:42,462 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:42,463 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 183 treesize of output 193 [2018-04-13 06:50:42,466 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:50:42,468 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:42,477 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 73 treesize of output 107 [2018-04-13 06:50:42,478 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-13 06:50:42,516 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:50:42,518 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:42,521 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:42,523 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:42,523 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 184 treesize of output 211 [2018-04-13 06:50:42,528 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:42,529 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:50:42,532 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:42,540 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 90 treesize of output 131 [2018-04-13 06:50:42,541 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-13 06:50:42,609 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-13 06:50:43,613 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:43,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 185 [2018-04-13 06:50:43,620 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:50:43,621 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 127 treesize of output 108 [2018-04-13 06:50:43,621 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:43,644 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:50:43,646 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:43,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 207 treesize of output 199 [2018-04-13 06:50:43,653 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:50:43,654 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 135 treesize of output 116 [2018-04-13 06:50:43,654 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:43,679 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:50:44,399 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:44,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 173 [2018-04-13 06:50:44,407 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:44,408 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 29 [2018-04-13 06:50:44,408 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:44,436 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:50:45,080 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:45,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 172 [2018-04-13 06:50:45,088 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:45,089 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 29 [2018-04-13 06:50:45,089 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:45,118 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:50:45,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 8 dim-2 vars, End of recursive call: 28 dim-0 vars, and 16 xjuncts. [2018-04-13 06:50:45,686 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 15 variables, input treesize:857, output treesize:3177 [2018-04-13 06:50:46,335 WARN L151 SmtUtils]: Spent 469ms on a formula simplification. DAG size of input: 402 DAG size of output 197 [2018-04-13 06:50:46,628 WARN L148 SmtUtils]: Spent 193ms on a formula simplification that was a NOOP. DAG size: 197 [2018-04-13 06:50:46,963 WARN L148 SmtUtils]: Spent 197ms on a formula simplification that was a NOOP. DAG size: 234 [2018-04-13 06:50:46,974 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 06:50:46,974 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:47,172 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:47,173 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:47,173 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:47,174 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:47,175 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:47,175 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:47,176 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:47,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 268 treesize of output 289 [2018-04-13 06:50:47,177 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:47,333 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:47,333 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:47,334 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:47,334 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:47,335 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:47,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 196 treesize of output 196 [2018-04-13 06:50:47,335 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:47,485 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:47,486 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:47,487 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:47,487 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:47,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 137 [2018-04-13 06:50:47,488 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:47,936 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:47,937 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:47,938 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:47,938 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:47,939 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:47,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 246 treesize of output 246 [2018-04-13 06:50:47,939 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:48,234 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:48,234 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:48,235 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:48,235 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:48,236 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:48,236 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 165 [2018-04-13 06:50:48,236 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:48,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 22 dim-0 vars, 10 dim-1 vars, End of recursive call: 14 dim-0 vars, and 5 xjuncts. [2018-04-13 06:50:48,532 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 32 variables, input treesize:2035, output treesize:998 [2018-04-13 06:50:48,780 WARN L148 SmtUtils]: Spent 126ms on a formula simplification that was a NOOP. DAG size: 236 [2018-04-13 06:50:49,021 WARN L148 SmtUtils]: Spent 118ms on a formula simplification that was a NOOP. DAG size: 236 [2018-04-13 06:50:49,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 175 treesize of output 171 [2018-04-13 06:50:49,044 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:49,045 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:50:49,045 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 24 treesize of output 21 [2018-04-13 06:50:49,045 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:49,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 7 treesize of output 1 [2018-04-13 06:50:49,077 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:49,104 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:50:49,105 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-13 06:50:49,105 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:49,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:50:49,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 138 [2018-04-13 06:50:49,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-13 06:50:49,296 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:49,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2018-04-13 06:50:49,315 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:49,333 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:50:49,333 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 54 treesize of output 34 [2018-04-13 06:50:49,333 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:49,349 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:50:49,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 77 [2018-04-13 06:50:49,496 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:50:49,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-13 06:50:49,497 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:49,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-13 06:50:49,511 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:49,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-13 06:50:49,522 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:49,530 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:50:49,665 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:49,666 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:49,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 295 treesize of output 247 [2018-04-13 06:50:49,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2018-04-13 06:50:49,671 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:49,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-13 06:50:49,704 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:49,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, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 53 [2018-04-13 06:50:49,733 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:50:49,763 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:50:49,763 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 86 treesize of output 42 [2018-04-13 06:50:49,764 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:49,798 INFO L267 ElimStorePlain]: Start of recursive call 14: 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:50:49,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 116 [2018-04-13 06:50:49,933 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:50:49,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-04-13 06:50:49,934 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:49,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-13 06:50:49,957 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:49,978 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:49,978 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 24 treesize of output 8 [2018-04-13 06:50:49,978 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:49,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-04-13 06:50:49,996 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:50,009 INFO L267 ElimStorePlain]: Start of recursive call 19: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:50:50,124 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:50,124 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:50,126 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 256 treesize of output 216 [2018-04-13 06:50:50,128 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:50:50,133 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 84 [2018-04-13 06:50:50,134 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-13 06:50:50,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-13 06:50:50,168 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:50,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 75 [2018-04-13 06:50:50,192 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:50:50,213 INFO L267 ElimStorePlain]: Start of recursive call 24: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:50:50,320 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:50,321 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:50,323 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 206 treesize of output 168 [2018-04-13 06:50:50,325 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:50:50,329 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 76 [2018-04-13 06:50:50,330 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-13 06:50:50,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-13 06:50:50,358 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:50,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, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 65 [2018-04-13 06:50:50,377 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-13 06:50:50,393 INFO L267 ElimStorePlain]: Start of recursive call 28: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-13 06:50:50,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 106 [2018-04-13 06:50:50,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 7 treesize of output 1 [2018-04-13 06:50:50,497 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:50,517 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:50,518 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:50,518 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:50,519 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:50:50,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 57 [2018-04-13 06:50:50,519 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:50,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 7 [2018-04-13 06:50:50,539 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:50,550 INFO L267 ElimStorePlain]: Start of recursive call 32: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:50:50,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 86 [2018-04-13 06:50:50,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-13 06:50:50,641 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:50,655 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:50:50,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-13 06:50:50,655 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:50,668 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:50,668 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:50:50,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-04-13 06:50:50,668 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:50,678 INFO L267 ElimStorePlain]: Start of recursive call 36: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:50:50,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 111 [2018-04-13 06:50:50,763 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:50,763 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 06:50:50,763 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 24 treesize of output 22 [2018-04-13 06:50:50,764 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:50,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-13 06:50:50,781 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:50,798 INFO L682 Elim1Store]: detected equality via solver [2018-04-13 06:50:50,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2018-04-13 06:50:50,798 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-04-13 06:50:50,810 INFO L267 ElimStorePlain]: Start of recursive call 40: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 06:50:50,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 19 dim-0 vars, 10 dim-2 vars, End of recursive call: 6 dim-0 vars, and 5 xjuncts. [2018-04-13 06:50:50,875 INFO L202 ElimStorePlain]: Needed 43 recursive calls to eliminate 29 variables, input treesize:1088, output treesize:176 [2018-04-13 06:50:51,064 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 06:50:51,065 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 06:50:51,065 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-04-13 06:50:51,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-13 06:50:51,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-13 06:50:51,065 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=992, Unknown=0, NotChecked=0, Total=1122 [2018-04-13 06:50:51,065 INFO L87 Difference]: Start difference. First operand 1136 states and 1389 transitions. Second operand 34 states. [2018-04-13 06:50:53,127 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 104 DAG size of output 100 [2018-04-13 06:50:53,444 WARN L151 SmtUtils]: Spent 179ms on a formula simplification. DAG size of input: 143 DAG size of output 139 [2018-04-13 06:50:55,057 WARN L151 SmtUtils]: Spent 245ms on a formula simplification. DAG size of input: 161 DAG size of output 155 [2018-04-13 06:50:56,160 WARN L151 SmtUtils]: Spent 765ms on a formula simplification. DAG size of input: 310 DAG size of output 259 [2018-04-13 06:50:58,782 WARN L151 SmtUtils]: Spent 2426ms on a formula simplification. DAG size of input: 525 DAG size of output 345 [2018-04-13 06:50:59,690 WARN L148 SmtUtils]: Spent 467ms on a formula simplification that was a NOOP. DAG size: 368 [2018-04-13 06:51:00,025 WARN L148 SmtUtils]: Spent 126ms on a formula simplification that was a NOOP. DAG size: 240 [2018-04-13 06:51:00,451 WARN L151 SmtUtils]: Spent 309ms on a formula simplification. DAG size of input: 257 DAG size of output 248 [2018-04-13 06:51:00,861 WARN L151 SmtUtils]: Spent 286ms on a formula simplification. DAG size of input: 254 DAG size of output 245 Received shutdown request... [2018-04-13 06:51:02,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-13 06:51:02,380 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-13 06:51:02,384 WARN L197 ceAbstractionStarter]: Timeout [2018-04-13 06:51:02,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 06:51:02 BoogieIcfgContainer [2018-04-13 06:51:02,384 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-13 06:51:02,385 INFO L168 Benchmark]: Toolchain (without parser) took 836306.48 ms. Allocated memory was 395.3 MB in the beginning and 492.8 MB in the end (delta: 97.5 MB). Free memory was 332.1 MB in the beginning and 372.3 MB in the end (delta: -40.1 MB). Peak memory consumption was 57.4 MB. Max. memory is 5.3 GB. [2018-04-13 06:51:02,386 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 395.3 MB. Free memory is still 358.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-13 06:51:02,386 INFO L168 Benchmark]: CACSL2BoogieTranslator took 239.32 ms. Allocated memory is still 395.3 MB. Free memory was 332.1 MB in the beginning and 306.9 MB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 5.3 GB. [2018-04-13 06:51:02,386 INFO L168 Benchmark]: Boogie Preprocessor took 40.75 ms. Allocated memory is still 395.3 MB. Free memory was 306.9 MB in the beginning and 304.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-13 06:51:02,386 INFO L168 Benchmark]: RCFGBuilder took 549.11 ms. Allocated memory was 395.3 MB in the beginning and 594.0 MB in the end (delta: 198.7 MB). Free memory was 304.2 MB in the beginning and 510.1 MB in the end (delta: -205.9 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. [2018-04-13 06:51:02,387 INFO L168 Benchmark]: TraceAbstraction took 835474.75 ms. Allocated memory was 594.0 MB in the beginning and 492.8 MB in the end (delta: -101.2 MB). Free memory was 508.3 MB in the beginning and 372.3 MB in the end (delta: 136.0 MB). Peak memory consumption was 34.8 MB. Max. memory is 5.3 GB. [2018-04-13 06:51:02,388 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.14 ms. Allocated memory is still 395.3 MB. Free memory is still 358.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 239.32 ms. Allocated memory is still 395.3 MB. Free memory was 332.1 MB in the beginning and 306.9 MB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 40.75 ms. Allocated memory is still 395.3 MB. Free memory was 306.9 MB in the beginning and 304.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 549.11 ms. Allocated memory was 395.3 MB in the beginning and 594.0 MB in the end (delta: 198.7 MB). Free memory was 304.2 MB in the beginning and 510.1 MB in the end (delta: -205.9 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 835474.75 ms. Allocated memory was 594.0 MB in the beginning and 492.8 MB in the end (delta: -101.2 MB). Free memory was 508.3 MB in the beginning and 372.3 MB in the end (delta: 136.0 MB). Peak memory consumption was 34.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 663]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 646]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 666]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 654]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 630]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 647]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 660]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 647]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 631]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 669]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 641]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 662]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 662). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 672]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 672). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 634]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 666]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 658]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 647]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 668]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 668). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 645]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 658]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 634]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 659]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 659). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 663]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 653]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 634]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 653]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 669]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 669]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 647]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 657]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 668]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 668). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 672]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 672). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 620]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 620). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 662]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 662). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 654]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 654). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 645]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 645). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 631]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 631). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 663]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 646]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 646). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 630]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 630). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 669]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 636]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 659]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 659). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 663]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 634]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 634). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 643]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 643). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 636]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 636). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 660]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 641]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 657]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 657). Cancelled while BasicCegarLoop was constructing difference of abstraction (1136states) and interpolant automaton (currently 40 states, 34 states before enhancement), while ReachableStatesComputation was computing reachable states (808 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 151 locations, 65 error locations. TIMEOUT Result, 835.4s OverallTime, 57 OverallIterations, 4 TraceHistogramMax, 400.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6513 SDtfs, 19622 SDslu, 32020 SDs, 0 SdLazy, 33913 SolverSat, 2212 SolverUnsat, 130 SolverUnknown, 0 SolverNotchecked, 104.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2506 GetRequests, 1209 SyntacticMatches, 21 SemanticMatches, 1276 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 12508 ImplicationChecksByTransitivity, 388.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2609occurred in iteration=50, 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, 56 MinimizatonAttempts, 8108 StatesRemovedByMinimization, 54 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 432.5s InterpolantComputationTime, 4105 NumberOfCodeBlocks, 4105 NumberOfCodeBlocksAsserted, 90 NumberOfCheckSat, 2374 ConstructedInterpolants, 640 QuantifiedInterpolants, 9736647 SizeOfPredicates, 570 NumberOfNonLiveVariables, 7058 ConjunctsInSsa, 1420 ConjunctsInUnsatCore, 58 InterpolantComputations, 36 PerfectInterpolantSequences, 227/478 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_stack_true-valid-memsafety_false-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-13_06-51-02-393.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/tree_stack_true-valid-memsafety_false-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-13_06-51-02-393.csv Completed graceful shutdown