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 -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/memsafety/test-0504_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-453dfda-m [2018-04-09 21:04:42,083 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-09 21:04:42,085 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-09 21:04:42,101 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-09 21:04:42,102 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-09 21:04:42,103 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-09 21:04:42,104 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-09 21:04:42,106 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-09 21:04:42,108 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-09 21:04:42,109 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-09 21:04:42,110 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-09 21:04:42,110 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-09 21:04:42,111 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-09 21:04:42,113 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-09 21:04:42,113 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-09 21:04:42,116 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-09 21:04:42,118 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-09 21:04:42,120 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-09 21:04:42,121 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-09 21:04:42,123 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-09 21:04:42,125 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-09 21:04:42,125 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-09 21:04:42,125 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-09 21:04:42,126 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-09 21:04:42,127 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-09 21:04:42,129 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-09 21:04:42,129 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-09 21:04:42,130 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-09 21:04:42,130 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-09 21:04:42,131 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-09 21:04:42,131 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-09 21:04:42,132 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf [2018-04-09 21:04:42,155 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-09 21:04:42,155 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-09 21:04:42,155 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-09 21:04:42,155 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-09 21:04:42,156 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-09 21:04:42,156 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-09 21:04:42,156 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-09 21:04:42,156 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-09 21:04:42,156 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-04-09 21:04:42,156 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-09 21:04:42,157 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-09 21:04:42,157 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-09 21:04:42,157 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-09 21:04:42,157 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-09 21:04:42,157 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-09 21:04:42,157 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-09 21:04:42,158 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-09 21:04:42,158 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-09 21:04:42,158 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-09 21:04:42,158 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-09 21:04:42,158 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-09 21:04:42,158 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-09 21:04:42,159 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-09 21:04:42,159 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-09 21:04:42,159 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-09 21:04:42,159 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-09 21:04:42,159 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-09 21:04:42,160 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-09 21:04:42,160 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-09 21:04:42,160 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-09 21:04:42,160 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-09 21:04:42,160 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-09 21:04:42,160 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:04:42,160 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-09 21:04:42,161 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-09 21:04:42,161 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-09 21:04:42,162 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-09 21:04:42,162 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-09 21:04:42,198 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-09 21:04:42,211 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-09 21:04:42,215 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-09 21:04:42,217 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-09 21:04:42,218 INFO L276 PluginConnector]: CDTParser initialized [2018-04-09 21:04:42,218 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,548 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG6ceecf2dd [2018-04-09 21:04:42,736 INFO L287 CDTParser]: IsIndexed: true [2018-04-09 21:04:42,737 INFO L288 CDTParser]: Found 1 translation units. [2018-04-09 21:04:42,737 INFO L168 CDTParser]: Scanning test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,748 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-09 21:04:42,748 INFO L215 ultiparseSymbolTable]: [2018-04-09 21:04:42,748 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-09 21:04:42,749 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,749 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-09 21:04:42,749 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____rlim64_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,749 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__uid_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,749 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____suseconds_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,749 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__time_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,749 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_rwlock_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,749 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____dev_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,750 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____fsblkcnt_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,750 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__mode_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,750 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__int16_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,750 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__lldiv_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,750 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____u_short in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,750 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____rlim_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,750 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__fd_set in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,750 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____caddr_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,751 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_mutex_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,751 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__size_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,751 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_key_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,751 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__sigset_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,751 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__blkcnt_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,751 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__caddr_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,751 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__blksize_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,751 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____mode_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,751 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____u_long in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,751 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____intptr_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,751 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__div_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,751 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____int16_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,751 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____uint32_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,752 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____blkcnt64_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,752 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__off_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,752 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_rwlockattr_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,752 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____nlink_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,752 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_char in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,752 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____quad_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,752 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__timer_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,752 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____pthread_list_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,752 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____ssize_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,752 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____socklen_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,752 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_barrier_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,752 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____u_quad_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,752 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__int32_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,753 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____uint64_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,753 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__fsfilcnt_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,753 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____off_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,753 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_mutexattr_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,753 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____pid_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,753 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____fsblkcnt64_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,753 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____u_char in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,753 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____off64_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,753 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__key_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,753 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____sig_atomic_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,753 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_int32_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,753 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____fd_mask in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,754 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____id_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,754 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_int in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,754 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____int32_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,754 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,754 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____gid_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,754 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____timer_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,754 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__fsblkcnt_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,754 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____u_int in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,754 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__dev_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,754 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_int8_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,754 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____key_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,755 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____uint8_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,755 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__loff_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,755 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__uint in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,755 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____clockid_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,755 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__clockid_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,755 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__nlink_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,755 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____int64_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,755 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_attr_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,755 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__wchar_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,756 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____useconds_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,756 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__fd_mask in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,756 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_once_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,756 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____uid_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,756 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__ssize_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,756 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____ino_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,756 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____sigset_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,756 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____ino64_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,756 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__quad_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,756 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_int16_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,757 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_spinlock_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,757 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_cond_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,757 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____blkcnt_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,757 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__id_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,757 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__gid_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,757 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__ldiv_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,757 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_int64_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,757 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__daddr_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,757 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____int8_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,758 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_short in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,758 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_barrierattr_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,758 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____fsid_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,758 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__register_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,758 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__ulong in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,758 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____fsfilcnt64_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,758 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_long in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,758 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__ino_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,758 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__clock_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,758 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____swblk_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,758 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pid_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,758 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____WAIT_STATUS in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,759 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__u_quad_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,759 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__ushort in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,759 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____fsfilcnt_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,759 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__suseconds_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,759 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____loff_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,759 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____time_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,759 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__int8_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,759 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____qaddr_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,760 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____uint16_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,760 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____blksize_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,760 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__fsid_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,760 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____clock_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,760 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i____daddr_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,760 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__int64_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,760 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest______true_valid_memsafety_i__pthread_condattr_t in test-0504_true-valid-memsafety.i [2018-04-09 21:04:42,815 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG6ceecf2dd [2018-04-09 21:04:42,820 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-09 21:04:42,822 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-09 21:04:42,823 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-09 21:04:42,823 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-09 21:04:42,829 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-09 21:04:42,829 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.04 09:04:42" (1/1) ... [2018-04-09 21:04:42,831 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9bd3f25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:04:42, skipping insertion in model container [2018-04-09 21:04:42,832 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.04 09:04:42" (1/1) ... [2018-04-09 21:04:42,846 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-09 21:04:42,877 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-09 21:04:43,047 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-09 21:04:43,097 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-09 21:04:43,105 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 113 non ball SCCs. Number of states in SCCs 113. [2018-04-09 21:04:43,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:04:43 WrapperNode [2018-04-09 21:04:43,157 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-09 21:04:43,158 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-09 21:04:43,159 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-09 21:04:43,159 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-09 21:04:43,175 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:04:43" (1/1) ... [2018-04-09 21:04:43,176 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:04:43" (1/1) ... [2018-04-09 21:04:43,194 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:04:43" (1/1) ... [2018-04-09 21:04:43,195 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:04:43" (1/1) ... [2018-04-09 21:04:43,211 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:04:43" (1/1) ... [2018-04-09 21:04:43,217 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:04:43" (1/1) ... [2018-04-09 21:04:43,221 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:04:43" (1/1) ... [2018-04-09 21:04:43,226 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-09 21:04:43,226 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-09 21:04:43,227 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-09 21:04:43,227 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-09 21:04:43,228 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:04:43" (1/1) ... No working directory specified, using /storage/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-09 21:04:43,357 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-09 21:04:43,357 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-09 21:04:43,357 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-09 21:04:43,357 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-09 21:04:43,357 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-09 21:04:43,357 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-09 21:04:43,357 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-09 21:04:43,358 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-09 21:04:43,358 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-09 21:04:43,358 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-09 21:04:43,358 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-09 21:04:43,358 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-09 21:04:43,358 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-09 21:04:43,358 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-09 21:04:43,359 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-09 21:04:43,359 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-09 21:04:43,359 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-09 21:04:43,359 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-09 21:04:43,359 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-09 21:04:43,359 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-09 21:04:43,359 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-09 21:04:43,360 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-09 21:04:43,360 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-09 21:04:43,360 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-09 21:04:43,360 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-09 21:04:43,360 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-09 21:04:43,360 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-09 21:04:43,361 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-09 21:04:43,361 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-09 21:04:43,361 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-09 21:04:43,361 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-09 21:04:43,361 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-09 21:04:43,361 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-09 21:04:43,361 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-09 21:04:43,361 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-09 21:04:43,362 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-09 21:04:43,362 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-09 21:04:43,362 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-09 21:04:43,362 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-09 21:04:43,362 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-09 21:04:43,362 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-09 21:04:43,362 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-09 21:04:43,362 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-09 21:04:43,363 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-09 21:04:43,363 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-09 21:04:43,363 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-09 21:04:43,363 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-09 21:04:43,363 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-09 21:04:43,363 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-09 21:04:43,363 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-09 21:04:43,364 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-09 21:04:43,364 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-09 21:04:43,364 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-09 21:04:43,364 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-09 21:04:43,364 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-09 21:04:43,364 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-09 21:04:43,364 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-09 21:04:43,364 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-09 21:04:43,365 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-09 21:04:43,365 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-09 21:04:43,365 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-09 21:04:43,365 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-09 21:04:43,365 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-09 21:04:43,365 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-09 21:04:43,365 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-09 21:04:43,365 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-09 21:04:43,366 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-09 21:04:43,366 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-09 21:04:43,366 INFO L128 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-04-09 21:04:43,366 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-09 21:04:43,366 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-09 21:04:43,366 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-09 21:04:43,366 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-09 21:04:43,367 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-09 21:04:43,367 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-09 21:04:43,367 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-09 21:04:43,367 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-09 21:04:43,367 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-09 21:04:43,367 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-09 21:04:43,367 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-09 21:04:43,367 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-09 21:04:43,368 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-09 21:04:43,368 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-09 21:04:43,368 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-09 21:04:43,368 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-09 21:04:43,368 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-09 21:04:43,368 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-09 21:04:43,368 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-09 21:04:43,368 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-09 21:04:43,369 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-09 21:04:43,369 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-09 21:04:43,369 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-09 21:04:43,369 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-09 21:04:43,369 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-09 21:04:43,369 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-09 21:04:43,369 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-09 21:04:43,369 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-09 21:04:43,370 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-09 21:04:43,370 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-09 21:04:43,370 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-09 21:04:43,370 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-09 21:04:43,370 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-09 21:04:43,370 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-09 21:04:43,370 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-09 21:04:43,370 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-09 21:04:43,371 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-09 21:04:43,371 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-09 21:04:43,371 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-09 21:04:43,371 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-09 21:04:43,371 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-09 21:04:43,371 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-09 21:04:43,371 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-09 21:04:43,371 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-09 21:04:43,372 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-09 21:04:43,372 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-09 21:04:43,372 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-09 21:04:43,848 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-09 21:04:43,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.04 09:04:43 BoogieIcfgContainer [2018-04-09 21:04:43,849 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-09 21:04:43,849 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-09 21:04:43,850 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-09 21:04:43,852 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-09 21:04:43,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.04 09:04:42" (1/3) ... [2018-04-09 21:04:43,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52e7dea3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.04 09:04:43, skipping insertion in model container [2018-04-09 21:04:43,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.04 09:04:43" (2/3) ... [2018-04-09 21:04:43,854 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52e7dea3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.04 09:04:43, skipping insertion in model container [2018-04-09 21:04:43,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.04 09:04:43" (3/3) ... [2018-04-09 21:04:43,855 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0504_true-valid-memsafety.i [2018-04-09 21:04:43,864 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-09 21:04:43,874 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 39 error locations. [2018-04-09 21:04:43,927 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-09 21:04:43,928 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-09 21:04:43,928 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-09 21:04:43,928 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-09 21:04:43,928 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-09 21:04:43,928 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-09 21:04:43,928 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-09 21:04:43,928 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-09 21:04:43,929 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-09 21:04:43,929 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-09 21:04:43,943 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2018-04-09 21:04:43,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-04-09 21:04:43,947 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:04:43,948 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:04:43,948 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:04:43,951 INFO L82 PathProgramCache]: Analyzing trace with hash -771866318, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:04:43,965 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:04:43,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:04:43,998 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:04:44,012 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-09 21:04:44,012 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:04:44,025 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-09 21:04:44,048 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:04:44,048 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2018-04-09 21:04:44,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-04-09 21:04:44,060 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-04-09 21:04:44,061 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-04-09 21:04:44,062 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 2 states. [2018-04-09 21:04:44,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:04:44,086 INFO L93 Difference]: Finished difference Result 218 states and 238 transitions. [2018-04-09 21:04:44,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-04-09 21:04:44,087 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-04-09 21:04:44,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:04:44,099 INFO L225 Difference]: With dead ends: 218 [2018-04-09 21:04:44,100 INFO L226 Difference]: Without dead ends: 108 [2018-04-09 21:04:44,104 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-04-09 21:04:44,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-04-09 21:04:44,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-04-09 21:04:44,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-04-09 21:04:44,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 112 transitions. [2018-04-09 21:04:44,147 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 112 transitions. Word has length 12 [2018-04-09 21:04:44,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:04:44,148 INFO L459 AbstractCegarLoop]: Abstraction has 108 states and 112 transitions. [2018-04-09 21:04:44,148 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-04-09 21:04:44,148 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2018-04-09 21:04:44,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-09 21:04:44,149 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:04:44,149 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:04:44,149 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:04:44,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1515747229, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:04:44,157 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:04:44,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:04:44,175 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:04:44,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 21:04:44,213 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:44,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:44,218 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-09 21:04:44,235 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-09 21:04:44,235 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:04:44,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:04:44,277 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:04:44,278 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 21:04:44,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-09 21:04:44,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-09 21:04:44,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-09 21:04:44,280 INFO L87 Difference]: Start difference. First operand 108 states and 112 transitions. Second operand 4 states. [2018-04-09 21:04:44,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:04:44,460 INFO L93 Difference]: Finished difference Result 149 states and 155 transitions. [2018-04-09 21:04:44,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-09 21:04:44,461 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-04-09 21:04:44,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:04:44,463 INFO L225 Difference]: With dead ends: 149 [2018-04-09 21:04:44,463 INFO L226 Difference]: Without dead ends: 141 [2018-04-09 21:04:44,464 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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-09 21:04:44,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-04-09 21:04:44,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 100. [2018-04-09 21:04:44,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-04-09 21:04:44,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 104 transitions. [2018-04-09 21:04:44,474 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 104 transitions. Word has length 16 [2018-04-09 21:04:44,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:04:44,475 INFO L459 AbstractCegarLoop]: Abstraction has 100 states and 104 transitions. [2018-04-09 21:04:44,475 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-09 21:04:44,475 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 104 transitions. [2018-04-09 21:04:44,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-09 21:04:44,475 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:04:44,476 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:04:44,476 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:04:44,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1515747228, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:04:44,488 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:04:44,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:04:44,503 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:04:44,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 21:04:44,517 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:44,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:44,535 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-09 21:04:44,614 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-09 21:04:44,614 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:04:44,671 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-09 21:04:44,704 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:04:44,704 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-09 21:04:44,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-09 21:04:44,704 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-09 21:04:44,705 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-09 21:04:44,705 INFO L87 Difference]: Start difference. First operand 100 states and 104 transitions. Second operand 6 states. [2018-04-09 21:04:44,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:04:44,882 INFO L93 Difference]: Finished difference Result 156 states and 164 transitions. [2018-04-09 21:04:44,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-09 21:04:44,882 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-04-09 21:04:44,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:04:44,884 INFO L225 Difference]: With dead ends: 156 [2018-04-09 21:04:44,884 INFO L226 Difference]: Without dead ends: 150 [2018-04-09 21:04:44,884 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-09 21:04:44,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-04-09 21:04:44,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 102. [2018-04-09 21:04:44,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-04-09 21:04:44,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 110 transitions. [2018-04-09 21:04:44,896 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 110 transitions. Word has length 16 [2018-04-09 21:04:44,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:04:44,896 INFO L459 AbstractCegarLoop]: Abstraction has 102 states and 110 transitions. [2018-04-09 21:04:44,896 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-09 21:04:44,897 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 110 transitions. [2018-04-09 21:04:44,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-09 21:04:44,897 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:04:44,897 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:04:44,898 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:04:44,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1601507291, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:04:44,908 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:04:44,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:04:44,920 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:04:44,936 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-09 21:04:44,936 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:04:44,949 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-09 21:04:44,985 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:04:44,985 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2018-04-09 21:04:44,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-09 21:04:44,986 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-09 21:04:44,986 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-09 21:04:44,987 INFO L87 Difference]: Start difference. First operand 102 states and 110 transitions. Second operand 3 states. [2018-04-09 21:04:45,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:04:45,063 INFO L93 Difference]: Finished difference Result 142 states and 152 transitions. [2018-04-09 21:04:45,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-09 21:04:45,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-04-09 21:04:45,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:04:45,064 INFO L225 Difference]: With dead ends: 142 [2018-04-09 21:04:45,064 INFO L226 Difference]: Without dead ends: 139 [2018-04-09 21:04:45,065 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 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-09 21:04:45,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-04-09 21:04:45,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 108. [2018-04-09 21:04:45,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-04-09 21:04:45,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2018-04-09 21:04:45,075 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 16 [2018-04-09 21:04:45,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:04:45,075 INFO L459 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2018-04-09 21:04:45,075 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-09 21:04:45,075 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2018-04-09 21:04:45,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-09 21:04:45,076 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:04:45,076 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:04:45,076 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:04:45,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1601506745, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:04:45,083 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:04:45,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:04:45,094 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:04:45,103 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-09 21:04:45,104 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:04:45,124 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-09 21:04:45,159 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:04:45,160 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 21:04:45,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-09 21:04:45,160 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-09 21:04:45,161 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-09 21:04:45,161 INFO L87 Difference]: Start difference. First operand 108 states and 117 transitions. Second operand 3 states. [2018-04-09 21:04:45,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:04:45,199 INFO L93 Difference]: Finished difference Result 248 states and 269 transitions. [2018-04-09 21:04:45,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-09 21:04:45,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-04-09 21:04:45,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:04:45,203 INFO L225 Difference]: With dead ends: 248 [2018-04-09 21:04:45,203 INFO L226 Difference]: Without dead ends: 151 [2018-04-09 21:04:45,204 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 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-09 21:04:45,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-04-09 21:04:45,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 134. [2018-04-09 21:04:45,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-04-09 21:04:45,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 155 transitions. [2018-04-09 21:04:45,218 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 155 transitions. Word has length 16 [2018-04-09 21:04:45,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:04:45,218 INFO L459 AbstractCegarLoop]: Abstraction has 134 states and 155 transitions. [2018-04-09 21:04:45,218 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-09 21:04:45,218 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 155 transitions. [2018-04-09 21:04:45,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-09 21:04:45,219 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:04:45,219 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-09 21:04:45,220 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:04:45,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1401320086, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:04:45,229 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:04:45,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:04:45,253 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:04:45,317 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:04:45,322 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:04:45,323 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-09 21:04:45,324 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:45,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 14 treesize of output 17 [2018-04-09 21:04:45,334 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:45,342 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-09 21:04:45,343 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-04-09 21:04:45,392 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-09 21:04:45,392 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:04:45,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-09 21:04:45,484 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:45,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:45,487 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:6 [2018-04-09 21:04:45,505 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-09 21:04:45,529 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:04:45,529 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2018-04-09 21:04:45,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-09 21:04:45,530 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-09 21:04:45,530 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-04-09 21:04:45,530 INFO L87 Difference]: Start difference. First operand 134 states and 155 transitions. Second operand 8 states. [2018-04-09 21:04:45,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:04:45,830 INFO L93 Difference]: Finished difference Result 256 states and 280 transitions. [2018-04-09 21:04:45,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-09 21:04:45,831 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-04-09 21:04:45,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:04:45,832 INFO L225 Difference]: With dead ends: 256 [2018-04-09 21:04:45,832 INFO L226 Difference]: Without dead ends: 254 [2018-04-09 21:04:45,832 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-04-09 21:04:45,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-04-09 21:04:45,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 132. [2018-04-09 21:04:45,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-04-09 21:04:45,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 151 transitions. [2018-04-09 21:04:45,842 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 151 transitions. Word has length 29 [2018-04-09 21:04:45,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:04:45,842 INFO L459 AbstractCegarLoop]: Abstraction has 132 states and 151 transitions. [2018-04-09 21:04:45,842 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-09 21:04:45,842 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 151 transitions. [2018-04-09 21:04:45,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-09 21:04:45,843 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:04:45,843 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:04:45,844 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:04:45,844 INFO L82 PathProgramCache]: Analyzing trace with hash -491249699, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:04:45,857 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:04:45,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:04:45,876 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:04:45,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-09 21:04:45,893 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:45,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:45,907 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-09 21:04:45,921 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-09 21:04:45,921 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:04:45,925 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-09 21:04:45,945 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:04:45,945 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 21:04:45,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-09 21:04:45,946 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-09 21:04:45,946 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-09 21:04:45,946 INFO L87 Difference]: Start difference. First operand 132 states and 151 transitions. Second operand 4 states. [2018-04-09 21:04:46,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:04:46,027 INFO L93 Difference]: Finished difference Result 201 states and 225 transitions. [2018-04-09 21:04:46,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-09 21:04:46,028 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-04-09 21:04:46,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:04:46,029 INFO L225 Difference]: With dead ends: 201 [2018-04-09 21:04:46,029 INFO L226 Difference]: Without dead ends: 197 [2018-04-09 21:04:46,029 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 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-09 21:04:46,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-04-09 21:04:46,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 128. [2018-04-09 21:04:46,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-04-09 21:04:46,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 143 transitions. [2018-04-09 21:04:46,036 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 143 transitions. Word has length 30 [2018-04-09 21:04:46,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:04:46,037 INFO L459 AbstractCegarLoop]: Abstraction has 128 states and 143 transitions. [2018-04-09 21:04:46,037 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-09 21:04:46,037 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 143 transitions. [2018-04-09 21:04:46,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-09 21:04:46,038 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:04:46,038 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:04:46,038 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:04:46,039 INFO L82 PathProgramCache]: Analyzing trace with hash -491249698, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:04:46,048 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:04:46,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:04:46,068 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:04:46,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 6 treesize of output 5 [2018-04-09 21:04:46,073 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:46,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:46,076 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-09 21:04:46,086 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-09 21:04:46,086 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:04:46,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:04:46,132 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:04:46,133 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-09 21:04:46,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-09 21:04:46,133 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-09 21:04:46,133 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-09 21:04:46,134 INFO L87 Difference]: Start difference. First operand 128 states and 143 transitions. Second operand 6 states. [2018-04-09 21:04:46,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:04:46,230 INFO L93 Difference]: Finished difference Result 244 states and 264 transitions. [2018-04-09 21:04:46,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-09 21:04:46,230 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-04-09 21:04:46,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:04:46,231 INFO L225 Difference]: With dead ends: 244 [2018-04-09 21:04:46,231 INFO L226 Difference]: Without dead ends: 240 [2018-04-09 21:04:46,232 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-09 21:04:46,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-04-09 21:04:46,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 124. [2018-04-09 21:04:46,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-04-09 21:04:46,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 135 transitions. [2018-04-09 21:04:46,238 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 135 transitions. Word has length 30 [2018-04-09 21:04:46,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:04:46,239 INFO L459 AbstractCegarLoop]: Abstraction has 124 states and 135 transitions. [2018-04-09 21:04:46,239 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-09 21:04:46,239 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 135 transitions. [2018-04-09 21:04:46,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-09 21:04:46,239 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:04:46,240 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-09 21:04:46,240 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:04:46,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1866164689, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:04:46,245 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:04:46,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:04:46,269 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:04:46,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-09 21:04:46,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 21:04:46,281 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:46,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:46,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:46,283 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-04-09 21:04:46,287 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-09 21:04:46,290 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:04:46,290 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-09 21:04:46,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:46,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:46,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:46,297 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2018-04-09 21:04:46,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 40 [2018-04-09 21:04:46,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2018-04-09 21:04:46,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:46,344 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:46,349 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-09 21:04:46,349 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2018-04-09 21:04:46,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2018-04-09 21:04:46,371 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:04:46,372 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 10 [2018-04-09 21:04:46,372 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:46,378 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:46,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:46,380 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:40, output treesize:5 [2018-04-09 21:04:46,388 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-09 21:04:46,388 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:04:46,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 11 [2018-04-09 21:04:46,407 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:46,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:46,409 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2018-04-09 21:04:46,421 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-09 21:04:46,454 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:04:46,454 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 8 [2018-04-09 21:04:46,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-09 21:04:46,454 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-09 21:04:46,455 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-04-09 21:04:46,455 INFO L87 Difference]: Start difference. First operand 124 states and 135 transitions. Second operand 9 states. [2018-04-09 21:04:46,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:04:46,748 INFO L93 Difference]: Finished difference Result 205 states and 219 transitions. [2018-04-09 21:04:46,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-09 21:04:46,749 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-04-09 21:04:46,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:04:46,750 INFO L225 Difference]: With dead ends: 205 [2018-04-09 21:04:46,750 INFO L226 Difference]: Without dead ends: 204 [2018-04-09 21:04:46,750 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-04-09 21:04:46,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-04-09 21:04:46,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 145. [2018-04-09 21:04:46,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-04-09 21:04:46,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 159 transitions. [2018-04-09 21:04:46,758 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 159 transitions. Word has length 33 [2018-04-09 21:04:46,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:04:46,758 INFO L459 AbstractCegarLoop]: Abstraction has 145 states and 159 transitions. [2018-04-09 21:04:46,759 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-09 21:04:46,759 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 159 transitions. [2018-04-09 21:04:46,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-09 21:04:46,759 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:04:46,759 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-09 21:04:46,759 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:04:46,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1866164688, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:04:46,765 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:04:46,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:04:46,791 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:04:46,805 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-09 21:04:46,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 21:04:46,807 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:46,808 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:46,817 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-09 21:04:46,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 21:04:46,820 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:46,822 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:46,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:46,827 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:28, output treesize:20 [2018-04-09 21:04:46,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-09 21:04:46,847 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:04:46,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 16 treesize of output 23 [2018-04-09 21:04:46,849 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:46,853 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:46,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-09 21:04:46,868 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:04:46,868 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-09 21:04:46,868 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:46,872 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:46,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:46,880 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:58, output treesize:50 [2018-04-09 21:04:46,897 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:04:46,899 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 17 [2018-04-09 21:04:46,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:46,913 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:04:46,914 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:04:46,914 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-09 21:04:46,914 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:46,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:46,924 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:54 [2018-04-09 21:04:47,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-04-09 21:04:47,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 21:04:47,005 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:47,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:47,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-04-09 21:04:47,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-09 21:04:47,060 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:47,066 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:47,080 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-09 21:04:47,080 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:84, output treesize:76 [2018-04-09 21:04:47,113 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 29 [2018-04-09 21:04:47,118 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:04:47,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2018-04-09 21:04:47,119 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:47,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-09 21:04:47,130 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:47,133 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:47,154 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 29 [2018-04-09 21:04:47,158 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:04:47,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2018-04-09 21:04:47,160 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:47,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-09 21:04:47,169 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:47,171 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:47,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:04:47,182 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:90, output treesize:22 [2018-04-09 21:04:47,202 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-09 21:04:47,203 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:04:47,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2018-04-09 21:04:47,401 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:47,483 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2018-04-09 21:04:47,483 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:47,489 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 1 case distinctions, treesize of input 56 treesize of output 60 [2018-04-09 21:04:47,491 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-09 21:04:47,512 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 4 xjuncts. [2018-04-09 21:04:47,512 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:85, output treesize:134 [2018-04-09 21:04:47,565 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 39 treesize of output 37 [2018-04-09 21:04:47,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 17 [2018-04-09 21:04:47,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-04-09 21:04:47,576 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:47,578 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:47,584 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:47,612 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 18 treesize of output 16 [2018-04-09 21:04:47,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 20 [2018-04-09 21:04:47,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, 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 6 [2018-04-09 21:04:47,622 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:47,623 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:47,624 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:47,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:47,626 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 13 variables, input treesize:155, output treesize:6 [2018-04-09 21:04:47,647 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-09 21:04:47,669 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:04:47,669 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 8] imperfect sequences [] total 16 [2018-04-09 21:04:47,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-09 21:04:47,669 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-09 21:04:47,670 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2018-04-09 21:04:47,670 INFO L87 Difference]: Start difference. First operand 145 states and 159 transitions. Second operand 17 states. [2018-04-09 21:04:48,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:04:48,283 INFO L93 Difference]: Finished difference Result 264 states and 279 transitions. [2018-04-09 21:04:48,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-09 21:04:48,284 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 33 [2018-04-09 21:04:48,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:04:48,285 INFO L225 Difference]: With dead ends: 264 [2018-04-09 21:04:48,286 INFO L226 Difference]: Without dead ends: 263 [2018-04-09 21:04:48,286 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=149, Invalid=451, Unknown=0, NotChecked=0, Total=600 [2018-04-09 21:04:48,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-04-09 21:04:48,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 145. [2018-04-09 21:04:48,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-04-09 21:04:48,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 157 transitions. [2018-04-09 21:04:48,296 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 157 transitions. Word has length 33 [2018-04-09 21:04:48,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:04:48,296 INFO L459 AbstractCegarLoop]: Abstraction has 145 states and 157 transitions. [2018-04-09 21:04:48,296 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-09 21:04:48,296 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 157 transitions. [2018-04-09 21:04:48,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-09 21:04:48,297 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:04:48,298 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-09 21:04:48,298 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:04:48,298 INFO L82 PathProgramCache]: Analyzing trace with hash -525731421, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:04:48,305 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:04:48,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:04:48,324 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:04:48,367 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-09 21:04:48,367 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:04:48,391 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-09 21:04:48,416 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:04:48,416 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 8 [2018-04-09 21:04:48,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-09 21:04:48,417 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-09 21:04:48,417 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-04-09 21:04:48,417 INFO L87 Difference]: Start difference. First operand 145 states and 157 transitions. Second operand 8 states. [2018-04-09 21:04:48,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:04:48,504 INFO L93 Difference]: Finished difference Result 247 states and 266 transitions. [2018-04-09 21:04:48,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-09 21:04:48,505 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2018-04-09 21:04:48,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:04:48,506 INFO L225 Difference]: With dead ends: 247 [2018-04-09 21:04:48,506 INFO L226 Difference]: Without dead ends: 154 [2018-04-09 21:04:48,507 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-04-09 21:04:48,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-04-09 21:04:48,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 147. [2018-04-09 21:04:48,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-04-09 21:04:48,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 157 transitions. [2018-04-09 21:04:48,514 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 157 transitions. Word has length 36 [2018-04-09 21:04:48,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:04:48,514 INFO L459 AbstractCegarLoop]: Abstraction has 147 states and 157 transitions. [2018-04-09 21:04:48,514 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-09 21:04:48,514 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 157 transitions. [2018-04-09 21:04:48,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-09 21:04:48,515 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:04:48,515 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-09 21:04:48,515 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:04:48,516 INFO L82 PathProgramCache]: Analyzing trace with hash -525730875, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:04:48,525 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:04:48,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:04:48,539 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:04:48,546 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-09 21:04:48,547 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:04:48,559 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-09 21:04:48,580 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:04:48,580 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 21:04:48,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-09 21:04:48,581 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-09 21:04:48,581 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-09 21:04:48,581 INFO L87 Difference]: Start difference. First operand 147 states and 157 transitions. Second operand 4 states. [2018-04-09 21:04:48,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:04:48,671 INFO L93 Difference]: Finished difference Result 178 states and 187 transitions. [2018-04-09 21:04:48,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-09 21:04:48,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-04-09 21:04:48,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:04:48,672 INFO L225 Difference]: With dead ends: 178 [2018-04-09 21:04:48,672 INFO L226 Difference]: Without dead ends: 177 [2018-04-09 21:04:48,672 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 70 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-09 21:04:48,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-04-09 21:04:48,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 149. [2018-04-09 21:04:48,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-04-09 21:04:48,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 160 transitions. [2018-04-09 21:04:48,682 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 160 transitions. Word has length 36 [2018-04-09 21:04:48,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:04:48,682 INFO L459 AbstractCegarLoop]: Abstraction has 149 states and 160 transitions. [2018-04-09 21:04:48,682 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-09 21:04:48,682 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 160 transitions. [2018-04-09 21:04:48,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-09 21:04:48,683 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:04:48,683 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-09 21:04:48,683 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:04:48,683 INFO L82 PathProgramCache]: Analyzing trace with hash -525730874, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:04:48,689 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:04:48,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:04:48,703 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:04:48,748 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-09 21:04:48,748 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:04:48,783 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-09 21:04:48,784 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:48,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:48,785 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:1 [2018-04-09 21:04:48,789 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-09 21:04:48,810 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:04:48,810 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 4] imperfect sequences [] total 10 [2018-04-09 21:04:48,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-09 21:04:48,811 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-09 21:04:48,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-04-09 21:04:48,811 INFO L87 Difference]: Start difference. First operand 149 states and 160 transitions. Second operand 11 states. [2018-04-09 21:04:49,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:04:49,063 INFO L93 Difference]: Finished difference Result 278 states and 295 transitions. [2018-04-09 21:04:49,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-09 21:04:49,064 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2018-04-09 21:04:49,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:04:49,065 INFO L225 Difference]: With dead ends: 278 [2018-04-09 21:04:49,065 INFO L226 Difference]: Without dead ends: 277 [2018-04-09 21:04:49,065 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=174, Invalid=332, Unknown=0, NotChecked=0, Total=506 [2018-04-09 21:04:49,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-04-09 21:04:49,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 179. [2018-04-09 21:04:49,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-04-09 21:04:49,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 194 transitions. [2018-04-09 21:04:49,074 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 194 transitions. Word has length 36 [2018-04-09 21:04:49,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:04:49,074 INFO L459 AbstractCegarLoop]: Abstraction has 179 states and 194 transitions. [2018-04-09 21:04:49,074 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-09 21:04:49,074 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 194 transitions. [2018-04-09 21:04:49,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-09 21:04:49,075 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:04:49,075 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:04:49,075 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:04:49,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1697323769, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:04:49,082 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:04:49,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:04:49,099 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:04:49,113 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-09 21:04:49,113 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:04:49,120 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-09 21:04:49,142 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:04:49,142 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2018-04-09 21:04:49,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-09 21:04:49,142 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-09 21:04:49,142 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-09 21:04:49,143 INFO L87 Difference]: Start difference. First operand 179 states and 194 transitions. Second operand 5 states. [2018-04-09 21:04:49,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:04:49,265 INFO L93 Difference]: Finished difference Result 224 states and 239 transitions. [2018-04-09 21:04:49,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-09 21:04:49,266 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-04-09 21:04:49,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:04:49,267 INFO L225 Difference]: With dead ends: 224 [2018-04-09 21:04:49,267 INFO L226 Difference]: Without dead ends: 222 [2018-04-09 21:04:49,267 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 75 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-09 21:04:49,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-04-09 21:04:49,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 186. [2018-04-09 21:04:49,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-04-09 21:04:49,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 204 transitions. [2018-04-09 21:04:49,277 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 204 transitions. Word has length 39 [2018-04-09 21:04:49,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:04:49,277 INFO L459 AbstractCegarLoop]: Abstraction has 186 states and 204 transitions. [2018-04-09 21:04:49,277 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-09 21:04:49,277 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 204 transitions. [2018-04-09 21:04:49,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-09 21:04:49,277 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:04:49,278 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:04:49,278 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:04:49,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1697323770, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:04:49,290 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:04:49,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:04:49,304 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:04:49,342 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-09 21:04:49,343 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:04:49,383 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-09 21:04:49,384 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:49,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:49,385 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:1 [2018-04-09 21:04:49,390 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-09 21:04:49,425 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:04:49,426 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 5] imperfect sequences [] total 11 [2018-04-09 21:04:49,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-09 21:04:49,426 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-09 21:04:49,426 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2018-04-09 21:04:49,427 INFO L87 Difference]: Start difference. First operand 186 states and 204 transitions. Second operand 12 states. [2018-04-09 21:04:49,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:04:49,968 INFO L93 Difference]: Finished difference Result 318 states and 343 transitions. [2018-04-09 21:04:49,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-09 21:04:49,969 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2018-04-09 21:04:49,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:04:49,970 INFO L225 Difference]: With dead ends: 318 [2018-04-09 21:04:49,970 INFO L226 Difference]: Without dead ends: 316 [2018-04-09 21:04:49,971 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=246, Invalid=566, Unknown=0, NotChecked=0, Total=812 [2018-04-09 21:04:49,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-04-09 21:04:49,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 237. [2018-04-09 21:04:49,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-04-09 21:04:49,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 267 transitions. [2018-04-09 21:04:49,990 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 267 transitions. Word has length 39 [2018-04-09 21:04:49,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:04:49,991 INFO L459 AbstractCegarLoop]: Abstraction has 237 states and 267 transitions. [2018-04-09 21:04:49,991 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-09 21:04:49,991 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 267 transitions. [2018-04-09 21:04:49,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-09 21:04:49,992 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:04:49,992 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:04:49,992 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:04:49,992 INFO L82 PathProgramCache]: Analyzing trace with hash 465418529, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:04:50,001 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:04:50,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:04:50,022 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:04:50,038 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-09 21:04:50,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 21:04:50,040 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:50,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:50,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:50,047 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-04-09 21:04:50,066 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-09 21:04:50,068 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:04:50,069 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-09 21:04:50,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:50,074 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:50,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:50,087 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-04-09 21:04:50,132 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-09 21:04:50,134 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:04:50,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-09 21:04:50,135 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:50,138 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:50,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:50,143 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:5 [2018-04-09 21:04:50,161 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-09 21:04:50,161 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:04:50,218 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-09 21:04:50,252 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:04:50,253 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 7] imperfect sequences [] total 14 [2018-04-09 21:04:50,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-09 21:04:50,253 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-09 21:04:50,253 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-04-09 21:04:50,253 INFO L87 Difference]: Start difference. First operand 237 states and 267 transitions. Second operand 15 states. [2018-04-09 21:04:51,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:04:51,093 INFO L93 Difference]: Finished difference Result 337 states and 372 transitions. [2018-04-09 21:04:51,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-09 21:04:51,093 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2018-04-09 21:04:51,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:04:51,094 INFO L225 Difference]: With dead ends: 337 [2018-04-09 21:04:51,094 INFO L226 Difference]: Without dead ends: 336 [2018-04-09 21:04:51,095 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=223, Invalid=589, Unknown=0, NotChecked=0, Total=812 [2018-04-09 21:04:51,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-04-09 21:04:51,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 254. [2018-04-09 21:04:51,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-04-09 21:04:51,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 287 transitions. [2018-04-09 21:04:51,115 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 287 transitions. Word has length 45 [2018-04-09 21:04:51,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:04:51,115 INFO L459 AbstractCegarLoop]: Abstraction has 254 states and 287 transitions. [2018-04-09 21:04:51,115 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-09 21:04:51,115 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 287 transitions. [2018-04-09 21:04:51,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-09 21:04:51,116 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:04:51,116 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:04:51,116 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:04:51,117 INFO L82 PathProgramCache]: Analyzing trace with hash 465418530, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:04:51,125 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:04:51,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:04:51,149 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:04:51,159 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-09 21:04:51,161 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 21:04:51,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:51,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:51,171 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-09 21:04:51,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 21:04:51,173 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:51,174 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:51,180 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:51,180 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-04-09 21:04:51,192 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-09 21:04:51,195 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:04:51,196 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-09 21:04:51,196 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:51,201 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:51,213 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-09 21:04:51,216 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:04:51,217 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-09 21:04:51,217 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:51,222 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:51,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:51,229 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-04-09 21:04:51,285 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-09 21:04:51,289 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:04:51,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-09 21:04:51,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:51,293 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:51,301 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-09 21:04:51,303 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:04:51,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-09 21:04:51,304 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:51,306 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:51,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:51,311 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:53, output treesize:13 [2018-04-09 21:04:51,349 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-09 21:04:51,349 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:04:51,515 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-09 21:04:51,552 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:04:51,552 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10, 7] imperfect sequences [] total 15 [2018-04-09 21:04:51,552 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-09 21:04:51,552 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-09 21:04:51,553 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-04-09 21:04:51,553 INFO L87 Difference]: Start difference. First operand 254 states and 287 transitions. Second operand 15 states. [2018-04-09 21:04:52,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:04:52,102 INFO L93 Difference]: Finished difference Result 371 states and 416 transitions. [2018-04-09 21:04:52,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-09 21:04:52,102 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 45 [2018-04-09 21:04:52,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:04:52,103 INFO L225 Difference]: With dead ends: 371 [2018-04-09 21:04:52,103 INFO L226 Difference]: Without dead ends: 321 [2018-04-09 21:04:52,104 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=176, Invalid=526, Unknown=0, NotChecked=0, Total=702 [2018-04-09 21:04:52,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-04-09 21:04:52,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 252. [2018-04-09 21:04:52,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-04-09 21:04:52,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 283 transitions. [2018-04-09 21:04:52,122 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 283 transitions. Word has length 45 [2018-04-09 21:04:52,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:04:52,123 INFO L459 AbstractCegarLoop]: Abstraction has 252 states and 283 transitions. [2018-04-09 21:04:52,123 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-09 21:04:52,123 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 283 transitions. [2018-04-09 21:04:52,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-09 21:04:52,123 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:04:52,124 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-09 21:04:52,124 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:04:52,124 INFO L82 PathProgramCache]: Analyzing trace with hash -657946711, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:04:52,133 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:04:52,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:04:52,160 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:04:52,174 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-09 21:04:52,174 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:52,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:52,179 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-09 21:04:52,228 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:04:52,228 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:04:52,311 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:04:52,345 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:04:52,346 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-04-09 21:04:52,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-09 21:04:52,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-09 21:04:52,346 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-09 21:04:52,347 INFO L87 Difference]: Start difference. First operand 252 states and 283 transitions. Second operand 8 states. [2018-04-09 21:04:52,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:04:52,499 INFO L93 Difference]: Finished difference Result 318 states and 352 transitions. [2018-04-09 21:04:52,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-09 21:04:52,500 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2018-04-09 21:04:52,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:04:52,501 INFO L225 Difference]: With dead ends: 318 [2018-04-09 21:04:52,501 INFO L226 Difference]: Without dead ends: 317 [2018-04-09 21:04:52,501 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-04-09 21:04:52,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-04-09 21:04:52,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 251. [2018-04-09 21:04:52,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-04-09 21:04:52,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 279 transitions. [2018-04-09 21:04:52,521 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 279 transitions. Word has length 47 [2018-04-09 21:04:52,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:04:52,521 INFO L459 AbstractCegarLoop]: Abstraction has 251 states and 279 transitions. [2018-04-09 21:04:52,521 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-09 21:04:52,521 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 279 transitions. [2018-04-09 21:04:52,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-09 21:04:52,522 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:04:52,522 INFO L355 BasicCegarLoop]: trace histogram [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] [2018-04-09 21:04:52,522 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:04:52,523 INFO L82 PathProgramCache]: Analyzing trace with hash -657946710, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:04:52,531 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:04:52,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:04:52,554 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:04:52,576 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:04:52,578 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 17 [2018-04-09 21:04:52,578 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:52,591 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:04:52,591 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:04:52,592 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-09 21:04:52,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:52,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:52,597 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-04-09 21:04:52,629 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:04:52,629 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:04:52,824 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:04:52,859 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:04:52,859 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2018-04-09 21:04:52,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-09 21:04:52,860 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-09 21:04:52,860 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-04-09 21:04:52,860 INFO L87 Difference]: Start difference. First operand 251 states and 279 transitions. Second operand 9 states. [2018-04-09 21:04:53,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:04:53,079 INFO L93 Difference]: Finished difference Result 282 states and 311 transitions. [2018-04-09 21:04:53,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-09 21:04:53,079 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2018-04-09 21:04:53,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:04:53,080 INFO L225 Difference]: With dead ends: 282 [2018-04-09 21:04:53,080 INFO L226 Difference]: Without dead ends: 281 [2018-04-09 21:04:53,081 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-04-09 21:04:53,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-04-09 21:04:53,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 250. [2018-04-09 21:04:53,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-04-09 21:04:53,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 275 transitions. [2018-04-09 21:04:53,091 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 275 transitions. Word has length 47 [2018-04-09 21:04:53,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:04:53,092 INFO L459 AbstractCegarLoop]: Abstraction has 250 states and 275 transitions. [2018-04-09 21:04:53,092 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-09 21:04:53,092 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 275 transitions. [2018-04-09 21:04:53,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-09 21:04:53,092 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:04:53,092 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] [2018-04-09 21:04:53,092 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:04:53,093 INFO L82 PathProgramCache]: Analyzing trace with hash 125359813, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:04:53,101 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:04:53,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:04:53,118 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:04:53,157 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~x~1.base Int)) (and (= |c_#valid| (store |c_old(#valid)| main_~x~1.base 0)) (= 0 (select |c_old(#valid)| main_~x~1.base)))) is different from true [2018-04-09 21:04:53,164 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-04-09 21:04:53,164 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:04:53,214 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc1.base_8| Int)) (or (= (store |c_#valid| |v_main_#t~malloc1.base_8| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc1.base_8|))))) is different from false [2018-04-09 21:04:53,237 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2018-04-09 21:04:53,259 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:04:53,259 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-04-09 21:04:53,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-09 21:04:53,260 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-09 21:04:53,260 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=89, Unknown=2, NotChecked=38, Total=156 [2018-04-09 21:04:53,260 INFO L87 Difference]: Start difference. First operand 250 states and 275 transitions. Second operand 13 states. [2018-04-09 21:04:53,276 WARN L1011 $PredicateComparison]: unable to prove that (and (forall ((|v_main_#t~malloc1.base_8| Int)) (or (= (store |c_#valid| |v_main_#t~malloc1.base_8| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc1.base_8|))))) (= |c_#valid| |c_old(#valid)|)) is different from false [2018-04-09 21:04:53,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:04:53,634 INFO L93 Difference]: Finished difference Result 288 states and 314 transitions. [2018-04-09 21:04:53,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-09 21:04:53,634 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 50 [2018-04-09 21:04:53,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:04:53,636 INFO L225 Difference]: With dead ends: 288 [2018-04-09 21:04:53,636 INFO L226 Difference]: Without dead ends: 285 [2018-04-09 21:04:53,636 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=228, Unknown=3, NotChecked=102, Total=420 [2018-04-09 21:04:53,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-04-09 21:04:53,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 255. [2018-04-09 21:04:53,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-04-09 21:04:53,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 280 transitions. [2018-04-09 21:04:53,647 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 280 transitions. Word has length 50 [2018-04-09 21:04:53,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:04:53,648 INFO L459 AbstractCegarLoop]: Abstraction has 255 states and 280 transitions. [2018-04-09 21:04:53,648 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-09 21:04:53,648 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 280 transitions. [2018-04-09 21:04:53,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-09 21:04:53,648 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:04:53,648 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:04:53,649 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:04:53,649 INFO L82 PathProgramCache]: Analyzing trace with hash 125360359, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:04:53,658 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:04:53,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:04:53,680 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:04:53,688 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-09 21:04:53,690 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 21:04:53,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:53,691 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:53,697 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-09 21:04:53,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 21:04:53,699 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:53,701 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:53,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:53,704 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-04-09 21:04:53,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-04-09 21:04:53,717 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:04:53,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-09 21:04:53,718 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:53,723 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:53,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-04-09 21:04:53,734 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:04:53,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-09 21:04:53,735 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:53,739 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:53,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:53,745 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2018-04-09 21:04:53,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-04-09 21:04:53,765 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:04:53,766 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:04:53,767 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:04:53,767 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:04:53,768 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 55 [2018-04-09 21:04:53,768 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:53,784 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:53,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-04-09 21:04:53,801 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:04:53,801 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:04:53,802 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:04:53,804 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-09 21:04:53,804 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:53,810 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:53,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:53,819 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:65, output treesize:57 [2018-04-09 21:04:53,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2018-04-09 21:04:53,840 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:04:53,841 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:04:53,841 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:04:53,842 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:04:53,843 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:04:53,843 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:04:53,844 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:04:53,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 92 [2018-04-09 21:04:53,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:53,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:53,877 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 39 treesize of output 30 [2018-04-09 21:04:53,879 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:04:53,880 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:04:53,881 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:04:53,881 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:04:53,882 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:04:53,883 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:04:53,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 77 [2018-04-09 21:04:53,891 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:53,907 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:53,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:53,922 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:83, output treesize:81 [2018-04-09 21:04:53,990 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 34 [2018-04-09 21:04:53,991 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:04:53,992 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:04:53,993 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:04:53,993 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:04:53,994 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:04:53,994 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:04:53,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 46 [2018-04-09 21:04:53,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:54,003 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:54,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 38 [2018-04-09 21:04:54,015 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:04:54,015 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:04:54,016 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:04:54,016 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:04:54,017 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:04:54,017 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:04:54,018 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:04:54,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 49 [2018-04-09 21:04:54,019 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:54,025 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:54,028 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-09 21:04:54,029 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:99, output treesize:10 [2018-04-09 21:04:54,056 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:04:54,056 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:04:54,122 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-09 21:04:54,123 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:54,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:54,126 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:64, output treesize:1 [2018-04-09 21:04:54,132 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:04:54,153 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:04:54,154 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 14 [2018-04-09 21:04:54,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-09 21:04:54,154 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-09 21:04:54,154 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-04-09 21:04:54,155 INFO L87 Difference]: Start difference. First operand 255 states and 280 transitions. Second operand 14 states. [2018-04-09 21:04:54,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:04:54,656 INFO L93 Difference]: Finished difference Result 302 states and 328 transitions. [2018-04-09 21:04:54,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-09 21:04:54,657 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 50 [2018-04-09 21:04:54,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:04:54,658 INFO L225 Difference]: With dead ends: 302 [2018-04-09 21:04:54,658 INFO L226 Difference]: Without dead ends: 247 [2018-04-09 21:04:54,658 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 87 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=265, Invalid=665, Unknown=0, NotChecked=0, Total=930 [2018-04-09 21:04:54,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-04-09 21:04:54,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 238. [2018-04-09 21:04:54,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-04-09 21:04:54,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 262 transitions. [2018-04-09 21:04:54,671 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 262 transitions. Word has length 50 [2018-04-09 21:04:54,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:04:54,672 INFO L459 AbstractCegarLoop]: Abstraction has 238 states and 262 transitions. [2018-04-09 21:04:54,672 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-09 21:04:54,672 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 262 transitions. [2018-04-09 21:04:54,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-09 21:04:54,673 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:04:54,673 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] [2018-04-09 21:04:54,673 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:04:54,673 INFO L82 PathProgramCache]: Analyzing trace with hash -286960237, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:04:54,679 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:04:54,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:04:54,700 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:04:54,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-09 21:04:54,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 21:04:54,707 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:54,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:54,710 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-09 21:04:54,711 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-04-09 21:04:54,716 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 16 treesize of output 15 [2018-04-09 21:04:54,716 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:54,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:54,719 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-04-09 21:04:54,751 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 25 treesize of output 35 [2018-04-09 21:04:54,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-04-09 21:04:54,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:54,770 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:54,774 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-09 21:04:54,774 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-04-09 21:04:54,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2018-04-09 21:04:54,791 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 20 treesize of output 5 [2018-04-09 21:04:54,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:54,796 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:54,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:04:54,798 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:33, output treesize:11 [2018-04-09 21:04:54,807 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:04:54,808 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:04:54,846 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:04:54,867 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:04:54,868 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-04-09 21:04:54,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-09 21:04:54,868 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-09 21:04:54,868 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-04-09 21:04:54,868 INFO L87 Difference]: Start difference. First operand 238 states and 262 transitions. Second operand 13 states. [2018-04-09 21:04:55,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:04:55,120 INFO L93 Difference]: Finished difference Result 302 states and 331 transitions. [2018-04-09 21:04:55,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-09 21:04:55,120 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 50 [2018-04-09 21:04:55,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:04:55,121 INFO L225 Difference]: With dead ends: 302 [2018-04-09 21:04:55,121 INFO L226 Difference]: Without dead ends: 301 [2018-04-09 21:04:55,122 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2018-04-09 21:04:55,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-04-09 21:04:55,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 237. [2018-04-09 21:04:55,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-04-09 21:04:55,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 260 transitions. [2018-04-09 21:04:55,133 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 260 transitions. Word has length 50 [2018-04-09 21:04:55,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:04:55,133 INFO L459 AbstractCegarLoop]: Abstraction has 237 states and 260 transitions. [2018-04-09 21:04:55,133 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-09 21:04:55,133 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 260 transitions. [2018-04-09 21:04:55,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-09 21:04:55,134 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:04:55,134 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] [2018-04-09 21:04:55,134 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:04:55,134 INFO L82 PathProgramCache]: Analyzing trace with hash -286960236, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:04:55,141 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:04:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:04:55,165 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:04:55,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-09 21:04:55,168 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:55,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:55,170 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-09 21:04:55,200 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-09 21:04:55,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 21:04:55,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:55,206 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:55,216 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-09 21:04:55,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 21:04:55,218 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:55,223 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:55,230 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-09 21:04:55,230 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:40, output treesize:34 [2018-04-09 21:04:55,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2018-04-09 21:04:55,242 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:55,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:55,246 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:31 [2018-04-09 21:04:55,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 35 [2018-04-09 21:04:55,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-04-09 21:04:55,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:55,310 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:55,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 40 [2018-04-09 21:04:55,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 26 [2018-04-09 21:04:55,333 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:55,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 21:04:55,349 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:55,356 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:55,363 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-09 21:04:55,364 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:61, output treesize:53 [2018-04-09 21:04:55,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2018-04-09 21:04:55,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2018-04-09 21:04:55,388 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:55,398 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 20 treesize of output 5 [2018-04-09 21:04:55,399 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:55,403 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:55,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 33 [2018-04-09 21:04:55,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-04-09 21:04:55,417 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:55,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 9 [2018-04-09 21:04:55,430 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:55,437 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:55,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:04:55,442 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:67, output treesize:19 [2018-04-09 21:04:55,459 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:04:55,459 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:04:55,892 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-09 21:04:55,913 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:04:55,914 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2018-04-09 21:04:55,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-09 21:04:55,914 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-09 21:04:55,914 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=282, Unknown=1, NotChecked=0, Total=342 [2018-04-09 21:04:55,914 INFO L87 Difference]: Start difference. First operand 237 states and 260 transitions. Second operand 19 states. [2018-04-09 21:04:56,900 WARN L148 SmtUtils]: Spent 295ms on a formula simplification that was a NOOP. DAG size: 24 [2018-04-09 21:04:57,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:04:57,111 INFO L93 Difference]: Finished difference Result 343 states and 377 transitions. [2018-04-09 21:04:57,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-09 21:04:57,112 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 50 [2018-04-09 21:04:57,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:04:57,113 INFO L225 Difference]: With dead ends: 343 [2018-04-09 21:04:57,113 INFO L226 Difference]: Without dead ends: 342 [2018-04-09 21:04:57,113 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=202, Invalid=666, Unknown=2, NotChecked=0, Total=870 [2018-04-09 21:04:57,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-04-09 21:04:57,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 218. [2018-04-09 21:04:57,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-04-09 21:04:57,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 240 transitions. [2018-04-09 21:04:57,124 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 240 transitions. Word has length 50 [2018-04-09 21:04:57,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:04:57,124 INFO L459 AbstractCegarLoop]: Abstraction has 218 states and 240 transitions. [2018-04-09 21:04:57,124 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-09 21:04:57,125 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 240 transitions. [2018-04-09 21:04:57,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-09 21:04:57,125 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:04:57,125 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:04:57,125 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:04:57,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1517661726, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:04:57,133 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:04:57,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:04:57,165 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:04:57,214 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:04:57,215 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:04:57,215 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 23 [2018-04-09 21:04:57,216 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:57,227 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:04:57,227 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:04:57,228 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-09 21:04:57,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:57,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:57,234 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:21 [2018-04-09 21:04:57,287 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:04:57,287 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:04:57,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-04-09 21:04:57,390 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:57,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:57,394 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:12 [2018-04-09 21:04:57,412 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:04:57,446 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:04:57,446 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 14 [2018-04-09 21:04:57,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-09 21:04:57,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-09 21:04:57,447 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-04-09 21:04:57,447 INFO L87 Difference]: Start difference. First operand 218 states and 240 transitions. Second operand 15 states. [2018-04-09 21:04:58,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:04:58,011 INFO L93 Difference]: Finished difference Result 365 states and 399 transitions. [2018-04-09 21:04:58,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-09 21:04:58,011 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 53 [2018-04-09 21:04:58,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:04:58,013 INFO L225 Difference]: With dead ends: 365 [2018-04-09 21:04:58,013 INFO L226 Difference]: Without dead ends: 363 [2018-04-09 21:04:58,013 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=266, Invalid=604, Unknown=0, NotChecked=0, Total=870 [2018-04-09 21:04:58,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2018-04-09 21:04:58,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 244. [2018-04-09 21:04:58,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-04-09 21:04:58,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 267 transitions. [2018-04-09 21:04:58,031 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 267 transitions. Word has length 53 [2018-04-09 21:04:58,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:04:58,032 INFO L459 AbstractCegarLoop]: Abstraction has 244 states and 267 transitions. [2018-04-09 21:04:58,032 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-09 21:04:58,032 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 267 transitions. [2018-04-09 21:04:58,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-09 21:04:58,033 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:04:58,033 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:04:58,033 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:04:58,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1138090745, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:04:58,042 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:04:58,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:04:58,070 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:04:58,090 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-09 21:04:58,090 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:04:58,111 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-09 21:04:58,145 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:04:58,145 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2018-04-09 21:04:58,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-09 21:04:58,145 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-09 21:04:58,145 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-09 21:04:58,146 INFO L87 Difference]: Start difference. First operand 244 states and 267 transitions. Second operand 7 states. [2018-04-09 21:04:58,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:04:58,263 INFO L93 Difference]: Finished difference Result 276 states and 300 transitions. [2018-04-09 21:04:58,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-09 21:04:58,263 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 61 [2018-04-09 21:04:58,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:04:58,265 INFO L225 Difference]: With dead ends: 276 [2018-04-09 21:04:58,265 INFO L226 Difference]: Without dead ends: 275 [2018-04-09 21:04:58,265 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 112 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2018-04-09 21:04:58,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-04-09 21:04:58,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 236. [2018-04-09 21:04:58,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-04-09 21:04:58,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 259 transitions. [2018-04-09 21:04:58,280 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 259 transitions. Word has length 61 [2018-04-09 21:04:58,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:04:58,280 INFO L459 AbstractCegarLoop]: Abstraction has 236 states and 259 transitions. [2018-04-09 21:04:58,280 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-09 21:04:58,281 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 259 transitions. [2018-04-09 21:04:58,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-09 21:04:58,281 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:04:58,281 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:04:58,281 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:04:58,282 INFO L82 PathProgramCache]: Analyzing trace with hash 921076357, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:04:58,291 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:04:58,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:04:58,323 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:04:58,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-09 21:04:58,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-09 21:04:58,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:58,332 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:58,334 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-09 21:04:58,335 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2018-04-09 21:04:58,348 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 17 treesize of output 13 [2018-04-09 21:04:58,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-09 21:04:58,349 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:58,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:58,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:58,351 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-04-09 21:04:58,364 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:04:58,365 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:04:58,388 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:04:58,418 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:04:58,418 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2018-04-09 21:04:58,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-09 21:04:58,419 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-09 21:04:58,419 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-04-09 21:04:58,419 INFO L87 Difference]: Start difference. First operand 236 states and 259 transitions. Second operand 8 states. [2018-04-09 21:04:58,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:04:58,735 INFO L93 Difference]: Finished difference Result 282 states and 304 transitions. [2018-04-09 21:04:58,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-09 21:04:58,735 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2018-04-09 21:04:58,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:04:58,736 INFO L225 Difference]: With dead ends: 282 [2018-04-09 21:04:58,736 INFO L226 Difference]: Without dead ends: 281 [2018-04-09 21:04:58,737 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2018-04-09 21:04:58,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-04-09 21:04:58,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 250. [2018-04-09 21:04:58,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-04-09 21:04:58,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 275 transitions. [2018-04-09 21:04:58,750 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 275 transitions. Word has length 62 [2018-04-09 21:04:58,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:04:58,750 INFO L459 AbstractCegarLoop]: Abstraction has 250 states and 275 transitions. [2018-04-09 21:04:58,750 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-09 21:04:58,750 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 275 transitions. [2018-04-09 21:04:58,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-09 21:04:58,751 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:04:58,751 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:04:58,751 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:04:58,751 INFO L82 PathProgramCache]: Analyzing trace with hash 921076358, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:04:58,758 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:04:58,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:04:58,787 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:04:58,855 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-09 21:04:58,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 21:04:58,857 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:58,858 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:58,871 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-09 21:04:58,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 21:04:58,874 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:58,876 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:58,883 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-09 21:04:58,883 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:42, output treesize:36 [2018-04-09 21:04:58,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-09 21:04:58,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-04-09 21:04:58,924 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:58,925 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:58,934 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 33 treesize of output 25 [2018-04-09 21:04:58,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-04-09 21:04:58,937 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:58,941 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:58,947 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-09 21:04:58,947 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:50, output treesize:14 [2018-04-09 21:04:58,979 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:04:58,979 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:04:59,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-04-09 21:04:59,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:04:59,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:04:59,078 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:13 [2018-04-09 21:04:59,099 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:04:59,120 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:04:59,120 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13, 8] imperfect sequences [] total 20 [2018-04-09 21:04:59,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-09 21:04:59,121 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-09 21:04:59,121 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2018-04-09 21:04:59,121 INFO L87 Difference]: Start difference. First operand 250 states and 275 transitions. Second operand 21 states. [2018-04-09 21:05:00,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:05:00,310 INFO L93 Difference]: Finished difference Result 423 states and 464 transitions. [2018-04-09 21:05:00,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-09 21:05:00,310 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 62 [2018-04-09 21:05:00,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:05:00,311 INFO L225 Difference]: With dead ends: 423 [2018-04-09 21:05:00,311 INFO L226 Difference]: Without dead ends: 422 [2018-04-09 21:05:00,312 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=561, Invalid=1695, Unknown=0, NotChecked=0, Total=2256 [2018-04-09 21:05:00,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2018-04-09 21:05:00,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 250. [2018-04-09 21:05:00,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-04-09 21:05:00,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 274 transitions. [2018-04-09 21:05:00,326 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 274 transitions. Word has length 62 [2018-04-09 21:05:00,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:05:00,326 INFO L459 AbstractCegarLoop]: Abstraction has 250 states and 274 transitions. [2018-04-09 21:05:00,327 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-09 21:05:00,327 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 274 transitions. [2018-04-09 21:05:00,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-09 21:05:00,327 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:05:00,327 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:05:00,327 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:05:00,327 INFO L82 PathProgramCache]: Analyzing trace with hash -760189523, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:05:00,335 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:05:00,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:05:00,363 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:05:00,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-09 21:05:00,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 21:05:00,416 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:00,418 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:00,423 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-09 21:05:00,423 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2018-04-09 21:05:00,513 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 22 treesize of output 16 [2018-04-09 21:05:00,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-04-09 21:05:00,514 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:00,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:00,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:00,521 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:7 [2018-04-09 21:05:00,553 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:05:00,553 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:05:00,632 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:05:00,653 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:05:00,653 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13, 10] imperfect sequences [] total 19 [2018-04-09 21:05:00,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-09 21:05:00,654 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-09 21:05:00,654 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2018-04-09 21:05:00,654 INFO L87 Difference]: Start difference. First operand 250 states and 274 transitions. Second operand 20 states. [2018-04-09 21:05:01,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:05:01,603 INFO L93 Difference]: Finished difference Result 517 states and 555 transitions. [2018-04-09 21:05:01,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-09 21:05:01,603 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 65 [2018-04-09 21:05:01,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:05:01,604 INFO L225 Difference]: With dead ends: 517 [2018-04-09 21:05:01,604 INFO L226 Difference]: Without dead ends: 516 [2018-04-09 21:05:01,605 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=678, Invalid=1974, Unknown=0, NotChecked=0, Total=2652 [2018-04-09 21:05:01,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2018-04-09 21:05:01,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 291. [2018-04-09 21:05:01,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-04-09 21:05:01,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 322 transitions. [2018-04-09 21:05:01,623 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 322 transitions. Word has length 65 [2018-04-09 21:05:01,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:05:01,623 INFO L459 AbstractCegarLoop]: Abstraction has 291 states and 322 transitions. [2018-04-09 21:05:01,623 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-09 21:05:01,623 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 322 transitions. [2018-04-09 21:05:01,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-09 21:05:01,624 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:05:01,624 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:05:01,624 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:05:01,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1349752688, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:05:01,634 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:05:01,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:05:01,658 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:05:01,673 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-09 21:05:01,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 21:05:01,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:01,676 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:01,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-09 21:05:01,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 21:05:01,684 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:01,685 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:01,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:01,690 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-04-09 21:05:01,702 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-09 21:05:01,703 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:01,704 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-09 21:05:01,704 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:01,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:01,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-09 21:05:01,721 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:01,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-09 21:05:01,722 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:01,725 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:01,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:01,737 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:52, output treesize:44 [2018-04-09 21:05:01,782 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:01,782 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:01,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, 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-09 21:05:01,783 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:01,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:01,794 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:49 [2018-04-09 21:05:01,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-04-09 21:05:01,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 21:05:01,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:01,843 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:01,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-04-09 21:05:01,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 21:05:01,865 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:01,869 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:01,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:01,884 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:80, output treesize:72 [2018-04-09 21:05:01,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-04-09 21:05:01,918 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:01,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-09 21:05:01,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:01,926 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:01,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 38 [2018-04-09 21:05:01,955 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:01,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-09 21:05:01,956 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:01,963 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:01,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:01,992 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:98, output treesize:90 [2018-04-09 21:05:02,028 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 46 treesize of output 43 [2018-04-09 21:05:02,031 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:02,032 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:02,032 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:02,033 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:02,033 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 55 [2018-04-09 21:05:02,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:02,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:02,080 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:02,080 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 46 treesize of output 52 [2018-04-09 21:05:02,083 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:02,084 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:02,084 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:02,087 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 32 treesize of output 54 [2018-04-09 21:05:02,087 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:02,097 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:02,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:02,119 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:115, output treesize:107 [2018-04-09 21:05:02,176 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 55 treesize of output 50 [2018-04-09 21:05:02,179 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:02,180 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:02,181 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:02,182 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:02,183 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:02,184 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:02,184 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:02,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 92 [2018-04-09 21:05:02,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:02,205 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:02,238 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:02,240 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:02,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 67 [2018-04-09 21:05:02,243 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:02,244 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:02,246 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:02,246 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:02,247 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:02,249 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:02,263 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 47 treesize of output 106 [2018-04-09 21:05:02,264 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-09 21:05:02,294 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:02,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:02,320 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:133, output treesize:131 [2018-04-09 21:05:02,376 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:02,377 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:02,379 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 64 treesize of output 78 [2018-04-09 21:05:02,385 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:02,415 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 40 treesize of output 93 [2018-04-09 21:05:02,419 INFO L267 ElimStorePlain]: Start of recursive call 3: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 14 xjuncts. [2018-04-09 21:05:02,492 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-09 21:05:02,570 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 70 treesize of output 67 [2018-04-09 21:05:02,573 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:02,575 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:02,576 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 35 [2018-04-09 21:05:02,576 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:02,589 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:02,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-09 21:05:02,648 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:157, output treesize:444 [2018-04-09 21:05:02,916 WARN L151 SmtUtils]: Spent 240ms on a formula simplification. DAG size of input: 68 DAG size of output 68 [2018-04-09 21:05:02,940 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:02,941 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:02,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 310 treesize of output 305 [2018-04-09 21:05:02,952 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:02,953 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:02,954 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:02,955 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:02,962 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:02,963 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:02,964 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:02,971 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:02,992 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 102 treesize of output 284 [2018-04-09 21:05:02,993 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-09 21:05:03,113 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-09 21:05:03,624 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:03,628 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:03,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 342 treesize of output 327 [2018-04-09 21:05:03,635 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:03,641 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:03,642 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:03,643 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:03,644 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:03,645 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:03,646 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:03,655 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:03,670 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 108 treesize of output 306 [2018-04-09 21:05:03,672 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-09 21:05:03,792 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-09 21:05:04,440 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 364 treesize of output 315 [2018-04-09 21:05:04,444 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:04,445 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:04,446 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:04,446 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:04,447 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:04,448 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:04,448 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:04,453 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 0 case distinctions, treesize of input 95 treesize of output 263 [2018-04-09 21:05:04,453 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:04,501 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:05,049 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:05,050 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:05,051 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 324 treesize of output 309 [2018-04-09 21:05:05,055 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:05,055 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:05,056 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:05,057 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:05,058 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:05,060 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:05,067 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:05,083 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 108 treesize of output 309 [2018-04-09 21:05:05,084 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-09 21:05:05,177 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-09 21:05:05,786 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:05,789 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:05,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 322 treesize of output 299 [2018-04-09 21:05:05,793 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:05,794 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:05,794 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:05,795 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:05,796 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:05,796 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:05,797 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:05,797 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 113 treesize of output 277 [2018-04-09 21:05:05,798 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:05,838 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:05,841 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:05,845 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:05,846 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 331 treesize of output 308 [2018-04-09 21:05:05,850 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:05,851 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:05,852 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:05,852 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:05,853 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:05,854 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:05,854 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:05,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 277 [2018-04-09 21:05:05,855 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:05,897 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:05,900 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:05,903 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:05,904 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 331 treesize of output 308 [2018-04-09 21:05:05,907 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:05,908 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:05,908 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:05,909 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:05,909 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:05,910 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:05,911 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:05,911 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 113 treesize of output 277 [2018-04-09 21:05:05,912 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:05,960 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:06,474 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:06,477 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:06,543 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 302 treesize of output 289 [2018-04-09 21:05:06,548 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:06,550 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:06,551 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:06,552 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:06,553 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:06,555 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:06,555 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:06,556 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 111 treesize of output 265 [2018-04-09 21:05:06,557 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:06,627 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:06,631 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:06,634 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:06,637 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 303 treesize of output 290 [2018-04-09 21:05:06,646 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:06,647 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:06,648 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:06,649 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:06,650 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:06,651 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:06,652 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:06,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 265 [2018-04-09 21:05:06,653 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:06,727 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:06,731 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:06,732 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 299 treesize of output 278 [2018-04-09 21:05:06,736 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:06,737 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:06,737 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:06,738 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:06,739 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:06,740 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:06,740 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:06,741 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 111 treesize of output 265 [2018-04-09 21:05:06,742 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:06,824 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:07,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 6 dim-2 vars, End of recursive call: 9 dim-0 vars, and 9 xjuncts. [2018-04-09 21:05:07,246 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 7 variables, input treesize:1017, output treesize:2573 [2018-04-09 21:05:07,555 WARN L151 SmtUtils]: Spent 240ms on a formula simplification. DAG size of input: 217 DAG size of output 125 [2018-04-09 21:05:07,720 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:07,721 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:07,721 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 327 treesize of output 282 [2018-04-09 21:05:07,730 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:07,762 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 181 treesize of output 284 [2018-04-09 21:05:07,762 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-09 21:05:07,775 INFO L267 ElimStorePlain]: Start of recursive call 3: 12 dim-0 vars, End of recursive call: 12 dim-0 vars, and 15 xjuncts. [2018-04-09 21:05:07,927 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:07,927 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:07,928 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:07,929 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:07,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 218 treesize of output 241 [2018-04-09 21:05:07,932 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-09 21:05:07,936 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:07,936 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:07,937 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:07,937 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:07,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 226 treesize of output 295 [2018-04-09 21:05:07,948 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-09 21:05:08,055 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-04-09 21:05:08,269 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:08,269 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:08,270 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 281 treesize of output 239 [2018-04-09 21:05:08,273 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:08,274 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:08,274 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:08,275 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:08,276 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:08,281 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:08,281 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:08,282 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:08,284 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:08,308 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 278 [2018-04-09 21:05:08,308 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-09 21:05:08,336 INFO L267 ElimStorePlain]: Start of recursive call 7: 39 dim-0 vars, End of recursive call: 39 dim-0 vars, and 43 xjuncts. [2018-04-09 21:05:08,537 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 142 treesize of output 122 [2018-04-09 21:05:08,537 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:08,541 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:08,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 142 treesize of output 134 [2018-04-09 21:05:08,546 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-04-09 21:05:08,581 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:08,756 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:08,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 293 treesize of output 237 [2018-04-09 21:05:08,759 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:08,760 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:08,761 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:08,761 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:08,762 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:08,762 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:08,763 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:08,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 101 [2018-04-09 21:05:08,764 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:08,813 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:08,822 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:08,823 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:08,823 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 122 treesize of output 89 [2018-04-09 21:05:08,824 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:08,840 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:08,998 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:08,999 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:08,999 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 126 treesize of output 93 [2018-04-09 21:05:09,003 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:09,005 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:09,007 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:09,008 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:09,009 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:09,009 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:09,010 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:09,010 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:09,016 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:09,038 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 146 [2018-04-09 21:05:09,038 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-09 21:05:09,057 INFO L267 ElimStorePlain]: Start of recursive call 14: 41 dim-0 vars, End of recursive call: 41 dim-0 vars, and 45 xjuncts. [2018-04-09 21:05:09,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 46 [2018-04-09 21:05:09,306 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-09 21:05:09,308 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 49 treesize of output 40 [2018-04-09 21:05:09,308 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:05:09,338 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-04-09 21:05:09,510 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 177 treesize of output 139 [2018-04-09 21:05:09,513 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:09,514 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:09,515 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:09,515 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:09,515 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:09,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 63 [2018-04-09 21:05:09,516 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:09,540 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:09,541 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:09,541 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:09,542 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:09,542 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:09,543 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:09,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 46 [2018-04-09 21:05:09,546 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:09,562 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:09,564 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 203 treesize of output 159 [2018-04-09 21:05:09,567 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:09,568 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:09,568 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:09,569 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:09,569 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:09,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 77 [2018-04-09 21:05:09,570 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:09,594 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:09,594 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:09,595 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:09,596 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:09,596 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:09,597 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:09,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 43 [2018-04-09 21:05:09,600 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:09,618 INFO L267 ElimStorePlain]: Start of recursive call 20: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:09,621 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 205 treesize of output 161 [2018-04-09 21:05:09,623 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:09,624 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:09,624 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:09,625 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:09,625 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:09,626 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:09,629 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 91 [2018-04-09 21:05:09,629 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:09,657 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:09,658 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:09,659 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:09,659 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:09,660 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:09,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 49 [2018-04-09 21:05:09,661 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:09,675 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:09,777 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 157 treesize of output 119 [2018-04-09 21:05:09,779 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:09,780 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:09,780 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:09,781 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:09,781 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:09,782 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:09,782 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:09,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 101 [2018-04-09 21:05:09,783 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:09,802 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:09,803 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:09,803 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:09,804 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 44 treesize of output 23 [2018-04-09 21:05:09,804 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:09,812 INFO L267 ElimStorePlain]: Start of recursive call 26: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:09,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 6 dim-2 vars, End of recursive call: 6 dim-0 vars, and 7 xjuncts. [2018-04-09 21:05:09,901 INFO L202 ElimStorePlain]: Needed 28 recursive calls to eliminate 10 variables, input treesize:902, output treesize:139 [2018-04-09 21:05:10,081 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:05:10,081 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:05:11,120 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 230 treesize of output 225 [2018-04-09 21:05:11,120 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:11,158 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 230 treesize of output 225 [2018-04-09 21:05:11,158 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:11,198 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-09 21:05:11,199 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:461, output treesize:445 [2018-04-09 21:05:11,821 WARN L148 SmtUtils]: Spent 142ms on a formula simplification that was a NOOP. DAG size: 74 [2018-04-09 21:05:16,386 WARN L151 SmtUtils]: Spent 939ms on a formula simplification. DAG size of input: 146 DAG size of output 92 [2018-04-09 21:05:16,389 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 210 treesize of output 164 [2018-04-09 21:05:16,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 129 [2018-04-09 21:05:16,429 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:16,429 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 129 treesize of output 123 [2018-04-09 21:05:16,430 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:16,437 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:16,456 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:16,456 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 113 [2018-04-09 21:05:16,485 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:16,486 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:16,486 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:16,487 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:16,487 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 88 treesize of output 98 [2018-04-09 21:05:16,495 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:16,495 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05: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, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 90 [2018-04-09 21:05:16,500 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:16,500 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:16,501 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:16,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 108 [2018-04-09 21:05:16,502 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:16,518 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:16,528 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:16,539 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 60 [2018-04-09 21:05:16,570 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-09 21:05:16,570 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:16,572 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:16,573 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:16,573 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:16,574 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:16,574 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:16,575 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:16,575 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:16,577 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:16,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 105 [2018-04-09 21:05:16,578 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:16,595 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 54 treesize of output 42 [2018-04-09 21:05:16,598 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:16,598 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:16,599 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:16,599 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:16,601 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:16,601 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:16,601 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:16,601 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:16,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 42 [2018-04-09 21:05:16,602 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:16,610 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:16,613 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:16,617 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:16,624 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:16,700 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 367 treesize of output 321 [2018-04-09 21:05:16,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 129 [2018-04-09 21:05:16,750 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:16,750 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 129 treesize of output 123 [2018-04-09 21:05:16,750 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:16,756 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:16,775 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:16,775 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 113 [2018-04-09 21:05:16,808 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:16,809 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:16,810 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:16,810 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:16,811 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 88 treesize of output 100 [2018-04-09 21:05:16,814 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:16,814 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:16,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 96 [2018-04-09 21:05:16,818 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:16,819 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:16,819 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:16,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 116 [2018-04-09 21:05:16,820 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:16,833 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:16,843 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:16,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 66 [2018-04-09 21:05:16,877 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:16,878 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:16,878 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:16,879 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:16,879 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:16,880 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:16,881 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:16,882 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:16,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 117 [2018-04-09 21:05:16,882 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:16,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 46 [2018-04-09 21:05:16,901 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:16,902 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:16,903 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:16,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2018-04-09 21:05:16,904 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:16,911 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:16,914 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:16,917 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:16,925 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:16,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:16,958 INFO L202 ElimStorePlain]: Needed 24 recursive calls to eliminate 9 variables, input treesize:887, output treesize:16 [2018-04-09 21:05:17,067 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:05:17,087 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:05:17,087 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 35 [2018-04-09 21:05:17,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-09 21:05:17,088 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-09 21:05:17,088 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1061, Unknown=1, NotChecked=0, Total=1260 [2018-04-09 21:05:17,089 INFO L87 Difference]: Start difference. First operand 291 states and 322 transitions. Second operand 36 states. [2018-04-09 21:05:19,298 WARN L151 SmtUtils]: Spent 415ms on a formula simplification. DAG size of input: 111 DAG size of output 87 [2018-04-09 21:05:19,549 WARN L148 SmtUtils]: Spent 112ms on a formula simplification that was a NOOP. DAG size: 71 [2018-04-09 21:05:21,768 WARN L151 SmtUtils]: Spent 1816ms on a formula simplification. DAG size of input: 264 DAG size of output 181 [2018-04-09 21:05:31,131 WARN L151 SmtUtils]: Spent 5829ms on a formula simplification. DAG size of input: 375 DAG size of output 292 [2018-04-09 21:05:32,069 WARN L148 SmtUtils]: Spent 106ms on a formula simplification that was a NOOP. DAG size: 145 [2018-04-09 21:05:32,477 WARN L148 SmtUtils]: Spent 139ms on a formula simplification that was a NOOP. DAG size: 69 [2018-04-09 21:05:33,315 WARN L151 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 106 DAG size of output 69 [2018-04-09 21:05:33,661 WARN L151 SmtUtils]: Spent 225ms on a formula simplification. DAG size of input: 163 DAG size of output 153 [2018-04-09 21:05:34,304 WARN L151 SmtUtils]: Spent 260ms on a formula simplification. DAG size of input: 173 DAG size of output 162 [2018-04-09 21:05:34,635 WARN L151 SmtUtils]: Spent 242ms on a formula simplification. DAG size of input: 163 DAG size of output 153 [2018-04-09 21:05:35,204 WARN L151 SmtUtils]: Spent 220ms on a formula simplification. DAG size of input: 163 DAG size of output 150 [2018-04-09 21:05:36,374 WARN L151 SmtUtils]: Spent 396ms on a formula simplification. DAG size of input: 227 DAG size of output 217 [2018-04-09 21:05:36,815 WARN L151 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 116 DAG size of output 61 [2018-04-09 21:05:41,037 WARN L151 SmtUtils]: Spent 130ms on a formula simplification. DAG size of input: 128 DAG size of output 73 [2018-04-09 21:05:42,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:05:42,017 INFO L93 Difference]: Finished difference Result 522 states and 567 transitions. [2018-04-09 21:05:42,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-04-09 21:05:42,052 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 66 [2018-04-09 21:05:42,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:05:42,054 INFO L225 Difference]: With dead ends: 522 [2018-04-09 21:05:42,054 INFO L226 Difference]: Without dead ends: 521 [2018-04-09 21:05:42,056 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1417 ImplicationChecksByTransitivity, 22.2s TimeCoverageRelationStatistics Valid=1068, Invalid=5093, Unknown=1, NotChecked=0, Total=6162 [2018-04-09 21:05:42,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2018-04-09 21:05:42,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 347. [2018-04-09 21:05:42,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-04-09 21:05:42,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 384 transitions. [2018-04-09 21:05:42,077 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 384 transitions. Word has length 66 [2018-04-09 21:05:42,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:05:42,077 INFO L459 AbstractCegarLoop]: Abstraction has 347 states and 384 transitions. [2018-04-09 21:05:42,077 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-09 21:05:42,077 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 384 transitions. [2018-04-09 21:05:42,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-09 21:05:42,078 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:05:42,078 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:05:42,078 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:05:42,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1349752687, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:05:42,084 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:05:42,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:05:42,113 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:05:42,150 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-09 21:05:42,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 21:05:42,152 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:42,153 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:42,163 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-09 21:05:42,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 21:05:42,164 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:42,169 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:42,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:42,176 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-04-09 21:05:42,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-09 21:05:42,192 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:42,193 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-09 21:05:42,193 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:42,198 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:42,213 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-09 21:05:42,215 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:42,215 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-09 21:05:42,216 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:42,220 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:42,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:42,230 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:52, output treesize:44 [2018-04-09 21:05:42,288 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:42,289 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:42,290 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-09 21:05:42,290 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:42,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:42,303 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:49 [2018-04-09 21:05:42,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-04-09 21:05:42,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, 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-09 21:05:42,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:42,356 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:42,374 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 43 [2018-04-09 21:05:42,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 21:05:42,376 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:42,381 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:42,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:42,394 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:75, output treesize:79 [2018-04-09 21:05:42,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 56 [2018-04-09 21:05:42,426 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:42,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-09 21:05:42,427 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:42,434 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:42,459 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 67 treesize of output 66 [2018-04-09 21:05:42,463 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:42,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-09 21:05:42,464 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:42,479 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:42,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:42,497 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:105, output treesize:97 [2018-04-09 21:05:42,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 61 [2018-04-09 21:05:42,536 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:42,536 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:42,537 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:42,539 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-09 21:05:42,539 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:42,551 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:42,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 71 [2018-04-09 21:05:42,581 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:42,582 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:42,583 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:42,585 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 23 treesize of output 46 [2018-04-09 21:05:42,585 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:42,598 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:42,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:42,618 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:119, output treesize:111 [2018-04-09 21:05:42,661 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 67 treesize of output 68 [2018-04-09 21:05:42,665 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:42,666 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:42,667 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:42,668 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:42,669 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:42,669 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:42,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 77 [2018-04-09 21:05:42,675 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:42,693 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:42,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 78 [2018-04-09 21:05:42,731 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:42,731 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:42,732 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:42,732 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:42,733 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:42,734 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:42,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 77 [2018-04-09 21:05:42,737 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:42,759 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:42,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:42,783 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:137, output treesize:129 [2018-04-09 21:05:42,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, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 82 [2018-04-09 21:05:42,838 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:42,839 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:42,839 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:42,842 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 29 treesize of output 64 [2018-04-09 21:05:42,842 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:42,857 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:42,895 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 107 treesize of output 98 [2018-04-09 21:05:42,898 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:42,899 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:42,900 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:42,900 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 60 treesize of output 89 [2018-04-09 21:05:42,900 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:42,918 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:42,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:42,946 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:155, output treesize:153 [2018-04-09 21:05:43,000 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:43,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 351 treesize of output 345 [2018-04-09 21:05:43,006 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:43,006 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:43,007 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:43,008 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:43,009 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:43,010 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:43,017 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 0 case distinctions, treesize of input 146 treesize of output 320 [2018-04-09 21:05:43,017 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:43,050 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:43,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 340 treesize of output 302 [2018-04-09 21:05:43,090 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:43,090 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:43,091 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:43,092 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:43,093 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:43,093 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:43,096 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:43,100 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 115 treesize of output 333 [2018-04-09 21:05:43,101 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:43,130 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:43,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:43,154 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:383, output treesize:327 [2018-04-09 21:05:43,250 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:43,251 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 328 treesize of output 259 [2018-04-09 21:05:43,254 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:43,254 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 252 treesize of output 178 [2018-04-09 21:05:43,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:43,276 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:43,277 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:43,277 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:43,278 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:43,281 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 192 [2018-04-09 21:05:43,281 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-09 21:05:43,298 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-09 21:05:43,314 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 94 treesize of output 72 [2018-04-09 21:05:43,316 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:43,317 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:43,318 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:43,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 50 [2018-04-09 21:05:43,321 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-09 21:05:43,334 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:43,335 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:43,335 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:43,336 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:43,336 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:43,337 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:05:43,340 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:05:43,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2018-04-09 21:05:43,341 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 21:05:43,356 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:43,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:05:43,361 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:341, output treesize:13 [2018-04-09 21:05:43,425 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:05:43,425 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:05:55,850 WARN L148 SmtUtils]: Spent 1398ms on a formula simplification that was a NOOP. DAG size: 51 [2018-04-09 21:05:57,652 WARN L148 SmtUtils]: Spent 945ms on a formula simplification that was a NOOP. DAG size: 51 [2018-04-09 21:05:58,131 WARN L148 SmtUtils]: Spent 379ms on a formula simplification that was a NOOP. DAG size: 61 [2018-04-09 21:06:01,766 WARN L148 SmtUtils]: Spent 269ms on a formula simplification that was a NOOP. DAG size: 59 [2018-04-09 21:06:06,902 WARN L148 SmtUtils]: Spent 167ms on a formula simplification that was a NOOP. DAG size: 66 [2018-04-09 21:06:07,524 WARN L151 SmtUtils]: Spent 618ms on a formula simplification. DAG size of input: 101 DAG size of output 65 [2018-04-09 21:06:07,529 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 157 [2018-04-09 21:06:07,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 129 [2018-04-09 21:06:07,565 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:07,565 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 129 treesize of output 123 [2018-04-09 21:06:07,566 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 21:06:07,574 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:06:07,591 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:07,591 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 113 [2018-04-09 21:06:07,622 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:07,622 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:07,623 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:06:07,623 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:07,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 100 [2018-04-09 21:06:07,626 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:07,627 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:07,627 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 96 [2018-04-09 21:06:07,629 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:07,630 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:07,630 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:07,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 116 [2018-04-09 21:06:07,631 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-09 21:06:07,644 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:06:07,653 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:06:07,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, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 62 [2018-04-09 21:06:07,690 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-09 21:06:07,690 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-09 21:06:07,692 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:07,692 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:07,693 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:07,693 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:07,693 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:07,693 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:07,694 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:07,694 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:07,694 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:07,695 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:07,695 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:07,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 138 [2018-04-09 21:06:07,696 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-09 21:06:07,717 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 61 treesize of output 49 [2018-04-09 21:06:07,737 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:07,737 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:07,737 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:07,738 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:07,738 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:07,738 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:07,739 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:07,739 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:07,739 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:07,739 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:07,740 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:06:07,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 76 [2018-04-09 21:06:07,741 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-09 21:06:07,752 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:06:07,753 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:06:07,756 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:06:07,761 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:06:07,794 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 157 [2018-04-09 21:06:07,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 129 [2018-04-09 21:06:07,829 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:07,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 123 [2018-04-09 21:06:07,830 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-09 21:06:07,836 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:06:07,848 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:07,848 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 113 [2018-04-09 21:06:07,878 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:07,879 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:07,893 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 88 treesize of output 100 [2018-04-09 21:06:07,895 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:07,896 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:07,896 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:07,897 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:07,897 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:07,897 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:07,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 93 treesize of output 108 [2018-04-09 21:06:07,903 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:07,903 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:07,903 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:07,903 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:07,904 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:07,904 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:06:07,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 118 [2018-04-09 21:06:07,909 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-09 21:06:07,926 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:06:07,945 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:07,946 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:07,946 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:07,946 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:07,947 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:07,948 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 113 [2018-04-09 21:06:07,950 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:07,951 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:07,951 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:07,951 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:07,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 131 [2018-04-09 21:06:07,953 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-09 21:06:07,969 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:06:07,987 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:06:08,008 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 45 treesize of output 37 [2018-04-09 21:06:08,009 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:08,010 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:08,010 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:08,010 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:08,010 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:08,011 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:08,011 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:08,013 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 31 treesize of output 48 [2018-04-09 21:06:08,014 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-09 21:06:08,021 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:06:08,023 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 68 [2018-04-09 21:06:08,051 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:08,051 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:08,051 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:08,052 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:08,052 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:08,052 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:08,053 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:08,053 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:08,053 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:08,053 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:08,054 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:08,055 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:08,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 141 [2018-04-09 21:06:08,058 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-09 21:06:08,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 44 [2018-04-09 21:06:08,083 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:08,083 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:08,084 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:08,084 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:08,084 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:08,084 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:08,085 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:08,085 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:08,085 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:06:08,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 72 [2018-04-09 21:06:08,090 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-09 21:06:08,099 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:06:08,102 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:06:08,107 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:06:08,114 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:06:08,133 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-09 21:06:08,133 INFO L202 ElimStorePlain]: Needed 28 recursive calls to eliminate 6 variables, input treesize:449, output treesize:37 [2018-04-09 21:06:12,226 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:06:12,247 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:06:12,247 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 35 [2018-04-09 21:06:12,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-09 21:06:12,247 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-09 21:06:12,248 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1020, Unknown=9, NotChecked=0, Total=1190 [2018-04-09 21:06:12,248 INFO L87 Difference]: Start difference. First operand 347 states and 384 transitions. Second operand 35 states. [2018-04-09 21:06:14,164 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 127 DAG size of output 72 [2018-04-09 21:06:14,379 WARN L151 SmtUtils]: Spent 164ms on a formula simplification. DAG size of input: 155 DAG size of output 90 [2018-04-09 21:06:30,486 WARN L151 SmtUtils]: Spent 13836ms on a formula simplification. DAG size of input: 239 DAG size of output 139 [2018-04-09 21:06:57,000 WARN L151 SmtUtils]: Spent 14979ms on a formula simplification. DAG size of input: 217 DAG size of output 126 [2018-04-09 21:07:25,415 WARN L151 SmtUtils]: Spent 18650ms on a formula simplification. DAG size of input: 227 DAG size of output 150 [2018-04-09 21:07:38,815 WARN L151 SmtUtils]: Spent 8955ms on a formula simplification. DAG size of input: 280 DAG size of output 180 [2018-04-09 21:07:44,283 WARN L151 SmtUtils]: Spent 144ms on a formula simplification. DAG size of input: 72 DAG size of output 62 [2018-04-09 21:07:45,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:07:45,210 INFO L93 Difference]: Finished difference Result 517 states and 564 transitions. [2018-04-09 21:07:45,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-09 21:07:45,210 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 66 [2018-04-09 21:07:45,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:07:45,212 INFO L225 Difference]: With dead ends: 517 [2018-04-09 21:07:45,212 INFO L226 Difference]: Without dead ends: 464 [2018-04-09 21:07:45,213 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1220 ImplicationChecksByTransitivity, 105.3s TimeCoverageRelationStatistics Valid=945, Invalid=4299, Unknown=12, NotChecked=0, Total=5256 [2018-04-09 21:07:45,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-04-09 21:07:45,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 345. [2018-04-09 21:07:45,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-04-09 21:07:45,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 380 transitions. [2018-04-09 21:07:45,236 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 380 transitions. Word has length 66 [2018-04-09 21:07:45,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:07:45,236 INFO L459 AbstractCegarLoop]: Abstraction has 345 states and 380 transitions. [2018-04-09 21:07:45,236 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-09 21:07:45,236 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 380 transitions. [2018-04-09 21:07:45,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-09 21:07:45,236 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:07:45,236 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:07:45,237 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:07:45,237 INFO L82 PathProgramCache]: Analyzing trace with hash -2091038554, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:07:45,242 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:07:45,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:07:45,268 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:07:45,275 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-04-09 21:07:45,275 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:07:45,277 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 12 treesize of output 7 [2018-04-09 21:07:45,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:45,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:07:45,278 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2018-04-09 21:07:45,282 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-04-09 21:07:45,302 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:07:45,302 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 21:07:45,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-09 21:07:45,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-09 21:07:45,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-09 21:07:45,303 INFO L87 Difference]: Start difference. First operand 345 states and 380 transitions. Second operand 4 states. [2018-04-09 21:07:45,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:07:45,359 INFO L93 Difference]: Finished difference Result 345 states and 380 transitions. [2018-04-09 21:07:45,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-09 21:07:45,359 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-04-09 21:07:45,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:07:45,360 INFO L225 Difference]: With dead ends: 345 [2018-04-09 21:07:45,360 INFO L226 Difference]: Without dead ends: 344 [2018-04-09 21:07:45,361 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 129 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-09 21:07:45,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-04-09 21:07:45,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2018-04-09 21:07:45,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-04-09 21:07:45,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 378 transitions. [2018-04-09 21:07:45,381 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 378 transitions. Word has length 66 [2018-04-09 21:07:45,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:07:45,381 INFO L459 AbstractCegarLoop]: Abstraction has 344 states and 378 transitions. [2018-04-09 21:07:45,381 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-09 21:07:45,381 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 378 transitions. [2018-04-09 21:07:45,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-09 21:07:45,382 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:07:45,382 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:07:45,382 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:07:45,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1309297633, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:07:45,387 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:07:45,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:07:45,410 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:07:45,416 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:07:45,416 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:07:45,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-09 21:07:45,417 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:45,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:07:45,418 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2018-04-09 21:07:45,424 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-09 21:07:45,425 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-09 21:07:45,425 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:45,426 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:07:45,429 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-09 21:07:45,429 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2018-04-09 21:07:45,444 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 16 treesize of output 12 [2018-04-09 21:07:45,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-04-09 21:07:45,445 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:45,446 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:07:45,447 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-09 21:07:45,447 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2018-04-09 21:07:45,460 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:07:45,460 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:07:45,477 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:07:45,498 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:07:45,499 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-04-09 21:07:45,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-09 21:07:45,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-09 21:07:45,499 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-04-09 21:07:45,499 INFO L87 Difference]: Start difference. First operand 344 states and 378 transitions. Second operand 11 states. [2018-04-09 21:07:45,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:07:45,870 INFO L93 Difference]: Finished difference Result 574 states and 623 transitions. [2018-04-09 21:07:45,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-09 21:07:45,870 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2018-04-09 21:07:45,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:07:45,872 INFO L225 Difference]: With dead ends: 574 [2018-04-09 21:07:45,872 INFO L226 Difference]: Without dead ends: 536 [2018-04-09 21:07:45,872 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2018-04-09 21:07:45,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2018-04-09 21:07:45,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 344. [2018-04-09 21:07:45,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-04-09 21:07:45,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 377 transitions. [2018-04-09 21:07:45,902 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 377 transitions. Word has length 67 [2018-04-09 21:07:45,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:07:45,902 INFO L459 AbstractCegarLoop]: Abstraction has 344 states and 377 transitions. [2018-04-09 21:07:45,902 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-09 21:07:45,902 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 377 transitions. [2018-04-09 21:07:45,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-04-09 21:07:45,903 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:07:45,903 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:07:45,904 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:07:45,904 INFO L82 PathProgramCache]: Analyzing trace with hash 32076982, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:07:45,912 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:07:45,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:07:45,952 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:07:45,992 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:07:45,993 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:07:45,993 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-09 21:07:45,993 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:45,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:07:45,999 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2018-04-09 21:07:46,065 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-09 21:07:46,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-09 21:07:46,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:46,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:07:46,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:07:46,077 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2018-04-09 21:07:46,098 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 46 treesize of output 40 [2018-04-09 21:07:46,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 21:07:46,101 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:46,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:07:46,115 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-09 21:07:46,115 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:48 [2018-04-09 21:07:46,140 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-09 21:07:46,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-09 21:07:46,142 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:46,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2018-04-09 21:07:46,179 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:46,195 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:07:46,202 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-09 21:07:46,202 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:57, output treesize:4 [2018-04-09 21:07:46,238 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:07:46,238 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:07:46,268 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2018-04-09 21:07:46,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 10 [2018-04-09 21:07:46,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:46,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2018-04-09 21:07:46,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2018-04-09 21:07:46,312 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:46,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2018-04-09 21:07:46,324 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:46,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2018-04-09 21:07:46,339 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-09 21:07:46,350 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-09 21:07:46,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2018-04-09 21:07:46,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 23 treesize of output 15 [2018-04-09 21:07:46,358 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:46,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-04-09 21:07:46,369 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:46,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 16 [2018-04-09 21:07:46,384 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-04-09 21:07:46,394 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-09 21:07:46,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2018-04-09 21:07:46,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 1 [2018-04-09 21:07:46,397 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:46,401 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:07:46,427 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-04-09 21:07:46,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-04-09 21:07:46,450 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 1 variables, input treesize:40, output treesize:58 [2018-04-09 21:07:46,984 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:07:47,005 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:07:47,005 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 24 [2018-04-09 21:07:47,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-09 21:07:47,005 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-09 21:07:47,006 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2018-04-09 21:07:47,006 INFO L87 Difference]: Start difference. First operand 344 states and 377 transitions. Second operand 24 states. [2018-04-09 21:07:48,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:07:48,192 INFO L93 Difference]: Finished difference Result 503 states and 545 transitions. [2018-04-09 21:07:48,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-09 21:07:48,192 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 71 [2018-04-09 21:07:48,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:07:48,194 INFO L225 Difference]: With dead ends: 503 [2018-04-09 21:07:48,194 INFO L226 Difference]: Without dead ends: 500 [2018-04-09 21:07:48,194 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 122 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=408, Invalid=1572, Unknown=0, NotChecked=0, Total=1980 [2018-04-09 21:07:48,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2018-04-09 21:07:48,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 454. [2018-04-09 21:07:48,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2018-04-09 21:07:48,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 504 transitions. [2018-04-09 21:07:48,230 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 504 transitions. Word has length 71 [2018-04-09 21:07:48,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:07:48,230 INFO L459 AbstractCegarLoop]: Abstraction has 454 states and 504 transitions. [2018-04-09 21:07:48,231 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-09 21:07:48,231 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 504 transitions. [2018-04-09 21:07:48,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-04-09 21:07:48,231 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:07:48,231 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:07:48,231 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:07:48,231 INFO L82 PathProgramCache]: Analyzing trace with hash 32077528, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:07:48,237 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:07:48,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:07:48,260 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:07:48,293 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:07:48,294 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:07:48,294 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-09 21:07:48,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:48,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:07:48,299 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2018-04-09 21:07:48,332 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-09 21:07:48,334 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-09 21:07:48,334 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:48,335 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:07:48,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:07:48,342 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-04-09 21:07:48,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2018-04-09 21:07:48,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 21:07:48,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:48,366 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:07:48,372 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-09 21:07:48,372 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:43 [2018-04-09 21:07:48,413 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-09 21:07:48,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-09 21:07:48,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:48,419 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-09 21:07:48,419 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:48,421 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:07:48,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:07:48,425 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:52, output treesize:10 [2018-04-09 21:07:48,451 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:07:48,451 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-09 21:07:48,451 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:48,455 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-09 21:07:48,455 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-04-09 21:07:48,482 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:07:48,482 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:07:48,579 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2018-04-09 21:07:48,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 21:07:48,593 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:48,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 26 [2018-04-09 21:07:48,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-04-09 21:07:48,611 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-09 21:07:48,623 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 18 [2018-04-09 21:07:48,624 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-09 21:07:48,634 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2018-04-09 21:07:48,634 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:48,641 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-09 21:07:48,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-04-09 21:07:48,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2018-04-09 21:07:48,644 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:48,647 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:07:48,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 10 xjuncts. [2018-04-09 21:07:48,713 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2018-04-09 21:07:48,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 21:07:48,728 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:48,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2018-04-09 21:07:48,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2018-04-09 21:07:48,746 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:48,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2018-04-09 21:07:48,756 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:48,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2018-04-09 21:07:48,769 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-04-09 21:07:48,778 INFO L267 ElimStorePlain]: Start of recursive call 12: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-09 21:07:48,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2018-04-09 21:07:48,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-09 21:07:48,784 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:48,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-04-09 21:07:48,793 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:48,802 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:07:48,802 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:07:48,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-04-09 21:07:48,803 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:48,808 INFO L267 ElimStorePlain]: Start of recursive call 16: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:07:48,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2018-04-09 21:07:48,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 1 [2018-04-09 21:07:48,811 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:48,814 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:07:48,829 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-09 21:07:48,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 11 xjuncts. [2018-04-09 21:07:48,873 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 4 variables, input treesize:82, output treesize:110 [2018-04-09 21:07:48,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 4 [2018-04-09 21:07:48,914 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:48,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 3 [2018-04-09 21:07:48,921 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:48,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 3 [2018-04-09 21:07:48,927 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:48,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-09 21:07:48,930 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:32, output treesize:11 [2018-04-09 21:07:49,064 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:07:49,085 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:07:49,085 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 27 [2018-04-09 21:07:49,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-09 21:07:49,086 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-09 21:07:49,086 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2018-04-09 21:07:49,086 INFO L87 Difference]: Start difference. First operand 454 states and 504 transitions. Second operand 28 states. [2018-04-09 21:07:50,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:07:50,397 INFO L93 Difference]: Finished difference Result 498 states and 544 transitions. [2018-04-09 21:07:50,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-09 21:07:50,397 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 71 [2018-04-09 21:07:50,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:07:50,399 INFO L225 Difference]: With dead ends: 498 [2018-04-09 21:07:50,399 INFO L226 Difference]: Without dead ends: 497 [2018-04-09 21:07:50,399 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 119 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=453, Invalid=1997, Unknown=0, NotChecked=0, Total=2450 [2018-04-09 21:07:50,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2018-04-09 21:07:50,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 459. [2018-04-09 21:07:50,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2018-04-09 21:07:50,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 510 transitions. [2018-04-09 21:07:50,430 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 510 transitions. Word has length 71 [2018-04-09 21:07:50,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:07:50,430 INFO L459 AbstractCegarLoop]: Abstraction has 459 states and 510 transitions. [2018-04-09 21:07:50,430 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-09 21:07:50,430 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 510 transitions. [2018-04-09 21:07:50,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-04-09 21:07:50,431 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:07:50,431 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:07:50,431 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:07:50,432 INFO L82 PathProgramCache]: Analyzing trace with hash 32077529, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:07:50,442 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:07:50,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:07:50,468 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:07:50,501 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:07:50,502 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:07:50,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-09 21:07:50,502 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:50,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:07:50,508 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2018-04-09 21:07:50,569 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-09 21:07:50,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 21:07:50,571 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:50,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:07:50,588 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-09 21:07:50,590 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-09 21:07:50,590 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:50,591 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:07:50,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:07:50,603 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:56, output treesize:48 [2018-04-09 21:07:50,630 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 100 treesize of output 101 [2018-04-09 21:07:50,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-09 21:07:50,632 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:50,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:07:50,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 82 treesize of output 76 [2018-04-09 21:07:50,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-09 21:07:50,657 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:50,662 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:07:50,673 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:07:50,673 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:116, output treesize:96 [2018-04-09 21:07:50,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 65 [2018-04-09 21:07:50,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 13 treesize of output 1 [2018-04-09 21:07:50,704 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:50,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 33 [2018-04-09 21:07:50,711 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:50,715 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:07:50,726 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 48 [2018-04-09 21:07:50,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-09 21:07:50,728 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:50,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 14 [2018-04-09 21:07:50,734 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:50,738 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:07:50,744 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-09 21:07:50,744 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:114, output treesize:14 [2018-04-09 21:07:50,783 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:07:50,783 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:07:50,856 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 71 [2018-04-09 21:07:50,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 10 [2018-04-09 21:07:50,875 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:50,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 64 [2018-04-09 21:07:50,905 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 56 treesize of output 56 [2018-04-09 21:07:50,906 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-09 21:07:50,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 51 [2018-04-09 21:07:50,921 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:50,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2018-04-09 21:07:50,935 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-09 21:07:50,947 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-09 21:07:50,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-04-09 21:07:50,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 1 [2018-04-09 21:07:50,950 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:50,953 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:07:50,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 10 xjuncts. [2018-04-09 21:07:51,054 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 33 [2018-04-09 21:07:51,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 21:07:51,068 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:51,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 26 [2018-04-09 21:07:51,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-04-09 21:07:51,088 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:51,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 3 [2018-04-09 21:07:51,097 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:51,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, 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 18 [2018-04-09 21:07:51,107 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-04-09 21:07:51,111 INFO L267 ElimStorePlain]: Start of recursive call 12: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-09 21:07:51,112 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2018-04-09 21:07:51,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 8 treesize of output 1 [2018-04-09 21:07:51,114 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:51,116 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:07:51,126 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 9 xjuncts. [2018-04-09 21:07:51,191 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 39 [2018-04-09 21:07:51,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-09 21:07:51,214 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:51,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, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2018-04-09 21:07:51,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-09 21:07:51,231 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:51,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 11 [2018-04-09 21:07:51,240 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:51,251 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 20 treesize of output 20 [2018-04-09 21:07:51,252 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 2 xjuncts. [2018-04-09 21:07:51,257 INFO L267 ElimStorePlain]: Start of recursive call 20: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-09 21:07:51,258 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 17 treesize of output 15 [2018-04-09 21:07:51,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 1 [2018-04-09 21:07:51,260 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:51,262 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:07:51,273 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-04-09 21:07:51,276 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 38 [2018-04-09 21:07:51,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 10 [2018-04-09 21:07:51,294 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:51,304 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 24 treesize of output 28 [2018-04-09 21:07:51,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 23 treesize of output 19 [2018-04-09 21:07:51,308 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:51,322 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 20 treesize of output 20 [2018-04-09 21:07:51,322 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 2 xjuncts. [2018-04-09 21:07:51,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 3 [2018-04-09 21:07:51,330 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:51,334 INFO L267 ElimStorePlain]: Start of recursive call 28: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-09 21:07:51,340 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-09 21:07:51,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 11 xjuncts. [2018-04-09 21:07:51,397 INFO L202 ElimStorePlain]: Needed 31 recursive calls to eliminate 3 variables, input treesize:121, output treesize:135 [2018-04-09 21:07:51,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-04-09 21:07:51,627 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:51,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 20 treesize of output 18 [2018-04-09 21:07:51,671 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:51,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 33 [2018-04-09 21:07:51,717 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-09 21:07:51,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-04-09 21:07:51,764 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:51,860 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 18 treesize of output 16 [2018-04-09 21:07:51,861 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:51,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 13 [2018-04-09 21:07:51,891 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:51,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-09 21:07:51,913 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:180, output treesize:57 [2018-04-09 21:07:52,412 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:07:52,443 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:07:52,443 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 26 [2018-04-09 21:07:52,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-09 21:07:52,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-09 21:07:52,444 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=599, Unknown=0, NotChecked=0, Total=702 [2018-04-09 21:07:52,444 INFO L87 Difference]: Start difference. First operand 459 states and 510 transitions. Second operand 27 states. [2018-04-09 21:07:54,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:07:54,124 INFO L93 Difference]: Finished difference Result 555 states and 605 transitions. [2018-04-09 21:07:54,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-09 21:07:54,124 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 71 [2018-04-09 21:07:54,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:07:54,125 INFO L225 Difference]: With dead ends: 555 [2018-04-09 21:07:54,126 INFO L226 Difference]: Without dead ends: 554 [2018-04-09 21:07:54,126 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 117 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=440, Invalid=1912, Unknown=0, NotChecked=0, Total=2352 [2018-04-09 21:07:54,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-04-09 21:07:54,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 513. [2018-04-09 21:07:54,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-04-09 21:07:54,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 566 transitions. [2018-04-09 21:07:54,158 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 566 transitions. Word has length 71 [2018-04-09 21:07:54,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:07:54,158 INFO L459 AbstractCegarLoop]: Abstraction has 513 states and 566 transitions. [2018-04-09 21:07:54,158 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-09 21:07:54,158 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 566 transitions. [2018-04-09 21:07:54,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-04-09 21:07:54,159 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:07:54,159 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:07:54,159 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:07:54,159 INFO L82 PathProgramCache]: Analyzing trace with hash 287922260, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:07:54,166 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:07:54,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:07:54,189 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:07:54,224 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-09 21:07:54,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 21:07:54,225 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:54,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:07:54,235 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-09 21:07:54,235 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:21 [2018-04-09 21:07:54,269 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 22 treesize of output 16 [2018-04-09 21:07:54,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-04-09 21:07:54,271 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:54,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:07:54,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:07:54,280 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:18 [2018-04-09 21:07:54,335 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:07:54,336 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-09 21:07:54,336 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:54,340 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-09 21:07:54,341 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2018-04-09 21:07:54,364 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:07:54,365 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:07:54,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 1 [2018-04-09 21:07:54,410 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:54,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:07:54,411 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:7 [2018-04-09 21:07:54,499 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:07:54,520 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:07:54,521 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 24 [2018-04-09 21:07:54,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-09 21:07:54,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-09 21:07:54,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2018-04-09 21:07:54,522 INFO L87 Difference]: Start difference. First operand 513 states and 566 transitions. Second operand 25 states. [2018-04-09 21:07:55,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:07:55,951 INFO L93 Difference]: Finished difference Result 774 states and 858 transitions. [2018-04-09 21:07:55,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-09 21:07:55,951 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 71 [2018-04-09 21:07:55,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:07:55,953 INFO L225 Difference]: With dead ends: 774 [2018-04-09 21:07:55,953 INFO L226 Difference]: Without dead ends: 773 [2018-04-09 21:07:55,954 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 118 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 851 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1004, Invalid=3286, Unknown=0, NotChecked=0, Total=4290 [2018-04-09 21:07:55,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2018-04-09 21:07:55,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 521. [2018-04-09 21:07:55,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2018-04-09 21:07:55,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 575 transitions. [2018-04-09 21:07:55,989 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 575 transitions. Word has length 71 [2018-04-09 21:07:55,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:07:55,989 INFO L459 AbstractCegarLoop]: Abstraction has 521 states and 575 transitions. [2018-04-09 21:07:55,989 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-09 21:07:55,989 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 575 transitions. [2018-04-09 21:07:55,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-04-09 21:07:55,990 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:07:55,990 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 21:07:55,990 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:07:55,990 INFO L82 PathProgramCache]: Analyzing trace with hash 287923703, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:07:55,996 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:07:56,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:07:56,021 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:07:56,042 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-09 21:07:56,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 21:07:56,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:56,046 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:07:56,054 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-09 21:07:56,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-09 21:07:56,055 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:56,057 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:07:56,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:07:56,062 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-04-09 21:07:56,072 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-09 21:07:56,074 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:07:56,074 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-09 21:07:56,074 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:56,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:07:56,088 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-09 21:07:56,090 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:07:56,090 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-09 21:07:56,091 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:56,094 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:07:56,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:07:56,101 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-04-09 21:07:56,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 40 [2018-04-09 21:07:56,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2018-04-09 21:07:56,170 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:56,185 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:07:56,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 40 [2018-04-09 21:07:56,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2018-04-09 21:07:56,214 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:56,235 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:07:56,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:07:56,247 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:75, output treesize:67 [2018-04-09 21:07:56,297 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:07:56,311 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 4 case distinctions, treesize of input 49 treesize of output 66 [2018-04-09 21:07:56,314 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:07:56,316 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:07:56,317 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 51 treesize of output 77 [2018-04-09 21:07:56,317 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:56,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:07:56,359 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:07:56,374 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 4 case distinctions, treesize of input 90 treesize of output 87 [2018-04-09 21:07:56,377 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:07:56,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 0 new quantified variables, introduced 4 case distinctions, treesize of input 84 treesize of output 114 [2018-04-09 21:07:56,392 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-04-09 21:07:56,471 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-09 21:07:56,510 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 3 xjuncts. [2018-04-09 21:07:56,511 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:109, output treesize:264 [2018-04-09 21:07:56,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 105 treesize of output 103 [2018-04-09 21:07:56,594 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:07:56,595 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 98 treesize of output 111 [2018-04-09 21:07:56,595 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:56,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:07:56,786 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 101 treesize of output 113 [2018-04-09 21:07:56,789 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:07:56,789 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 112 treesize of output 141 [2018-04-09 21:07:56,789 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:56,818 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:07:56,932 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 105 treesize of output 103 [2018-04-09 21:07:56,935 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:07:56,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 111 [2018-04-09 21:07:56,935 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:56,965 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:07:57,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 101 [2018-04-09 21:07:57,071 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:07:57,071 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 100 treesize of output 111 [2018-04-09 21:07:57,071 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:57,113 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:07:57,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 131 treesize of output 123 [2018-04-09 21:07:57,213 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:07:57,213 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 120 treesize of output 137 [2018-04-09 21:07:57,213 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:57,249 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:07:57,331 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 127 treesize of output 133 [2018-04-09 21:07:57,334 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:07:57,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 167 [2018-04-09 21:07:57,335 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:57,370 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:07:57,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 6 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-04-09 21:07:57,429 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:342, output treesize:366 [2018-04-09 21:07:57,515 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:07:57,525 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 119 treesize of output 120 [2018-04-09 21:07:57,528 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:07:57,529 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:07:57,529 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 121 treesize of output 130 [2018-04-09 21:07:57,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:57,589 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:07:57,797 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:07:57,807 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 4 case distinctions, treesize of input 170 treesize of output 161 [2018-04-09 21:07:57,810 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:07:57,811 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 178 treesize of output 195 [2018-04-09 21:07:57,811 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:57,867 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:07:58,019 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:07:58,027 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 4 case distinctions, treesize of input 208 treesize of output 163 [2018-04-09 21:07:58,031 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:07:58,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 97 [2018-04-09 21:07:58,035 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:58,060 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:07:58,171 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 159 treesize of output 124 [2018-04-09 21:07:58,174 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:07:58,175 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:07:58,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 183 [2018-04-09 21:07:58,176 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:58,216 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-09 21:07:58,342 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 199 treesize of output 138 [2018-04-09 21:07:58,345 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:07:58,355 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 156 treesize of output 138 [2018-04-09 21:07:58,356 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-04-09 21:07:58,407 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:07:58,525 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:07:58,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 110 treesize of output 101 [2018-04-09 21:07:58,536 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:07:58,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, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 42 [2018-04-09 21:07:58,537 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:58,553 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:07:58,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 6 dim-2 vars, End of recursive call: 9 dim-0 vars, and 5 xjuncts. [2018-04-09 21:07:58,651 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 11 variables, input treesize:498, output treesize:603 [2018-04-09 21:07:59,128 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:07:59,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 131 [2018-04-09 21:07:59,132 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:07:59,132 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:07:59,134 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:07:59,143 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 54 treesize of output 79 [2018-04-09 21:07:59,144 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-09 21:07:59,174 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:07:59,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 64 [2018-04-09 21:07:59,175 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-09 21:07:59,188 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-09 21:07:59,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 57 [2018-04-09 21:07:59,229 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:07:59,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 19 [2018-04-09 21:07:59,230 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:59,242 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:07:59,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-09 21:07:59,243 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:59,250 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:07:59,281 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:07:59,281 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:07:59,282 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:07:59,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 126 [2018-04-09 21:07:59,285 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:07:59,286 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:07:59,287 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:07:59,292 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 84 [2018-04-09 21:07:59,293 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-09 21:07:59,325 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 65 treesize of output 56 [2018-04-09 21:07:59,326 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:59,340 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:07:59,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 55 [2018-04-09 21:07:59,367 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:07:59,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2018-04-09 21:07:59,368 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:59,380 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:07:59,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-04-09 21:07:59,381 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-09 21:07:59,388 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:07:59,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:07:59,405 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:304, output treesize:13 [2018-04-09 21:07:59,490 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:07:59,490 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:07:59,954 WARN L148 SmtUtils]: Spent 187ms on a formula simplification that was a NOOP. DAG size: 33 [2018-04-09 21:08:06,099 WARN L148 SmtUtils]: Spent 6049ms on a formula simplification that was a NOOP. DAG size: 45 [2018-04-09 21:08:10,665 WARN L148 SmtUtils]: Spent 4097ms on a formula simplification that was a NOOP. DAG size: 47 [2018-04-09 21:08:10,988 WARN L148 SmtUtils]: Spent 227ms on a formula simplification that was a NOOP. DAG size: 52 [2018-04-09 21:08:11,033 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:08:11,054 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:08:11,054 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 35 [2018-04-09 21:08:11,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-09 21:08:11,055 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-09 21:08:11,055 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1044, Unknown=1, NotChecked=0, Total=1190 [2018-04-09 21:08:11,056 INFO L87 Difference]: Start difference. First operand 521 states and 575 transitions. Second operand 35 states. [2018-04-09 21:08:17,266 WARN L151 SmtUtils]: Spent 1617ms on a formula simplification. DAG size of input: 69 DAG size of output 57 [2018-04-09 21:08:24,889 WARN L148 SmtUtils]: Spent 5028ms on a formula simplification that was a NOOP. DAG size: 93 [2018-04-09 21:08:27,423 WARN L148 SmtUtils]: Spent 123ms on a formula simplification that was a NOOP. DAG size: 145 [2018-04-09 21:08:29,985 WARN L151 SmtUtils]: Spent 178ms on a formula simplification. DAG size of input: 118 DAG size of output 116 [2018-04-09 21:08:30,528 WARN L151 SmtUtils]: Spent 160ms on a formula simplification. DAG size of input: 117 DAG size of output 117 [2018-04-09 21:08:30,723 WARN L151 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 113 DAG size of output 112 [2018-04-09 21:08:32,980 WARN L151 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 109 DAG size of output 108 [2018-04-09 21:08:33,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:08:33,273 INFO L93 Difference]: Finished difference Result 826 states and 913 transitions. [2018-04-09 21:08:33,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-09 21:08:33,274 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 71 [2018-04-09 21:08:33,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:08:33,276 INFO L225 Difference]: With dead ends: 826 [2018-04-09 21:08:33,276 INFO L226 Difference]: Without dead ends: 779 [2018-04-09 21:08:33,277 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 107 SyntacticMatches, 5 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1108 ImplicationChecksByTransitivity, 21.3s TimeCoverageRelationStatistics Valid=585, Invalid=3574, Unknown=1, NotChecked=0, Total=4160 [2018-04-09 21:08:33,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2018-04-09 21:08:33,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 564. [2018-04-09 21:08:33,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2018-04-09 21:08:33,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 620 transitions. [2018-04-09 21:08:33,335 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 620 transitions. Word has length 71 [2018-04-09 21:08:33,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:08:33,336 INFO L459 AbstractCegarLoop]: Abstraction has 564 states and 620 transitions. [2018-04-09 21:08:33,336 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-09 21:08:33,336 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 620 transitions. [2018-04-09 21:08:33,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-09 21:08:33,337 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:08:33,337 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-04-09 21:08:33,337 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:08:33,338 INFO L82 PathProgramCache]: Analyzing trace with hash 2138989318, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:08:33,343 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:08:33,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:08:33,367 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:08:33,376 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-04-09 21:08:33,376 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:08:33,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 7 [2018-04-09 21:08:33,378 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:08:33,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:08:33,379 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2018-04-09 21:08:33,382 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-04-09 21:08:33,403 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-09 21:08:33,403 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-09 21:08:33,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-09 21:08:33,404 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-09 21:08:33,404 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-09 21:08:33,404 INFO L87 Difference]: Start difference. First operand 564 states and 620 transitions. Second operand 4 states. [2018-04-09 21:08:33,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:08:33,489 INFO L93 Difference]: Finished difference Result 596 states and 658 transitions. [2018-04-09 21:08:33,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-09 21:08:33,490 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2018-04-09 21:08:33,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:08:33,492 INFO L225 Difference]: With dead ends: 596 [2018-04-09 21:08:33,493 INFO L226 Difference]: Without dead ends: 595 [2018-04-09 21:08:33,493 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 145 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-09 21:08:33,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2018-04-09 21:08:33,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 563. [2018-04-09 21:08:33,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2018-04-09 21:08:33,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 619 transitions. [2018-04-09 21:08:33,534 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 619 transitions. Word has length 74 [2018-04-09 21:08:33,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:08:33,534 INFO L459 AbstractCegarLoop]: Abstraction has 563 states and 619 transitions. [2018-04-09 21:08:33,534 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-09 21:08:33,534 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 619 transitions. [2018-04-09 21:08:33,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-09 21:08:33,535 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:08:33,535 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-04-09 21:08:33,535 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:08:33,535 INFO L82 PathProgramCache]: Analyzing trace with hash 2138989319, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:08:33,541 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:08:33,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:08:33,573 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:08:33,598 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-09 21:08:33,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-09 21:08:33,599 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:08:33,600 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:08:33,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:08:33,604 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-04-09 21:08:33,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-04-09 21:08:33,614 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:33,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-09 21:08:33,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:08:33,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:08:33,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:08:33,623 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-04-09 21:08:33,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-04-09 21:08:33,635 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:33,635 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:33,636 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:33,636 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:08:33,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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 55 [2018-04-09 21:08:33,637 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:08:33,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:08:33,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:08:33,650 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-04-09 21:08:33,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2018-04-09 21:08:33,665 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:33,666 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:33,667 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:33,667 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:33,668 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:33,668 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:33,668 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:08:33,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 92 [2018-04-09 21:08:33,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:08:33,680 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:08:33,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:08:33,688 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:52 [2018-04-09 21:08:33,736 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:33,736 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:33,737 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-09 21:08:33,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:08:33,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:08:33,747 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:63, output treesize:57 [2018-04-09 21:08:33,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 55 [2018-04-09 21:08:33,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 21:08:33,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:08:33,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:08:33,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:08:33,813 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:70, output treesize:66 [2018-04-09 21:08:33,840 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 63 treesize of output 62 [2018-04-09 21:08:33,842 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:33,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-09 21:08:33,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:08:33,852 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:08:33,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:08:33,866 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:79, output treesize:75 [2018-04-09 21:08:33,897 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 70 treesize of output 67 [2018-04-09 21:08:33,899 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:33,900 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:33,900 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:33,901 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:08:33,901 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 55 [2018-04-09 21:08:33,901 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:08:33,916 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:08:33,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:08:33,932 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:89, output treesize:85 [2018-04-09 21:08:33,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 74 [2018-04-09 21:08:33,972 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:33,973 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:33,974 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:33,974 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:33,975 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:33,976 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:33,976 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:08:33,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 92 [2018-04-09 21:08:33,977 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:08:33,996 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:08:34,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:08:34,014 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:98, output treesize:100 [2018-04-09 21:08:34,055 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 94 treesize of output 85 [2018-04-09 21:08:34,057 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:34,058 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:34,059 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:34,060 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:34,060 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:34,062 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:34,063 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:08:34,064 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:08:34,064 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 0 case distinctions, treesize of input 41 treesize of output 92 [2018-04-09 21:08:34,065 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:08:34,084 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:08:34,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:08:34,103 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:110, output treesize:100 [2018-04-09 21:08:34,152 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 184 treesize of output 175 [2018-04-09 21:08:34,155 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:34,156 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:34,157 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:34,158 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:34,158 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:34,159 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:34,160 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:08:34,164 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 0 case distinctions, treesize of input 89 treesize of output 221 [2018-04-09 21:08:34,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:08:34,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:08:34,210 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-09 21:08:34,210 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:194, output treesize:172 [2018-04-09 21:08:34,251 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 171 treesize of output 127 [2018-04-09 21:08:34,254 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:34,255 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:34,255 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:34,258 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:34,259 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:34,259 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:34,260 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:08:34,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 77 [2018-04-09 21:08:34,261 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:08:34,274 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:34,274 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:34,275 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:34,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-09 21:08:34,275 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 21:08:34,279 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:08:34,284 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-09 21:08:34,284 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:181, output treesize:7 [2018-04-09 21:08:34,368 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 11 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:08:34,368 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:08:34,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 12 treesize of output 10 [2018-04-09 21:08:34,388 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-09 21:08:34,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2018-04-09 21:08:34,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 21:08:34,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-09 21:08:34,400 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:12 [2018-04-09 21:08:35,551 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-04-09 21:08:35,551 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 7 variables, input treesize:237, output treesize:1 [2018-04-09 21:08:35,571 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 11 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-09 21:08:35,593 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:08:35,593 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 15] total 35 [2018-04-09 21:08:35,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-09 21:08:35,593 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-09 21:08:35,593 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1048, Unknown=0, NotChecked=0, Total=1260 [2018-04-09 21:08:35,594 INFO L87 Difference]: Start difference. First operand 563 states and 619 transitions. Second operand 36 states. [2018-04-09 21:08:36,984 WARN L151 SmtUtils]: Spent 154ms on a formula simplification. DAG size of input: 98 DAG size of output 77 [2018-04-09 21:08:37,148 WARN L151 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 80 DAG size of output 69 [2018-04-09 21:08:37,839 WARN L151 SmtUtils]: Spent 149ms on a formula simplification. DAG size of input: 84 DAG size of output 73 [2018-04-09 21:08:38,284 WARN L151 SmtUtils]: Spent 248ms on a formula simplification. DAG size of input: 93 DAG size of output 80 [2018-04-09 21:08:38,609 WARN L151 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 85 DAG size of output 74 [2018-04-09 21:08:38,835 WARN L151 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 87 DAG size of output 76 [2018-04-09 21:08:39,415 WARN L151 SmtUtils]: Spent 145ms on a formula simplification. DAG size of input: 95 DAG size of output 41 [2018-04-09 21:08:41,493 WARN L151 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 102 DAG size of output 48 [2018-04-09 21:08:42,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:08:42,648 INFO L93 Difference]: Finished difference Result 1014 states and 1119 transitions. [2018-04-09 21:08:42,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-04-09 21:08:42,648 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 74 [2018-04-09 21:08:42,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:08:42,651 INFO L225 Difference]: With dead ends: 1014 [2018-04-09 21:08:42,651 INFO L226 Difference]: Without dead ends: 1012 [2018-04-09 21:08:42,653 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 117 SyntacticMatches, 4 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2999 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=1812, Invalid=8490, Unknown=0, NotChecked=0, Total=10302 [2018-04-09 21:08:42,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2018-04-09 21:08:42,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 638. [2018-04-09 21:08:42,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2018-04-09 21:08:42,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 708 transitions. [2018-04-09 21:08:42,705 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 708 transitions. Word has length 74 [2018-04-09 21:08:42,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:08:42,706 INFO L459 AbstractCegarLoop]: Abstraction has 638 states and 708 transitions. [2018-04-09 21:08:42,706 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-09 21:08:42,706 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 708 transitions. [2018-04-09 21:08:42,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-04-09 21:08:42,706 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:08:42,706 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:08:42,706 INFO L408 AbstractCegarLoop]: === Iteration 40 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:08:42,707 INFO L82 PathProgramCache]: Analyzing trace with hash 81840047, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:08:42,712 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:08:42,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:08:42,739 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:08:42,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-09 21:08:42,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-09 21:08:42,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:08:42,822 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:08:42,835 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-09 21:08:42,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 8 treesize of output 7 [2018-04-09 21:08:42,836 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:08:42,838 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:08:42,849 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-09 21:08:42,850 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:57, output treesize:51 [2018-04-09 21:08:42,916 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 33 treesize of output 27 [2018-04-09 21:08:42,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 18 [2018-04-09 21:08:42,917 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:08:42,921 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:08:42,932 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 22 treesize of output 16 [2018-04-09 21:08:42,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-04-09 21:08:42,933 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:08:42,936 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:08:42,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:08:42,944 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:65, output treesize:35 [2018-04-09 21:08:43,062 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~z~0.base Int) (main_~x~1.base Int)) (let ((.cse0 (store |c_old(#valid)| main_~x~1.base 1))) (and (= 0 (select .cse0 main_~z~0.base)) (= 0 (select |c_old(#valid)| main_~x~1.base)) (= |c_#valid| (store (store .cse0 main_~z~0.base 0) main_~x~1.base 0))))) is different from true [2018-04-09 21:08:43,088 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-04-09 21:08:43,088 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:08:43,357 WARN L1011 $PredicateComparison]: unable to prove that (and (or (forall ((|v_main_#t~malloc3.base_17| Int)) (or (= (store (store |c_#valid| |v_main_#t~malloc3.base_17| 0) c_main_~x~0.base 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc3.base_17|))))) (< c_main_~x~0.offset 1)) (or (forall ((v_prenex_221 Int)) (or (= |c_old(#valid)| (store (store |c_#valid| v_prenex_221 0) c_main_~x~0.base 0)) (not (= 0 (select |c_#valid| v_prenex_221))))) (< 0 (+ c_main_~x~0.offset 1))) (forall ((v_prenex_220 Int)) (or (= v_prenex_220 c_main_~x~0.base) (not (= 0 (select |c_#valid| v_prenex_220))) (= (store (store |c_#valid| v_prenex_220 0) c_main_~x~0.base 0) |c_old(#valid)|)))) is different from false [2018-04-09 21:08:43,466 WARN L1011 $PredicateComparison]: unable to prove that (forall ((v_prenex_220 Int) (|v_main_#t~malloc1.base_18| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc1.base_18| 1))) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc1.base_18|))) (not (= 0 (select .cse0 v_prenex_220))) (= (store (store .cse0 v_prenex_220 0) |v_main_#t~malloc1.base_18| 0) |c_old(#valid)|) (= v_prenex_220 |v_main_#t~malloc1.base_18|)))) is different from false [2018-04-09 21:08:43,492 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2018-04-09 21:08:43,512 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-09 21:08:43,512 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2018-04-09 21:08:43,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-09 21:08:43,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-09 21:08:43,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=788, Unknown=8, NotChecked=174, Total=1056 [2018-04-09 21:08:43,513 INFO L87 Difference]: Start difference. First operand 638 states and 708 transitions. Second operand 33 states. [2018-04-09 21:08:43,546 WARN L1011 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_220 Int) (|v_main_#t~malloc1.base_18| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc1.base_18| 1))) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc1.base_18|))) (not (= 0 (select .cse0 v_prenex_220))) (= (store (store .cse0 v_prenex_220 0) |v_main_#t~malloc1.base_18| 0) |c_old(#valid)|) (= v_prenex_220 |v_main_#t~malloc1.base_18|)))) (= |c_#valid| |c_old(#valid)|)) is different from false [2018-04-09 21:08:45,508 WARN L151 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 65 DAG size of output 57 [2018-04-09 21:08:45,800 WARN L151 SmtUtils]: Spent 159ms on a formula simplification. DAG size of input: 67 DAG size of output 60 [2018-04-09 21:08:46,009 WARN L151 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 57 DAG size of output 51 [2018-04-09 21:08:46,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-09 21:08:46,383 INFO L93 Difference]: Finished difference Result 760 states and 837 transitions. [2018-04-09 21:08:46,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-09 21:08:46,384 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 76 [2018-04-09 21:08:46,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-09 21:08:46,386 INFO L225 Difference]: With dead ends: 760 [2018-04-09 21:08:46,386 INFO L226 Difference]: Without dead ends: 757 [2018-04-09 21:08:46,386 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=321, Invalid=2331, Unknown=16, NotChecked=412, Total=3080 [2018-04-09 21:08:46,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2018-04-09 21:08:46,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 643. [2018-04-09 21:08:46,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2018-04-09 21:08:46,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 713 transitions. [2018-04-09 21:08:46,444 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 713 transitions. Word has length 76 [2018-04-09 21:08:46,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-09 21:08:46,445 INFO L459 AbstractCegarLoop]: Abstraction has 643 states and 713 transitions. [2018-04-09 21:08:46,445 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-09 21:08:46,445 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 713 transitions. [2018-04-09 21:08:46,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-04-09 21:08:46,445 INFO L347 BasicCegarLoop]: Found error trace [2018-04-09 21:08:46,445 INFO L355 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-09 21:08:46,446 INFO L408 AbstractCegarLoop]: === Iteration 41 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36AssertViolationMEMORY_FREE, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr37AssertViolationMEMORY_FREE, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr35AssertViolationMEMORY_FREE, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr38EnsuresViolationMEMORY_LEAK, mainErr9RequiresViolation, mainErr34AssertViolationMEMORY_FREE, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-04-09 21:08:46,446 INFO L82 PathProgramCache]: Analyzing trace with hash 81840593, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-09 21:08:46,453 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-09 21:08:46,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-09 21:08:46,487 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-09 21:08:46,494 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-09 21:08:46,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-09 21:08:46,495 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:08:46,496 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:08:46,502 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-09 21:08:46,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-09 21:08:46,504 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:08:46,505 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:08:46,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:08:46,509 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-04-09 21:08:46,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-04-09 21:08:46,522 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:46,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-09 21:08:46,522 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:08:46,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:08:46,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-04-09 21:08:46,538 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:46,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-04-09 21:08:46,539 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:08:46,543 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:08:46,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:08:46,550 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2018-04-09 21:08:46,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-04-09 21:08:46,566 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:46,567 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:46,568 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:46,570 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-09 21:08:46,571 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:08:46,584 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:08:46,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2018-04-09 21:08:46,616 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:46,617 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:46,627 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:46,628 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:08:46,629 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 55 [2018-04-09 21:08:46,629 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:08:46,637 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:08:46,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:08:46,647 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:65, output treesize:57 [2018-04-09 21:08:46,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2018-04-09 21:08:46,670 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:46,670 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:46,671 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:46,672 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:46,672 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:46,673 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:46,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 77 [2018-04-09 21:08:46,677 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:08:46,689 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:08:46,707 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 39 treesize of output 30 [2018-04-09 21:08:46,709 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:46,709 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:46,710 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:46,710 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:46,711 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:46,711 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:46,711 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:08:46,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 92 [2018-04-09 21:08:46,712 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:08:46,722 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:08:46,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:08:46,734 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:83, output treesize:81 [2018-04-09 21:08:46,846 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 50 treesize of output 54 [2018-04-09 21:08:46,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 50 [2018-04-09 21:08:46,849 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:08:46,884 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:08:46,919 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 59 treesize of output 61 [2018-04-09 21:08:46,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 59 [2018-04-09 21:08:46,922 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:08:46,953 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:46,954 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:46,955 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:46,955 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:46,956 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:46,957 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:46,957 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:46,958 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:46,958 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:08:46,959 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:08:46,963 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 0 case distinctions, treesize of input 47 treesize of output 125 [2018-04-09 21:08:46,963 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-09 21:08:46,992 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:08:47,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:08:47,023 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:120, output treesize:217 [2018-04-09 21:08:47,199 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:08:47,202 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 145 treesize of output 131 [2018-04-09 21:08:47,205 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:47,206 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:47,207 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:47,209 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:47,210 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:47,212 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:47,213 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:47,214 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:47,215 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:08:47,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 157 [2018-04-09 21:08:47,225 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-09 21:08:47,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:08:47,404 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 127 [2018-04-09 21:08:47,407 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:47,408 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:47,409 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:47,410 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:47,411 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:47,413 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:47,414 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:47,415 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:47,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 170 [2018-04-09 21:08:47,422 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:08:47,455 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:08:47,528 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:08:47,548 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 4 case distinctions, treesize of input 158 treesize of output 167 [2018-04-09 21:08:47,552 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:47,553 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:47,554 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:47,556 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:47,557 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:47,557 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:47,558 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:47,560 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:47,561 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:08:47,561 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:08:47,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 255 [2018-04-09 21:08:47,562 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 21:08:47,720 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:08:47,786 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:08:47,804 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 4 case distinctions, treesize of input 163 treesize of output 150 [2018-04-09 21:08:47,808 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:47,808 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:47,809 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:47,810 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:47,811 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:47,812 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:47,812 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:47,814 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:47,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 153 treesize of output 231 [2018-04-09 21:08:47,830 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-04-09 21:08:48,083 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-09 21:08:48,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-09 21:08:48,204 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:304, output treesize:531 [2018-04-09 21:08:48,354 WARN L148 SmtUtils]: Spent 118ms on a formula simplification that was a NOOP. DAG size: 80 [2018-04-09 21:08:48,379 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 152 treesize of output 140 [2018-04-09 21:08:48,383 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:48,383 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 139 treesize of output 158 [2018-04-09 21:08:48,383 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:08:48,453 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:08:48,894 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 181 treesize of output 175 [2018-04-09 21:08:48,897 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:48,898 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 208 treesize of output 253 [2018-04-09 21:08:48,899 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:08:48,971 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:08:49,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 149 [2018-04-09 21:08:49,313 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:49,314 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 166 treesize of output 183 [2018-04-09 21:08:49,314 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 21:08:49,396 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:08:49,709 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 165 treesize of output 147 [2018-04-09 21:08:49,712 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:49,712 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 152 treesize of output 171 [2018-04-09 21:08:49,713 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-09 21:08:49,755 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:08:50,012 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 231 treesize of output 203 [2018-04-09 21:08:50,015 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:50,015 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 226 treesize of output 273 [2018-04-09 21:08:50,016 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-09 21:08:50,108 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:08:50,331 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:08:50,332 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 136 [2018-04-09 21:08:50,335 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:08:50,336 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:50,337 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:50,339 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:50,341 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:50,343 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:50,344 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:50,345 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:50,346 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:50,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 166 [2018-04-09 21:08:50,355 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-09 21:08:50,409 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:08:50,580 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:08:50,580 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 133 [2018-04-09 21:08:50,583 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:50,584 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:08:50,584 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:50,586 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:50,587 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:50,589 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:50,590 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:50,591 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:50,592 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:50,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 196 [2018-04-09 21:08:50,604 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-09 21:08:50,639 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:08:50,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 148 treesize of output 144 [2018-04-09 21:08:50,806 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:50,815 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:08:50,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 195 [2018-04-09 21:08:50,816 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-09 21:08:50,889 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:08:51,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 8 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-09 21:08:51,028 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 10 variables, input treesize:635, output treesize:731 [2018-04-09 21:08:51,202 WARN L148 SmtUtils]: Spent 127ms on a formula simplification that was a NOOP. DAG size: 106 [2018-04-09 21:08:51,218 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:08:51,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 229 treesize of output 168 [2018-04-09 21:08:51,236 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:51,237 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:51,238 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:51,239 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:51,240 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:51,240 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:08:51,241 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:51,242 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:51,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 142 [2018-04-09 21:08:51,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:08:51,289 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:08:51,720 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 218 treesize of output 157 [2018-04-09 21:08:51,724 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:51,725 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:51,726 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:51,727 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:51,728 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:51,729 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:51,730 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:08:51,731 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:51,732 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:51,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 193 treesize of output 281 [2018-04-09 21:08:51,741 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:08:51,812 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-09 21:08:52,231 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:08:52,242 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 4 case distinctions, treesize of input 209 treesize of output 175 [2018-04-09 21:08:52,245 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:52,246 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:52,246 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:52,247 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:52,247 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:52,248 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:52,248 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 0 case distinctions, treesize of input 180 treesize of output 256 [2018-04-09 21:08:52,249 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 21:08:52,299 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:08:52,625 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 198 treesize of output 143 [2018-04-09 21:08:52,627 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:52,628 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:52,629 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:52,629 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:52,630 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:52,630 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:52,636 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 182 [2018-04-09 21:08:52,636 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-09 21:08:52,665 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:08:52,867 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:08:52,873 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:08:52,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 303 treesize of output 214 [2018-04-09 21:08:52,887 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:52,889 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:52,890 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:52,890 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:52,891 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:52,892 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:52,894 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:52,896 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:52,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 219 [2018-04-09 21:08:52,896 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-09 21:08:52,945 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:08:53,079 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 228 treesize of output 183 [2018-04-09 21:08:53,083 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:53,083 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:53,085 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:53,086 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:53,087 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:53,087 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:53,089 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:53,090 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:53,107 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 183 treesize of output 249 [2018-04-09 21:08:53,108 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-04-09 21:08:53,212 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:08:53,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 8 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-09 21:08:53,484 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 11 variables, input treesize:898, output treesize:578 [2018-04-09 21:08:54,638 WARN L151 SmtUtils]: Spent 1106ms on a formula simplification. DAG size of input: 91 DAG size of output 78 [2018-04-09 21:08:54,988 WARN L148 SmtUtils]: Spent 162ms on a formula simplification that was a NOOP. DAG size: 82 [2018-04-09 21:08:55,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 229 treesize of output 168 [2018-04-09 21:08:55,269 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:55,270 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:55,270 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:08:55,271 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:55,272 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:55,273 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:55,273 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:55,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 160 [2018-04-09 21:08:55,279 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-09 21:08:55,349 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:55,350 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:08:55,351 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:55,352 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:55,353 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:55,353 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:55,354 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:08:55,355 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:55,355 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:55,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 134 [2018-04-09 21:08:55,363 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-09 21:08:55,418 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:55,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 95 [2018-04-09 21:08:55,419 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-09 21:08:55,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:08:55,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 229 treesize of output 191 [2018-04-09 21:08:55,511 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:55,512 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:55,512 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:55,513 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:55,514 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:55,515 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:55,516 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:55,516 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:55,517 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:55,517 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:55,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 198 [2018-04-09 21:08:55,522 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-09 21:08:55,598 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:55,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 116 [2018-04-09 21:08:55,599 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-09 21:08:55,657 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:55,657 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:55,658 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:55,659 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:55,660 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:55,661 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:55,661 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:55,662 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:55,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 143 [2018-04-09 21:08:55,667 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-09 21:08:55,725 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-09 21:08:55,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 77 [2018-04-09 21:08:55,806 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:55,806 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:08:55,807 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 73 treesize of output 65 [2018-04-09 21:08:55,807 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-09 21:08:55,842 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:55,842 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:55,843 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:08:55,843 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:55,844 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:55,845 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:55,845 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:55,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 68 [2018-04-09 21:08:55,846 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-09 21:08:55,890 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:55,891 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:55,891 INFO L682 Elim1Store]: detected equality via solver [2018-04-09 21:08:55,892 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:55,893 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:55,894 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:55,895 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:55,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 64 [2018-04-09 21:08:55,896 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-09 21:08:55,913 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:08:55,970 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 85 treesize of output 67 [2018-04-09 21:08:55,973 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:55,974 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:55,975 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:55,975 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:55,977 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:55,978 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:55,978 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:55,979 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:55,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 68 [2018-04-09 21:08:55,980 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-09 21:08:56,008 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:08:56,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 92 [2018-04-09 21:08:56,018 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:56,018 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:56,019 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:56,019 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:56,020 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:56,022 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:56,022 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:56,023 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:56,023 INFO L700 Elim1Store]: detected not equals via solver [2018-04-09 21:08:56,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 85 [2018-04-09 21:08:56,024 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-09 21:08:56,059 INFO L267 ElimStorePlain]: Start of recursive call 16: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-09 21:08:56,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-09 21:08:56,085 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 6 variables, input treesize:459, output treesize:52 [2018-04-09 21:08:56,243 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-09 21:08:56,243 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-09 21:09:01,859 WARN L148 SmtUtils]: Spent 2545ms on a formula simplification that was a NOOP. DAG size: 68 Received shutdown request... [2018-04-09 21:09:03,981 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-09 21:09:03,981 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-09 21:09:03,986 WARN L197 ceAbstractionStarter]: Timeout [2018-04-09 21:09:03,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.04 09:09:03 BoogieIcfgContainer [2018-04-09 21:09:03,986 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-09 21:09:03,987 INFO L168 Benchmark]: Toolchain (without parser) took 261166.44 ms. Allocated memory was 302.5 MB in the beginning and 516.9 MB in the end (delta: 214.4 MB). Free memory was 240.2 MB in the beginning and 411.3 MB in the end (delta: -171.1 MB). Peak memory consumption was 43.4 MB. Max. memory is 5.3 GB. [2018-04-09 21:09:03,988 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 302.5 MB. Free memory is still 263.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-09 21:09:03,988 INFO L168 Benchmark]: CACSL2BoogieTranslator took 334.68 ms. Allocated memory is still 302.5 MB. Free memory was 240.2 MB in the beginning and 214.2 MB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 5.3 GB. [2018-04-09 21:09:03,989 INFO L168 Benchmark]: Boogie Preprocessor took 67.76 ms. Allocated memory is still 302.5 MB. Free memory was 214.2 MB in the beginning and 212.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-04-09 21:09:03,989 INFO L168 Benchmark]: RCFGBuilder took 622.39 ms. Allocated memory was 302.5 MB in the beginning and 461.9 MB in the end (delta: 159.4 MB). Free memory was 212.2 MB in the beginning and 388.1 MB in the end (delta: -175.9 MB). Peak memory consumption was 19.8 MB. Max. memory is 5.3 GB. [2018-04-09 21:09:03,989 INFO L168 Benchmark]: TraceAbstraction took 260136.85 ms. Allocated memory was 461.9 MB in the beginning and 516.9 MB in the end (delta: 55.1 MB). Free memory was 386.0 MB in the beginning and 411.3 MB in the end (delta: -25.3 MB). Peak memory consumption was 29.7 MB. Max. memory is 5.3 GB. [2018-04-09 21:09:03,991 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.22 ms. Allocated memory is still 302.5 MB. Free memory is still 263.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 334.68 ms. Allocated memory is still 302.5 MB. Free memory was 240.2 MB in the beginning and 214.2 MB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 67.76 ms. Allocated memory is still 302.5 MB. Free memory was 214.2 MB in the beginning and 212.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 622.39 ms. Allocated memory was 302.5 MB in the beginning and 461.9 MB in the end (delta: 159.4 MB). Free memory was 212.2 MB in the beginning and 388.1 MB in the end (delta: -175.9 MB). Peak memory consumption was 19.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 260136.85 ms. Allocated memory was 461.9 MB in the beginning and 516.9 MB in the end (delta: 55.1 MB). Free memory was 386.0 MB in the beginning and 411.3 MB in the end (delta: -25.3 MB). Peak memory consumption was 29.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 639]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 647]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 672]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 672). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 665]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 669]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 659]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 659). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 649]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 651]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 637]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 650]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 666]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 672]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 672). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 665]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 665). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 670]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 670). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 658]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 647]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 649]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 649). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 651]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 651). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 669]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 659]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 659). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 637]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 637). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 620]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 620). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 641]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 670]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 670). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 666]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 666). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 650]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 647]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 658]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 658). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 641]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 641). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 647]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 639]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 639). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 34 known predicates. - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 77 with TraceHistMax 2, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 34 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 113 locations, 39 error locations. TIMEOUT Result, 260.0s OverallTime, 41 OverallIterations, 3 TraceHistogramMax, 166.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3514 SDtfs, 18306 SDslu, 21049 SDs, 0 SdLazy, 17260 SolverSat, 1634 SolverUnsat, 26 SolverUnknown, 0 SolverNotchecked, 46.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4485 GetRequests, 3409 SyntacticMatches, 43 SemanticMatches, 1033 ConstructedPredicates, 7 IntricatePredicates, 1 DeprecatedPredicates, 11232 ImplicationChecksByTransitivity, 170.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=643occurred in iteration=40, 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.7s AutomataMinimizationTime, 40 MinimizatonAttempts, 3527 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 72.8s InterpolantComputationTime, 1948 NumberOfCodeBlocks, 1948 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 3816 ConstructedInterpolants, 338 QuantifiedInterpolants, 5571866 SizeOfPredicates, 391 NumberOfNonLiveVariables, 6760 ConjunctsInSsa, 723 ConjunctsInUnsatCore, 80 InterpolantComputations, 46 PerfectInterpolantSequences, 445/714 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-09_21-09-04-000.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0504_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-09_21-09-04-000.csv Completed graceful shutdown