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/list-ext-properties/test-0513_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-8168ed2-m [2018-04-11 22:11:21,144 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 22:11:21,145 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 22:11:21,159 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 22:11:21,159 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 22:11:21,160 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 22:11:21,161 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 22:11:21,163 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 22:11:21,165 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 22:11:21,166 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 22:11:21,167 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 22:11:21,167 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 22:11:21,168 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 22:11:21,169 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 22:11:21,170 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 22:11:21,172 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 22:11:21,174 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 22:11:21,176 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 22:11:21,178 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 22:11:21,179 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 22:11:21,181 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 22:11:21,182 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 22:11:21,182 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 22:11:21,183 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 22:11:21,184 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 22:11:21,185 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 22:11:21,186 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 22:11:21,186 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 22:11:21,187 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 22:11:21,187 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 22:11:21,188 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 22:11:21,188 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-11 22:11:21,211 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 22:11:21,211 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 22:11:21,211 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-11 22:11:21,212 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-11 22:11:21,212 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-11 22:11:21,213 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-11 22:11:21,213 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-11 22:11:21,213 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-11 22:11:21,213 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-04-11 22:11:21,213 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-11 22:11:21,214 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-11 22:11:21,214 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-11 22:11:21,214 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 22:11:21,214 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 22:11:21,215 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 22:11:21,215 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 22:11:21,215 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 22:11:21,215 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 22:11:21,215 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 22:11:21,215 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-11 22:11:21,215 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 22:11:21,216 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 22:11:21,216 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 22:11:21,216 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-11 22:11:21,216 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-11 22:11:21,216 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 22:11:21,217 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 22:11:21,217 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 22:11:21,217 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 22:11:21,217 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 22:11:21,217 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-11 22:11:21,217 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-11 22:11:21,217 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-11 22:11:21,218 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-11 22:11:21,218 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-11 22:11:21,218 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-11 22:11:21,219 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-11 22:11:21,219 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-11 22:11:21,250 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 22:11:21,260 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 22:11:21,263 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 22:11:21,265 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 22:11:21,265 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 22:11:21,266 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,597 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGfbcc90cfe [2018-04-11 22:11:21,772 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 22:11:21,772 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 22:11:21,773 INFO L168 CDTParser]: Scanning test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,783 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 22:11:21,784 INFO L215 ultiparseSymbolTable]: [2018-04-11 22:11:21,784 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 22:11:21,784 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,784 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 22:11:21,784 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____rlim_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,784 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__key_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,784 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_mutex_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,785 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__caddr_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,785 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__mode_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,785 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____fsfilcnt_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,785 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_mutexattr_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,785 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____u_short in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,785 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__u_int in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,785 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____suseconds_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,785 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____time_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,786 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__int8_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,786 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_rwlock_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,786 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__lldiv_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,786 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__uid_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,786 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____socklen_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,786 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____uint32_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,786 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__ino_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,786 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____mode_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,786 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____fsblkcnt_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,786 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__blksize_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,786 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__int16_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,786 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____fsfilcnt64_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,786 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__div_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,786 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____intptr_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,787 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__time_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,787 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_key_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,787 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__size_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,787 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__off_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,787 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____swblk_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,787 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__register_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,787 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_barrierattr_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,787 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____caddr_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,787 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__u_short in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,787 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__ldiv_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,787 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__ulong in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,787 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____int64_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,787 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__u_quad_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,788 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__gid_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,788 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pid_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,788 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__daddr_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,788 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__fd_set in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,788 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__u_int64_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,788 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_condattr_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,788 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____dev_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,788 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____rlim64_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,788 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____blksize_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,788 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____uint16_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,788 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____qaddr_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,788 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__clock_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,789 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____clock_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,789 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____int8_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,789 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____loff_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,789 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__fsid_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,789 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____blkcnt_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,789 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____sigset_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,789 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__fd_mask in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,789 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_spinlock_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,790 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____WAIT_STATUS in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,790 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__suseconds_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,790 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____daddr_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,790 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__int64_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,790 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____uint8_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,790 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____u_quad_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,790 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____key_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,790 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____ino_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,790 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____pid_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,791 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____ino64_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,791 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__u_long in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,791 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_barrier_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,791 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____quad_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,791 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__loff_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,791 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____fsid_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,791 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__ushort in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,791 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__uint in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,791 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__wchar_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,792 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____useconds_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,792 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__id_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,792 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____clockid_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,792 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____int16_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,792 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____u_long in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,792 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__dev_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,792 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_once_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,792 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____u_int in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,792 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__quad_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,793 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__blkcnt_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,793 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__u_char in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,793 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__u_int16_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,793 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_cond_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,793 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__u_int32_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,793 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____fsblkcnt64_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,793 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__timer_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,793 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____uint64_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,793 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____pthread_list_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,794 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__sigset_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,794 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____off64_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,794 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_attr_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,794 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____blkcnt64_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,794 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_rwlockattr_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,794 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__nlink_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,794 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____u_char in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,794 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____uid_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,794 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__ssize_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,795 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__int32_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,795 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__fsfilcnt_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,795 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____id_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,795 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____ssize_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,795 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____gid_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,795 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____off_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,795 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____sig_atomic_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,796 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____nlink_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,796 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____timer_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,796 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__clockid_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,796 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__fsblkcnt_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,796 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____fd_mask in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,796 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i____int32_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,796 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__pthread_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,796 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_ftest________true_valid_memsafety_i__u_int8_t in test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:21,817 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGfbcc90cfe [2018-04-11 22:11:21,822 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 22:11:21,824 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 22:11:21,825 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 22:11:21,825 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 22:11:21,831 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 22:11:21,832 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 10:11:21" (1/1) ... [2018-04-11 22:11:21,834 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c4ecdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:11:21, skipping insertion in model container [2018-04-11 22:11:21,834 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 10:11:21" (1/1) ... [2018-04-11 22:11:21,848 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 22:11:21,880 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 22:11:22,057 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 22:11:22,108 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 22:11:22,116 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 113 non ball SCCs. Number of states in SCCs 113. [2018-04-11 22:11:22,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:11:22 WrapperNode [2018-04-11 22:11:22,168 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 22:11:22,169 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 22:11:22,169 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 22:11:22,170 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 22:11:22,185 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:11:22" (1/1) ... [2018-04-11 22:11:22,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:11:22" (1/1) ... [2018-04-11 22:11:22,204 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:11:22" (1/1) ... [2018-04-11 22:11:22,204 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:11:22" (1/1) ... [2018-04-11 22:11:22,221 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:11:22" (1/1) ... [2018-04-11 22:11:22,228 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:11:22" (1/1) ... [2018-04-11 22:11:22,231 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:11:22" (1/1) ... [2018-04-11 22:11:22,237 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 22:11:22,237 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 22:11:22,238 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 22:11:22,238 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 22:11:22,239 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:11:22" (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-11 22:11:22,362 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 22:11:22,363 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 22:11:22,363 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 22:11:22,363 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-11 22:11:22,363 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 22:11:22,363 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 22:11:22,363 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 22:11:22,363 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 22:11:22,363 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 22:11:22,363 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 22:11:22,364 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 22:11:22,364 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 22:11:22,364 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 22:11:22,364 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 22:11:22,364 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 22:11:22,364 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 22:11:22,364 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 22:11:22,364 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 22:11:22,364 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 22:11:22,365 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 22:11:22,365 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 22:11:22,365 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 22:11:22,365 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 22:11:22,365 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 22:11:22,365 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 22:11:22,365 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 22:11:22,365 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 22:11:22,365 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 22:11:22,365 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 22:11:22,365 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 22:11:22,366 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 22:11:22,366 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 22:11:22,366 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 22:11:22,366 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 22:11:22,366 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 22:11:22,366 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 22:11:22,366 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 22:11:22,366 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 22:11:22,366 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 22:11:22,366 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 22:11:22,366 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 22:11:22,366 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 22:11:22,367 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 22:11:22,367 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 22:11:22,367 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 22:11:22,367 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 22:11:22,367 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 22:11:22,367 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 22:11:22,367 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 22:11:22,367 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 22:11:22,367 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 22:11:22,367 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 22:11:22,367 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 22:11:22,367 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 22:11:22,368 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 22:11:22,368 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 22:11:22,368 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 22:11:22,368 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 22:11:22,368 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 22:11:22,368 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 22:11:22,368 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 22:11:22,368 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 22:11:22,368 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 22:11:22,368 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 22:11:22,368 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 22:11:22,368 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 22:11:22,368 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 22:11:22,369 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 22:11:22,369 INFO L128 BoogieDeclarations]: Found specification of procedure __secure_getenv [2018-04-11 22:11:22,369 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 22:11:22,369 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 22:11:22,369 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 22:11:22,369 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 22:11:22,369 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 22:11:22,369 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 22:11:22,369 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 22:11:22,369 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 22:11:22,369 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 22:11:22,369 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 22:11:22,369 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 22:11:22,370 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 22:11:22,370 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 22:11:22,370 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 22:11:22,370 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 22:11:22,370 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 22:11:22,370 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 22:11:22,370 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 22:11:22,370 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 22:11:22,370 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 22:11:22,370 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 22:11:22,370 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 22:11:22,370 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 22:11:22,370 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 22:11:22,371 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 22:11:22,371 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 22:11:22,371 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 22:11:22,371 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 22:11:22,371 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 22:11:22,371 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 22:11:22,371 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 22:11:22,371 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 22:11:22,371 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 22:11:22,371 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 22:11:22,371 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 22:11:22,371 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 22:11:22,371 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 22:11:22,372 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 22:11:22,372 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 22:11:22,372 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-11 22:11:22,372 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 22:11:22,372 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-11 22:11:22,372 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 22:11:22,372 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 22:11:22,372 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 22:11:22,372 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 22:11:22,372 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 22:11:22,983 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 22:11:22,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 10:11:22 BoogieIcfgContainer [2018-04-11 22:11:22,984 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 22:11:22,984 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 22:11:22,984 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 22:11:22,987 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 22:11:22,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 10:11:21" (1/3) ... [2018-04-11 22:11:22,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c256b7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 10:11:22, skipping insertion in model container [2018-04-11 22:11:22,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:11:22" (2/3) ... [2018-04-11 22:11:22,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c256b7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 10:11:22, skipping insertion in model container [2018-04-11 22:11:22,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 10:11:22" (3/3) ... [2018-04-11 22:11:22,990 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0513_1_true-valid-memsafety.i [2018-04-11 22:11:22,997 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 22:11:23,003 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 67 error locations. [2018-04-11 22:11:23,044 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 22:11:23,044 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 22:11:23,044 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-11 22:11:23,044 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 22:11:23,044 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 22:11:23,044 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 22:11:23,045 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 22:11:23,045 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 22:11:23,045 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 22:11:23,045 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 22:11:23,064 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states. [2018-04-11 22:11:23,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-11 22:11:23,069 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:11:23,070 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 22:11:23,070 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 22:11:23,073 INFO L82 PathProgramCache]: Analyzing trace with hash -122083506, 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-11 22:11:23,085 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 22:11:23,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:11:23,119 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:11:23,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 22:11:23,139 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 22:11:23,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 22:11:23,187 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 22:11:23,187 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2018-04-11 22:11:23,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-04-11 22:11:23,198 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-04-11 22:11:23,199 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-04-11 22:11:23,201 INFO L87 Difference]: Start difference. First operand 201 states. Second operand 2 states. [2018-04-11 22:11:23,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:11:23,232 INFO L93 Difference]: Finished difference Result 391 states and 429 transitions. [2018-04-11 22:11:23,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-04-11 22:11:23,234 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-04-11 22:11:23,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:11:23,246 INFO L225 Difference]: With dead ends: 391 [2018-04-11 22:11:23,246 INFO L226 Difference]: Without dead ends: 197 [2018-04-11 22:11:23,250 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-04-11 22:11:23,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-04-11 22:11:23,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-04-11 22:11:23,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-04-11 22:11:23,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 211 transitions. [2018-04-11 22:11:23,298 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 211 transitions. Word has length 15 [2018-04-11 22:11:23,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:11:23,299 INFO L459 AbstractCegarLoop]: Abstraction has 197 states and 211 transitions. [2018-04-11 22:11:23,299 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-04-11 22:11:23,299 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 211 transitions. [2018-04-11 22:11:23,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-11 22:11:23,300 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:11:23,300 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 22:11:23,300 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 22:11:23,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1649766350, 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-11 22:11:23,306 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 22:11:23,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:11:23,320 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:11:23,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 22:11:23,329 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 22:11:23,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 22:11:23,368 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 22:11:23,368 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2018-04-11 22:11:23,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 22:11:23,370 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 22:11:23,371 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 22:11:23,371 INFO L87 Difference]: Start difference. First operand 197 states and 211 transitions. Second operand 3 states. [2018-04-11 22:11:23,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:11:23,622 INFO L93 Difference]: Finished difference Result 263 states and 280 transitions. [2018-04-11 22:11:23,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 22:11:23,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-04-11 22:11:23,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:11:23,626 INFO L225 Difference]: With dead ends: 263 [2018-04-11 22:11:23,626 INFO L226 Difference]: Without dead ends: 260 [2018-04-11 22:11:23,628 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 22:11:23,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-04-11 22:11:23,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 206. [2018-04-11 22:11:23,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-04-11 22:11:23,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 222 transitions. [2018-04-11 22:11:23,643 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 222 transitions. Word has length 20 [2018-04-11 22:11:23,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:11:23,643 INFO L459 AbstractCegarLoop]: Abstraction has 206 states and 222 transitions. [2018-04-11 22:11:23,643 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 22:11:23,643 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 222 transitions. [2018-04-11 22:11:23,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-11 22:11:23,644 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:11:23,644 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 22:11:23,645 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 22:11:23,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1649764454, 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-11 22:11:23,651 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 22:11:23,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:11:23,671 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:11:23,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 22:11:23,698 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 22:11:23,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 22:11:23,746 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 22:11:23,747 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-11 22:11:23,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 22:11:23,759 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 22:11:23,759 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 22:11:23,759 INFO L87 Difference]: Start difference. First operand 206 states and 222 transitions. Second operand 3 states. [2018-04-11 22:11:23,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:11:23,823 INFO L93 Difference]: Finished difference Result 420 states and 453 transitions. [2018-04-11 22:11:23,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 22:11:23,824 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-04-11 22:11:23,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:11:23,825 INFO L225 Difference]: With dead ends: 420 [2018-04-11 22:11:23,825 INFO L226 Difference]: Without dead ends: 231 [2018-04-11 22:11:23,827 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 22:11:23,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-04-11 22:11:23,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 221. [2018-04-11 22:11:23,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-04-11 22:11:23,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 247 transitions. [2018-04-11 22:11:23,842 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 247 transitions. Word has length 20 [2018-04-11 22:11:23,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:11:23,842 INFO L459 AbstractCegarLoop]: Abstraction has 221 states and 247 transitions. [2018-04-11 22:11:23,842 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 22:11:23,842 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 247 transitions. [2018-04-11 22:11:23,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-11 22:11:23,843 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:11:23,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] [2018-04-11 22:11:23,843 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 22:11:23,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1825600628, 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-11 22:11:23,850 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 22:11:23,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:11:23,864 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:11:23,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 22:11:23,871 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 22:11:23,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 22:11:23,911 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 22:11:23,911 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-11 22:11:23,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 22:11:23,912 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 22:11:23,912 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 22:11:23,912 INFO L87 Difference]: Start difference. First operand 221 states and 247 transitions. Second operand 3 states. [2018-04-11 22:11:23,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:11:23,931 INFO L93 Difference]: Finished difference Result 427 states and 479 transitions. [2018-04-11 22:11:23,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 22:11:23,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-04-11 22:11:23,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:11:23,934 INFO L225 Difference]: With dead ends: 427 [2018-04-11 22:11:23,934 INFO L226 Difference]: Without dead ends: 222 [2018-04-11 22:11:23,935 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 22:11:23,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-04-11 22:11:23,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2018-04-11 22:11:23,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-04-11 22:11:23,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 247 transitions. [2018-04-11 22:11:23,946 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 247 transitions. Word has length 24 [2018-04-11 22:11:23,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:11:23,946 INFO L459 AbstractCegarLoop]: Abstraction has 222 states and 247 transitions. [2018-04-11 22:11:23,946 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 22:11:23,947 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 247 transitions. [2018-04-11 22:11:23,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-11 22:11:23,947 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:11:23,948 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 22:11:23,948 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 22:11:23,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1027262167, 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-11 22:11:23,963 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 22:11:23,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:11:23,984 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:11:24,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 22:11:24,015 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:24,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:24,018 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 22:11:24,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 22:11:24,044 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 22:11:24,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 22:11:24,083 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 22:11:24,083 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-11 22:11:24,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 22:11:24,083 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 22:11:24,083 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 22:11:24,084 INFO L87 Difference]: Start difference. First operand 222 states and 247 transitions. Second operand 4 states. [2018-04-11 22:11:24,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:11:24,345 INFO L93 Difference]: Finished difference Result 313 states and 342 transitions. [2018-04-11 22:11:24,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 22:11:24,346 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-04-11 22:11:24,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:11:24,348 INFO L225 Difference]: With dead ends: 313 [2018-04-11 22:11:24,348 INFO L226 Difference]: Without dead ends: 307 [2018-04-11 22:11:24,348 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 22:11:24,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-04-11 22:11:24,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 223. [2018-04-11 22:11:24,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-04-11 22:11:24,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 248 transitions. [2018-04-11 22:11:24,358 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 248 transitions. Word has length 26 [2018-04-11 22:11:24,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:11:24,359 INFO L459 AbstractCegarLoop]: Abstraction has 223 states and 248 transitions. [2018-04-11 22:11:24,359 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 22:11:24,359 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 248 transitions. [2018-04-11 22:11:24,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-11 22:11:24,359 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:11:24,360 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 22:11:24,360 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 22:11:24,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1027262166, 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-11 22:11:24,369 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 22:11:24,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:11:24,387 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:11:24,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 22:11:24,395 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:24,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:24,400 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 22:11:24,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 22:11:24,414 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 22:11:24,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 22:11:24,477 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 22:11:24,477 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-11 22:11:24,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 22:11:24,478 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 22:11:24,478 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-11 22:11:24,478 INFO L87 Difference]: Start difference. First operand 223 states and 248 transitions. Second operand 6 states. [2018-04-11 22:11:24,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:11:24,787 INFO L93 Difference]: Finished difference Result 223 states and 248 transitions. [2018-04-11 22:11:24,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 22:11:24,787 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-04-11 22:11:24,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:11:24,788 INFO L225 Difference]: With dead ends: 223 [2018-04-11 22:11:24,788 INFO L226 Difference]: Without dead ends: 219 [2018-04-11 22:11:24,789 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-04-11 22:11:24,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-04-11 22:11:24,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-04-11 22:11:24,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-04-11 22:11:24,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 240 transitions. [2018-04-11 22:11:24,797 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 240 transitions. Word has length 26 [2018-04-11 22:11:24,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:11:24,798 INFO L459 AbstractCegarLoop]: Abstraction has 219 states and 240 transitions. [2018-04-11 22:11:24,798 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 22:11:24,798 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 240 transitions. [2018-04-11 22:11:24,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 22:11:24,799 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:11:24,799 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-11 22:11:24,799 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 22:11:24,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1162426777, 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-11 22:11:24,805 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 22:11:24,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:11:24,822 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:11:24,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 22:11:24,836 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 22:11:24,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 22:11:24,888 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 22:11:24,888 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2018-04-11 22:11:24,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 22:11:24,889 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 22:11:24,889 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-04-11 22:11:24,889 INFO L87 Difference]: Start difference. First operand 219 states and 240 transitions. Second operand 8 states. [2018-04-11 22:11:25,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:11:25,037 INFO L93 Difference]: Finished difference Result 943 states and 1035 transitions. [2018-04-11 22:11:25,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 22:11:25,037 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-04-11 22:11:25,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:11:25,041 INFO L225 Difference]: With dead ends: 943 [2018-04-11 22:11:25,041 INFO L226 Difference]: Without dead ends: 752 [2018-04-11 22:11:25,043 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2018-04-11 22:11:25,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2018-04-11 22:11:25,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 252. [2018-04-11 22:11:25,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-04-11 22:11:25,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 285 transitions. [2018-04-11 22:11:25,066 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 285 transitions. Word has length 33 [2018-04-11 22:11:25,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:11:25,068 INFO L459 AbstractCegarLoop]: Abstraction has 252 states and 285 transitions. [2018-04-11 22:11:25,068 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 22:11:25,068 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 285 transitions. [2018-04-11 22:11:25,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-11 22:11:25,069 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:11:25,069 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 22:11:25,069 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 22:11:25,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1062529458, 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-11 22:11:25,081 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 22:11:25,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:11:25,095 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:11:25,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 22:11:25,101 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:25,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:25,103 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 22:11:25,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 22:11:25,109 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 22:11:25,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 22:11:25,139 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 22:11:25,139 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-11 22:11:25,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 22:11:25,140 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 22:11:25,140 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 22:11:25,140 INFO L87 Difference]: Start difference. First operand 252 states and 285 transitions. Second operand 4 states. [2018-04-11 22:11:25,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:11:25,298 INFO L93 Difference]: Finished difference Result 301 states and 335 transitions. [2018-04-11 22:11:25,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 22:11:25,298 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-04-11 22:11:25,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:11:25,299 INFO L225 Difference]: With dead ends: 301 [2018-04-11 22:11:25,299 INFO L226 Difference]: Without dead ends: 297 [2018-04-11 22:11:25,300 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 22:11:25,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-04-11 22:11:25,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 248. [2018-04-11 22:11:25,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-04-11 22:11:25,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 278 transitions. [2018-04-11 22:11:25,307 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 278 transitions. Word has length 36 [2018-04-11 22:11:25,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:11:25,307 INFO L459 AbstractCegarLoop]: Abstraction has 248 states and 278 transitions. [2018-04-11 22:11:25,307 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 22:11:25,307 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 278 transitions. [2018-04-11 22:11:25,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-11 22:11:25,308 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:11:25,308 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 22:11:25,308 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 22:11:25,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1062529457, 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-11 22:11:25,316 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 22:11:25,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:11:25,336 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:11:25,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 22:11:25,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:25,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:25,346 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 22:11:25,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 22:11:25,354 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 22:11:25,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 22:11:25,390 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 22:11:25,390 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2018-04-11 22:11:25,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 22:11:25,390 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 22:11:25,390 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-11 22:11:25,391 INFO L87 Difference]: Start difference. First operand 248 states and 278 transitions. Second operand 6 states. [2018-04-11 22:11:25,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:11:25,534 INFO L93 Difference]: Finished difference Result 315 states and 348 transitions. [2018-04-11 22:11:25,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 22:11:25,535 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2018-04-11 22:11:25,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:11:25,537 INFO L225 Difference]: With dead ends: 315 [2018-04-11 22:11:25,537 INFO L226 Difference]: Without dead ends: 312 [2018-04-11 22:11:25,538 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-04-11 22:11:25,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-04-11 22:11:25,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 245. [2018-04-11 22:11:25,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-04-11 22:11:25,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 272 transitions. [2018-04-11 22:11:25,548 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 272 transitions. Word has length 36 [2018-04-11 22:11:25,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:11:25,548 INFO L459 AbstractCegarLoop]: Abstraction has 245 states and 272 transitions. [2018-04-11 22:11:25,549 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 22:11:25,549 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 272 transitions. [2018-04-11 22:11:25,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-11 22:11:25,550 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:11:25,550 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 22:11:25,550 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 22:11:25,550 INFO L82 PathProgramCache]: Analyzing trace with hash -696915825, 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-11 22:11:25,572 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 22:11:25,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:11:25,595 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:11:25,616 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 22:11:25,617 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 22:11:25,654 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 22:11:25,675 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 22:11:25,675 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2018-04-11 22:11:25,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 22:11:25,675 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 22:11:25,675 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-04-11 22:11:25,675 INFO L87 Difference]: Start difference. First operand 245 states and 272 transitions. Second operand 5 states. [2018-04-11 22:11:25,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:11:25,892 INFO L93 Difference]: Finished difference Result 528 states and 575 transitions. [2018-04-11 22:11:25,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 22:11:25,892 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-04-11 22:11:25,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:11:25,894 INFO L225 Difference]: With dead ends: 528 [2018-04-11 22:11:25,894 INFO L226 Difference]: Without dead ends: 388 [2018-04-11 22:11:25,895 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-11 22:11:25,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-04-11 22:11:25,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 245. [2018-04-11 22:11:25,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-04-11 22:11:25,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 271 transitions. [2018-04-11 22:11:25,901 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 271 transitions. Word has length 49 [2018-04-11 22:11:25,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:11:25,902 INFO L459 AbstractCegarLoop]: Abstraction has 245 states and 271 transitions. [2018-04-11 22:11:25,902 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 22:11:25,902 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 271 transitions. [2018-04-11 22:11:25,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-11 22:11:25,903 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:11:25,903 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] [2018-04-11 22:11:25,903 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 22:11:25,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1847609708, 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-11 22:11:25,913 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 22:11:25,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:11:25,934 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:11:26,051 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 22:11:26,051 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 22:11:26,069 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 22:11:26,089 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 22:11:26,090 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-04-11 22:11:26,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 22:11:26,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 22:11:26,090 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 22:11:26,090 INFO L87 Difference]: Start difference. First operand 245 states and 271 transitions. Second operand 5 states. [2018-04-11 22:11:26,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:11:26,685 INFO L93 Difference]: Finished difference Result 585 states and 649 transitions. [2018-04-11 22:11:26,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 22:11:26,685 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2018-04-11 22:11:26,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:11:26,687 INFO L225 Difference]: With dead ends: 585 [2018-04-11 22:11:26,687 INFO L226 Difference]: Without dead ends: 375 [2018-04-11 22:11:26,688 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-11 22:11:26,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2018-04-11 22:11:26,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 242. [2018-04-11 22:11:26,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-04-11 22:11:26,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 265 transitions. [2018-04-11 22:11:26,696 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 265 transitions. Word has length 51 [2018-04-11 22:11:26,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:11:26,696 INFO L459 AbstractCegarLoop]: Abstraction has 242 states and 265 transitions. [2018-04-11 22:11:26,696 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 22:11:26,696 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 265 transitions. [2018-04-11 22:11:26,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-11 22:11:26,697 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:11:26,697 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] [2018-04-11 22:11:26,698 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 22:11:26,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1847611604, 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-11 22:11:26,707 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 22:11:26,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:11:26,730 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:11:26,769 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 22:11:26,770 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 22:11:26,775 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 22:11:26,795 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 22:11:26,795 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-11 22:11:26,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 22:11:26,796 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 22:11:26,796 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 22:11:26,796 INFO L87 Difference]: Start difference. First operand 242 states and 265 transitions. Second operand 4 states. [2018-04-11 22:11:27,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:11:27,067 INFO L93 Difference]: Finished difference Result 246 states and 269 transitions. [2018-04-11 22:11:27,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 22:11:27,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-04-11 22:11:27,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:11:27,069 INFO L225 Difference]: With dead ends: 246 [2018-04-11 22:11:27,069 INFO L226 Difference]: Without dead ends: 237 [2018-04-11 22:11:27,069 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 22:11:27,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-04-11 22:11:27,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 236. [2018-04-11 22:11:27,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-04-11 22:11:27,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 258 transitions. [2018-04-11 22:11:27,077 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 258 transitions. Word has length 51 [2018-04-11 22:11:27,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:11:27,078 INFO L459 AbstractCegarLoop]: Abstraction has 236 states and 258 transitions. [2018-04-11 22:11:27,078 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 22:11:27,078 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 258 transitions. [2018-04-11 22:11:27,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-11 22:11:27,078 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:11:27,078 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] [2018-04-11 22:11:27,078 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 22:11:27,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1847611605, 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-11 22:11:27,086 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 22:11:27,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:11:27,105 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:11:27,252 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 22:11:27,252 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 22:11:27,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-11 22:11:27,274 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 22:11:27,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-04-11 22:11:27,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:27,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 22:11:27,309 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:33 [2018-04-11 22:11:27,403 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 22:11:27,424 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 22:11:27,432 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 8 [2018-04-11 22:11:27,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 22:11:27,433 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 22:11:27,433 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-04-11 22:11:27,433 INFO L87 Difference]: Start difference. First operand 236 states and 258 transitions. Second operand 9 states. [2018-04-11 22:11:27,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:11:27,908 INFO L93 Difference]: Finished difference Result 360 states and 396 transitions. [2018-04-11 22:11:27,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 22:11:27,908 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2018-04-11 22:11:27,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:11:27,909 INFO L225 Difference]: With dead ends: 360 [2018-04-11 22:11:27,909 INFO L226 Difference]: Without dead ends: 350 [2018-04-11 22:11:27,910 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2018-04-11 22:11:27,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-04-11 22:11:27,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 238. [2018-04-11 22:11:27,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-04-11 22:11:27,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 258 transitions. [2018-04-11 22:11:27,918 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 258 transitions. Word has length 51 [2018-04-11 22:11:27,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:11:27,918 INFO L459 AbstractCegarLoop]: Abstraction has 238 states and 258 transitions. [2018-04-11 22:11:27,918 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 22:11:27,918 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 258 transitions. [2018-04-11 22:11:27,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-11 22:11:27,919 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:11:27,919 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] [2018-04-11 22:11:27,919 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 22:11:27,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1115645900, 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-11 22:11:27,939 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 22:11:27,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:11:27,962 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:11:28,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 22:11:28,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 22:11:28,078 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:28,092 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:28,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:28,097 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:16 [2018-04-11 22:11:28,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 22:11:28,121 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:11:28,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 22:11:28,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:28,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:28,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:28,159 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:16 [2018-04-11 22:11:28,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 22:11:28,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 22:11:28,184 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:28,185 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:28,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:28,194 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:5 [2018-04-11 22:11:28,207 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 22:11:28,207 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 22:11:28,263 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-11 22:11:28,263 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:28,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:28,264 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:28, output treesize:1 [2018-04-11 22:11:28,283 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 22:11:28,314 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 22:11:28,314 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 5] imperfect sequences [] total 10 [2018-04-11 22:11:28,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 22:11:28,315 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 22:11:28,315 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-04-11 22:11:28,315 INFO L87 Difference]: Start difference. First operand 238 states and 258 transitions. Second operand 11 states. [2018-04-11 22:11:28,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:11:28,660 INFO L93 Difference]: Finished difference Result 332 states and 356 transitions. [2018-04-11 22:11:28,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 22:11:28,660 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2018-04-11 22:11:28,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:11:28,661 INFO L225 Difference]: With dead ends: 332 [2018-04-11 22:11:28,661 INFO L226 Difference]: Without dead ends: 331 [2018-04-11 22:11:28,662 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2018-04-11 22:11:28,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-04-11 22:11:28,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 259. [2018-04-11 22:11:28,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-04-11 22:11:28,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 282 transitions. [2018-04-11 22:11:28,671 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 282 transitions. Word has length 58 [2018-04-11 22:11:28,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:11:28,671 INFO L459 AbstractCegarLoop]: Abstraction has 259 states and 282 transitions. [2018-04-11 22:11:28,671 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 22:11:28,671 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 282 transitions. [2018-04-11 22:11:28,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-11 22:11:28,672 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:11:28,672 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] [2018-04-11 22:11:28,672 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 22:11:28,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1115645901, 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-11 22:11:28,679 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 22:11:28,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:11:28,702 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:11:28,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 22:11:28,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 22:11:28,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:28,723 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:28,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 22:11:28,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 22:11:28,734 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:28,747 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:28,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:28,752 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:18 [2018-04-11 22:11:28,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 22:11:28,773 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:11:28,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 22:11:28,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:28,778 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:28,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-04-11 22:11:28,789 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:11:28,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 22:11:28,791 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:28,795 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:28,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:28,802 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-04-11 22:11:28,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 22:11:28,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 22:11:28,815 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:28,816 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:28,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 22:11:28,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 22:11:28,824 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:28,825 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:28,827 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:28,828 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:32, output treesize:10 [2018-04-11 22:11:28,838 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 22:11:28,839 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 22:11:28,908 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-11 22:11:28,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:28,910 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:28,910 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:41, output treesize:1 [2018-04-11 22:11:28,919 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 22:11:28,952 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 22:11:28,952 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 6] imperfect sequences [] total 12 [2018-04-11 22:11:28,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 22:11:28,952 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 22:11:28,952 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-04-11 22:11:28,953 INFO L87 Difference]: Start difference. First operand 259 states and 282 transitions. Second operand 12 states. [2018-04-11 22:11:29,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:11:29,240 INFO L93 Difference]: Finished difference Result 477 states and 515 transitions. [2018-04-11 22:11:29,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 22:11:29,241 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2018-04-11 22:11:29,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:11:29,242 INFO L225 Difference]: With dead ends: 477 [2018-04-11 22:11:29,243 INFO L226 Difference]: Without dead ends: 346 [2018-04-11 22:11:29,243 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-04-11 22:11:29,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-04-11 22:11:29,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 253. [2018-04-11 22:11:29,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-04-11 22:11:29,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 274 transitions. [2018-04-11 22:11:29,256 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 274 transitions. Word has length 58 [2018-04-11 22:11:29,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:11:29,256 INFO L459 AbstractCegarLoop]: Abstraction has 253 states and 274 transitions. [2018-04-11 22:11:29,256 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 22:11:29,256 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 274 transitions. [2018-04-11 22:11:29,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-11 22:11:29,257 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:11:29,257 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] [2018-04-11 22:11:29,257 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 22:11:29,257 INFO L82 PathProgramCache]: Analyzing trace with hash -978064352, 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-11 22:11:29,264 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 22:11:29,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:11:29,288 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:11:29,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 22:11:29,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 22:11:29,372 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:29,374 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:29,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:29,378 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2018-04-11 22:11:29,412 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-11 22:11:29,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-04-11 22:11:29,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:29,416 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:29,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:29,418 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2018-04-11 22:11:29,437 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 22:11:29,437 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 22:11:29,471 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 14 treesize of output 12 [2018-04-11 22:11:29,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-11 22:11:29,473 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:29,474 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:29,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2018-04-11 22:11:29,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-11 22:11:29,476 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:29,477 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:29,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-11 22:11:29,484 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:24, output treesize:23 [2018-04-11 22:11:29,546 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 22:11:29,577 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 22:11:29,577 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11, 12] imperfect sequences [] total 17 [2018-04-11 22:11:29,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 22:11:29,578 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 22:11:29,578 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2018-04-11 22:11:29,578 INFO L87 Difference]: Start difference. First operand 253 states and 274 transitions. Second operand 17 states. [2018-04-11 22:11:30,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:11:30,062 INFO L93 Difference]: Finished difference Result 350 states and 377 transitions. [2018-04-11 22:11:30,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-11 22:11:30,062 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 63 [2018-04-11 22:11:30,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:11:30,063 INFO L225 Difference]: With dead ends: 350 [2018-04-11 22:11:30,064 INFO L226 Difference]: Without dead ends: 347 [2018-04-11 22:11:30,064 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 107 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=279, Invalid=777, Unknown=0, NotChecked=0, Total=1056 [2018-04-11 22:11:30,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-04-11 22:11:30,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 257. [2018-04-11 22:11:30,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-04-11 22:11:30,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 278 transitions. [2018-04-11 22:11:30,078 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 278 transitions. Word has length 63 [2018-04-11 22:11:30,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:11:30,078 INFO L459 AbstractCegarLoop]: Abstraction has 257 states and 278 transitions. [2018-04-11 22:11:30,078 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 22:11:30,078 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 278 transitions. [2018-04-11 22:11:30,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-11 22:11:30,079 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:11:30,079 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] [2018-04-11 22:11:30,079 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 22:11:30,079 INFO L82 PathProgramCache]: Analyzing trace with hash -978063709, 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-11 22:11:30,088 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 22:11:30,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:11:30,119 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:11:30,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 22:11:30,125 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:30,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:30,129 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 22:11:30,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 22:11:30,155 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:30,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:30,160 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2018-04-11 22:11:30,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 22:11:30,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 22:11:30,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:30,207 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:30,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 22:11:30,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 22:11:30,224 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:30,225 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:30,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:30,233 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:46, output treesize:38 [2018-04-11 22:11:30,255 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-11 22:11:30,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-11 22:11:30,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:30,258 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:30,265 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-11 22:11:30,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-04-11 22:11:30,266 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:30,276 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:30,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:11:30,281 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:17 [2018-04-11 22:11:30,302 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 22:11:30,302 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 22:11:30,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2018-04-11 22:11:30,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 17 treesize of output 13 [2018-04-11 22:11:30,415 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:11:30,421 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:11:30,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2018-04-11 22:11:30,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-11 22:11:30,424 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:11:30,428 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:11:30,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2018-04-11 22:11:30,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 17 treesize of output 13 [2018-04-11 22:11:30,432 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:11:30,437 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:11:30,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-04-11 22:11:30,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 11 treesize of output 7 [2018-04-11 22:11:30,478 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:30,488 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:30,489 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 22 [2018-04-11 22:11:30,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 22:11:30,491 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:30,495 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:30,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-04-11 22:11:30,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 11 treesize of output 7 [2018-04-11 22:11:30,503 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:30,505 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:30,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-11 22:11:30,531 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 3 variables, input treesize:67, output treesize:33 [2018-04-11 22:11:31,386 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 22:11:31,406 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 22:11:31,406 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 12] imperfect sequences [] total 20 [2018-04-11 22:11:31,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 22:11:31,407 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 22:11:31,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=334, Unknown=3, NotChecked=0, Total=420 [2018-04-11 22:11:31,407 INFO L87 Difference]: Start difference. First operand 257 states and 278 transitions. Second operand 21 states. [2018-04-11 22:11:32,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:11:32,239 INFO L93 Difference]: Finished difference Result 347 states and 374 transitions. [2018-04-11 22:11:32,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 22:11:32,239 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 63 [2018-04-11 22:11:32,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:11:32,241 INFO L225 Difference]: With dead ends: 347 [2018-04-11 22:11:32,241 INFO L226 Difference]: Without dead ends: 346 [2018-04-11 22:11:32,242 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 103 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=405, Invalid=1152, Unknown=3, NotChecked=0, Total=1560 [2018-04-11 22:11:32,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-04-11 22:11:32,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 259. [2018-04-11 22:11:32,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-04-11 22:11:32,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 281 transitions. [2018-04-11 22:11:32,257 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 281 transitions. Word has length 63 [2018-04-11 22:11:32,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:11:32,257 INFO L459 AbstractCegarLoop]: Abstraction has 259 states and 281 transitions. [2018-04-11 22:11:32,257 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 22:11:32,257 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 281 transitions. [2018-04-11 22:11:32,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-11 22:11:32,258 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:11:32,258 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] [2018-04-11 22:11:32,258 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 22:11:32,258 INFO L82 PathProgramCache]: Analyzing trace with hash -978063710, 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-11 22:11:32,266 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 22:11:32,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:11:32,286 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:11:32,291 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:11:32,292 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:11:32,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 22:11:32,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:32,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:32,298 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-04-11 22:11:32,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 22:11:32,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 22:11:32,327 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:32,328 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:32,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-11 22:11:32,334 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-04-11 22:11:32,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 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 19 [2018-04-11 22:11:32,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-11 22:11:32,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:32,357 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:32,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:32,361 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:15 [2018-04-11 22:11:32,384 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:11:32,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-04-11 22:11:32,385 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:32,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:11:32,390 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2018-04-11 22:11:32,412 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 22:11:32,413 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 22:11:32,461 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 14 treesize of output 12 [2018-04-11 22:11:32,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 8 [2018-04-11 22:11:32,497 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:11:32,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:11:32,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-04-11 22:11:32,509 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:71 [2018-04-11 22:11:32,591 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 22:11:32,610 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 22:11:32,611 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 10] imperfect sequences [] total 17 [2018-04-11 22:11:32,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 22:11:32,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 22:11:32,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2018-04-11 22:11:32,611 INFO L87 Difference]: Start difference. First operand 259 states and 281 transitions. Second operand 18 states. [2018-04-11 22:11:33,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:11:33,265 INFO L93 Difference]: Finished difference Result 344 states and 368 transitions. [2018-04-11 22:11:33,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 22:11:33,265 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 63 [2018-04-11 22:11:33,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:11:33,266 INFO L225 Difference]: With dead ends: 344 [2018-04-11 22:11:33,267 INFO L226 Difference]: Without dead ends: 343 [2018-04-11 22:11:33,267 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 107 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=506, Unknown=0, NotChecked=0, Total=650 [2018-04-11 22:11:33,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-04-11 22:11:33,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 270. [2018-04-11 22:11:33,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-04-11 22:11:33,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 292 transitions. [2018-04-11 22:11:33,283 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 292 transitions. Word has length 63 [2018-04-11 22:11:33,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:11:33,283 INFO L459 AbstractCegarLoop]: Abstraction has 270 states and 292 transitions. [2018-04-11 22:11:33,283 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 22:11:33,283 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 292 transitions. [2018-04-11 22:11:33,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-11 22:11:33,284 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:11:33,284 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] [2018-04-11 22:11:33,284 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 22:11:33,285 INFO L82 PathProgramCache]: Analyzing trace with hash -437623102, 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-11 22:11:33,292 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 22:11:33,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:11:33,311 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:11:33,320 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-11 22:11:33,320 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 22:11:33,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 7 [2018-04-11 22:11:33,324 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:33,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:33,327 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2018-04-11 22:11:33,333 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-11 22:11:33,367 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 22:11:33,367 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-11 22:11:33,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 22:11:33,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 22:11:33,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 22:11:33,367 INFO L87 Difference]: Start difference. First operand 270 states and 292 transitions. Second operand 4 states. [2018-04-11 22:11:33,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:11:33,535 INFO L93 Difference]: Finished difference Result 325 states and 349 transitions. [2018-04-11 22:11:33,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 22:11:33,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2018-04-11 22:11:33,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:11:33,537 INFO L225 Difference]: With dead ends: 325 [2018-04-11 22:11:33,537 INFO L226 Difference]: Without dead ends: 320 [2018-04-11 22:11:33,537 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-11 22:11:33,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-04-11 22:11:33,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 270. [2018-04-11 22:11:33,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-04-11 22:11:33,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 296 transitions. [2018-04-11 22:11:33,552 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 296 transitions. Word has length 66 [2018-04-11 22:11:33,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:11:33,552 INFO L459 AbstractCegarLoop]: Abstraction has 270 states and 296 transitions. [2018-04-11 22:11:33,552 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 22:11:33,553 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 296 transitions. [2018-04-11 22:11:33,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-11 22:11:33,553 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:11:33,553 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] [2018-04-11 22:11:33,553 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 22:11:33,554 INFO L82 PathProgramCache]: Analyzing trace with hash -437623101, 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-11 22:11:33,562 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 22:11:33,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:11:33,594 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:11:33,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 22:11:33,599 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:33,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:33,617 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 22:11:33,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 22:11:33,644 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:33,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:33,655 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2018-04-11 22:11:33,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 22:11:33,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 22:11:33,721 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:33,724 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:33,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 22:11:33,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 22:11:33,758 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:33,760 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:33,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:33,783 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:46, output treesize:38 [2018-04-11 22:11:33,817 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-11 22:11:33,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-11 22:11:33,826 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:33,828 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:33,838 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-11 22:11:33,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2018-04-11 22:11:33,840 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:33,842 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:33,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:11:33,847 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:17 [2018-04-11 22:11:33,932 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 22:11:33,932 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 22:11:34,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-04-11 22:11:34,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 17 treesize of output 13 [2018-04-11 22:11:34,097 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:11:34,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:11:34,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-11 22:11:34,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-04-11 22:11:34,120 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:34,121 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:34,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-11 22:11:34,130 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:62, output treesize:29 [2018-04-11 22:11:35,027 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 22:11:35,047 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 22:11:35,047 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11, 13] imperfect sequences [] total 23 [2018-04-11 22:11:35,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 22:11:35,048 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 22:11:35,048 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=455, Unknown=3, NotChecked=0, Total=552 [2018-04-11 22:11:35,048 INFO L87 Difference]: Start difference. First operand 270 states and 296 transitions. Second operand 24 states. [2018-04-11 22:11:37,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:11:37,016 INFO L93 Difference]: Finished difference Result 528 states and 571 transitions. [2018-04-11 22:11:37,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-11 22:11:37,016 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 66 [2018-04-11 22:11:37,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:11:37,018 INFO L225 Difference]: With dead ends: 528 [2018-04-11 22:11:37,018 INFO L226 Difference]: Without dead ends: 524 [2018-04-11 22:11:37,019 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 106 SyntacticMatches, 4 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 954 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=736, Invalid=2921, Unknown=3, NotChecked=0, Total=3660 [2018-04-11 22:11:37,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2018-04-11 22:11:37,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 281. [2018-04-11 22:11:37,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-04-11 22:11:37,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 308 transitions. [2018-04-11 22:11:37,035 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 308 transitions. Word has length 66 [2018-04-11 22:11:37,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:11:37,036 INFO L459 AbstractCegarLoop]: Abstraction has 281 states and 308 transitions. [2018-04-11 22:11:37,036 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 22:11:37,036 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 308 transitions. [2018-04-11 22:11:37,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-04-11 22:11:37,037 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:11:37,037 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-11 22:11:37,037 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 22:11:37,038 INFO L82 PathProgramCache]: Analyzing trace with hash 429590002, 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-11 22:11:37,047 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 22:11:37,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:11:37,083 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:11:37,146 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 17 treesize of output 14 [2018-04-11 22:11:37,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 22:11:37,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:37,149 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:37,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:11:37,155 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-04-11 22:11:37,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 22:11:37,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 22:11:37,248 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:37,250 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:37,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 22:11:37,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 22:11:37,266 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:37,267 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:37,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:11:37,278 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2018-04-11 22:11:37,337 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 29 treesize of output 25 [2018-04-11 22:11:37,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-11 22:11:37,339 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:37,341 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:37,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 39 treesize of output 31 [2018-04-11 22:11:37,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 31 treesize of output 20 [2018-04-11 22:11:37,350 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:37,353 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:37,358 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:11:37,358 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:23 [2018-04-11 22:11:37,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-11 22:11:37,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2018-04-11 22:11:37,416 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:37,417 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:37,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:11:37,421 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:11 [2018-04-11 22:11:37,459 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 22:11:37,460 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 22:11:37,623 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-11 22:11:37,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 19 treesize of output 15 [2018-04-11 22:11:37,664 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:11:37,666 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:11:37,694 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 21 [2018-04-11 22:11:37,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 13 [2018-04-11 22:11:37,697 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:11:37,700 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:11:37,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-04-11 22:11:37,716 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:64, output treesize:91 [2018-04-11 22:11:37,953 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 22:11:37,983 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:11:37,983 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 33 [2018-04-11 22:11:37,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-11 22:11:37,984 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-11 22:11:37,984 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=931, Unknown=0, NotChecked=0, Total=1056 [2018-04-11 22:11:37,984 INFO L87 Difference]: Start difference. First operand 281 states and 308 transitions. Second operand 33 states. [2018-04-11 22:11:40,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:11:40,395 INFO L93 Difference]: Finished difference Result 698 states and 761 transitions. [2018-04-11 22:11:40,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-04-11 22:11:40,395 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 76 [2018-04-11 22:11:40,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:11:40,397 INFO L225 Difference]: With dead ends: 698 [2018-04-11 22:11:40,398 INFO L226 Difference]: Without dead ends: 665 [2018-04-11 22:11:40,399 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 118 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1587 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1241, Invalid=5565, Unknown=0, NotChecked=0, Total=6806 [2018-04-11 22:11:40,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2018-04-11 22:11:40,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 366. [2018-04-11 22:11:40,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-04-11 22:11:40,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 403 transitions. [2018-04-11 22:11:40,422 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 403 transitions. Word has length 76 [2018-04-11 22:11:40,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:11:40,423 INFO L459 AbstractCegarLoop]: Abstraction has 366 states and 403 transitions. [2018-04-11 22:11:40,423 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-11 22:11:40,423 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 403 transitions. [2018-04-11 22:11:40,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-04-11 22:11:40,424 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:11:40,424 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, 1, 1] [2018-04-11 22:11:40,424 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 22:11:40,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1241523921, 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-11 22:11:40,434 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 22:11:40,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:11:40,469 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:11:40,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 14 [2018-04-11 22:11:40,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 22:11:40,534 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:40,536 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:40,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:11:40,558 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-04-11 22:11:40,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 22:11:40,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 22:11:40,707 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:40,708 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:40,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 22:11:40,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 22:11:40,722 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:40,723 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:40,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:11:40,732 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2018-04-11 22:11:40,772 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 29 treesize of output 25 [2018-04-11 22:11:40,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2018-04-11 22:11:40,774 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:40,775 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:40,782 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 31 [2018-04-11 22:11:40,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 31 treesize of output 20 [2018-04-11 22:11:40,784 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:40,788 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:40,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:11:40,793 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:23 [2018-04-11 22:11:40,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-11 22:11:40,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2018-04-11 22:11:40,852 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:40,853 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:40,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:11:40,857 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:11 [2018-04-11 22:11:40,901 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 22:11:40,901 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 22:11:41,136 WARN L151 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 47 DAG size of output 37 [2018-04-11 22:11:41,139 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-11 22:11:41,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-11 22:11:41,142 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:11:41,144 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:11:41,167 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 21 [2018-04-11 22:11:41,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-04-11 22:11:41,170 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:11:41,174 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:11:41,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2018-04-11 22:11:41,192 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:64, output treesize:91 [2018-04-11 22:11:41,554 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 22:11:41,576 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:11:41,576 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 33 [2018-04-11 22:11:41,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-11 22:11:41,576 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-11 22:11:41,577 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=932, Unknown=0, NotChecked=0, Total=1056 [2018-04-11 22:11:41,577 INFO L87 Difference]: Start difference. First operand 366 states and 403 transitions. Second operand 33 states. [2018-04-11 22:11:43,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:11:43,866 INFO L93 Difference]: Finished difference Result 1027 states and 1131 transitions. [2018-04-11 22:11:43,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-04-11 22:11:43,867 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 78 [2018-04-11 22:11:43,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:11:43,869 INFO L225 Difference]: With dead ends: 1027 [2018-04-11 22:11:43,869 INFO L226 Difference]: Without dead ends: 999 [2018-04-11 22:11:43,871 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 122 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 949 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=700, Invalid=3722, Unknown=0, NotChecked=0, Total=4422 [2018-04-11 22:11:43,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2018-04-11 22:11:43,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 374. [2018-04-11 22:11:43,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-04-11 22:11:43,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 411 transitions. [2018-04-11 22:11:43,887 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 411 transitions. Word has length 78 [2018-04-11 22:11:43,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:11:43,887 INFO L459 AbstractCegarLoop]: Abstraction has 374 states and 411 transitions. [2018-04-11 22:11:43,887 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-11 22:11:43,888 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 411 transitions. [2018-04-11 22:11:43,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-04-11 22:11:43,888 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:11:43,888 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, 1, 1, 1, 1, 1] [2018-04-11 22:11:43,888 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 22:11:43,889 INFO L82 PathProgramCache]: Analyzing trace with hash 2141517654, 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-11 22:11:43,900 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 22:11:43,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:11:43,932 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:11:43,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 22:11:43,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 22:11:43,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:43,997 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:44,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:44,005 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:44 [2018-04-11 22:11:44,035 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 42 treesize of output 34 [2018-04-11 22:11:44,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 23 [2018-04-11 22:11:44,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:44,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:44,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:44,047 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:23 [2018-04-11 22:11:44,164 WARN L1033 $PredicateComparison]: unable to prove that (exists ((main_~data~0.base Int) (main_~item2~0.base Int)) (let ((.cse0 (store |c_old(#valid)| main_~item2~0.base 1))) (and (= |c_#valid| (store (store .cse0 main_~data~0.base 0) main_~item2~0.base 0)) (= 0 (select |c_old(#valid)| main_~item2~0.base)) (= 0 (select .cse0 main_~data~0.base))))) is different from true [2018-04-11 22:11:44,185 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-04-11 22:11:44,185 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 22:11:44,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2018-04-11 22:11:44,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2018-04-11 22:11:44,317 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:11:44,330 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:11:44,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2018-04-11 22:11:44,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 27 treesize of output 19 [2018-04-11 22:11:44,334 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:11:44,339 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:11:44,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2018-04-11 22:11:44,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 13 treesize of output 9 [2018-04-11 22:11:44,343 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:11:44,349 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:11:44,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 7 xjuncts. [2018-04-11 22:11:44,374 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:54, output treesize:205 [2018-04-11 22:11:44,546 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc3.base_12| Int) (|v_main_#t~malloc4.base_14| Int)) (let ((.cse1 (store |c_#valid| |v_main_#t~malloc3.base_12| 1))) (let ((.cse0 (store .cse1 |v_main_#t~malloc4.base_14| 0))) (or (not (= 1 (select .cse0 |v_main_#t~malloc3.base_12|))) (= |c_old(#valid)| (store .cse0 |v_main_#t~malloc3.base_12| 0)) (not (= 0 (select |c_#valid| |v_main_#t~malloc3.base_12|))) (not (= 0 (select .cse1 |v_main_#t~malloc4.base_14|))))))) is different from false [2018-04-11 22:11:44,581 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2018-04-11 22:11:44,601 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:11:44,601 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 27 [2018-04-11 22:11:44,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-11 22:11:44,602 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-11 22:11:44,602 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=570, Unknown=6, NotChecked=98, Total=756 [2018-04-11 22:11:44,603 INFO L87 Difference]: Start difference. First operand 374 states and 411 transitions. Second operand 28 states. [2018-04-11 22:11:44,635 WARN L1011 $PredicateComparison]: unable to prove that (and (forall ((|v_main_#t~malloc3.base_12| Int) (|v_main_#t~malloc4.base_14| Int)) (let ((.cse1 (store |c_#valid| |v_main_#t~malloc3.base_12| 1))) (let ((.cse0 (store .cse1 |v_main_#t~malloc4.base_14| 0))) (or (not (= 1 (select .cse0 |v_main_#t~malloc3.base_12|))) (= |c_old(#valid)| (store .cse0 |v_main_#t~malloc3.base_12| 0)) (not (= 0 (select |c_#valid| |v_main_#t~malloc3.base_12|))) (not (= 0 (select .cse1 |v_main_#t~malloc4.base_14|))))))) (= |c_#valid| |c_old(#valid)|)) is different from false [2018-04-11 22:11:46,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:11:46,160 INFO L93 Difference]: Finished difference Result 447 states and 489 transitions. [2018-04-11 22:11:46,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 22:11:46,160 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 81 [2018-04-11 22:11:46,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:11:46,162 INFO L225 Difference]: With dead ends: 447 [2018-04-11 22:11:46,163 INFO L226 Difference]: Without dead ends: 442 [2018-04-11 22:11:46,163 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 133 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=235, Invalid=1490, Unknown=9, NotChecked=246, Total=1980 [2018-04-11 22:11:46,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2018-04-11 22:11:46,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 395. [2018-04-11 22:11:46,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-04-11 22:11:46,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 437 transitions. [2018-04-11 22:11:46,187 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 437 transitions. Word has length 81 [2018-04-11 22:11:46,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:11:46,187 INFO L459 AbstractCegarLoop]: Abstraction has 395 states and 437 transitions. [2018-04-11 22:11:46,187 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-11 22:11:46,187 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 437 transitions. [2018-04-11 22:11:46,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-04-11 22:11:46,188 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:11:46,188 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, 1, 1, 1, 1, 1] [2018-04-11 22:11:46,188 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 22:11:46,188 INFO L82 PathProgramCache]: Analyzing trace with hash 2141518297, 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-11 22:11:46,194 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 22:11:46,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:11:46,218 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:11:46,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 22:11:46,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 22:11:46,227 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:46,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:46,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 22:11:46,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 22:11:46,237 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:46,238 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:46,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:46,243 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-04-11 22:11:46,253 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:11:46,254 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:11:46,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 22:11:46,255 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:46,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:46,266 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:28 [2018-04-11 22:11:46,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-04-11 22:11:46,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 8 treesize of output 7 [2018-04-11 22:11:46,294 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:46,297 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:46,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-04-11 22:11:46,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 22:11:46,313 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:46,317 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:46,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:46,325 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:53, output treesize:42 [2018-04-11 22:11:46,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-04-11 22:11:46,365 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:11:46,365 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:11:46,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 30 [2018-04-11 22:11:46,365 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:46,371 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:46,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2018-04-11 22:11:46,390 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:11:46,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 22:11:46,390 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:46,395 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:46,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:46,407 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:68, output treesize:96 [2018-04-11 22:11:46,469 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 76 treesize of output 61 [2018-04-11 22:11:46,471 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 38 treesize of output 27 [2018-04-11 22:11:46,471 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:11:46,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2018-04-11 22:11:46,478 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:46,482 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:11:46,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 38 [2018-04-11 22:11:46,493 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:11:46,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 27 [2018-04-11 22:11:46,494 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:11:46,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 22:11:46,501 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:46,504 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:46,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:46,507 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:105, output treesize:7 [2018-04-11 22:11:46,548 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 22:11:46,548 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 22:11:46,810 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-11 22:11:46,810 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:46,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:46,812 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 8 variables, input treesize:103, output treesize:1 [2018-04-11 22:11:46,829 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 22:11:46,849 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:11:46,849 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 23 [2018-04-11 22:11:46,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 22:11:46,850 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 22:11:46,850 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=427, Unknown=4, NotChecked=0, Total=506 [2018-04-11 22:11:46,850 INFO L87 Difference]: Start difference. First operand 395 states and 437 transitions. Second operand 23 states. [2018-04-11 22:11:48,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:11:48,106 INFO L93 Difference]: Finished difference Result 454 states and 500 transitions. [2018-04-11 22:11:48,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 22:11:48,106 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 81 [2018-04-11 22:11:48,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:11:48,108 INFO L225 Difference]: With dead ends: 454 [2018-04-11 22:11:48,108 INFO L226 Difference]: Without dead ends: 378 [2018-04-11 22:11:48,108 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 142 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=354, Invalid=1445, Unknown=7, NotChecked=0, Total=1806 [2018-04-11 22:11:48,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-04-11 22:11:48,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 349. [2018-04-11 22:11:48,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-04-11 22:11:48,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 385 transitions. [2018-04-11 22:11:48,122 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 385 transitions. Word has length 81 [2018-04-11 22:11:48,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:11:48,123 INFO L459 AbstractCegarLoop]: Abstraction has 349 states and 385 transitions. [2018-04-11 22:11:48,123 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 22:11:48,123 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 385 transitions. [2018-04-11 22:11:48,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-04-11 22:11:48,124 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:11:48,124 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 22:11:48,124 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 22:11:48,124 INFO L82 PathProgramCache]: Analyzing trace with hash 822591320, 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-11 22:11:48,138 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 22:11:48,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:11:48,165 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:11:48,181 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 16 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 22:11:48,182 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 22:11:48,203 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 16 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 22:11:48,223 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:11:48,223 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-04-11 22:11:48,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 22:11:48,223 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 22:11:48,223 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-04-11 22:11:48,224 INFO L87 Difference]: Start difference. First operand 349 states and 385 transitions. Second operand 9 states. [2018-04-11 22:11:48,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:11:48,318 INFO L93 Difference]: Finished difference Result 1303 states and 1447 transitions. [2018-04-11 22:11:48,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 22:11:48,318 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2018-04-11 22:11:48,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:11:48,321 INFO L225 Difference]: With dead ends: 1303 [2018-04-11 22:11:48,321 INFO L226 Difference]: Without dead ends: 1000 [2018-04-11 22:11:48,322 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 159 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2018-04-11 22:11:48,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2018-04-11 22:11:48,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 469. [2018-04-11 22:11:48,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2018-04-11 22:11:48,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 513 transitions. [2018-04-11 22:11:48,342 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 513 transitions. Word has length 85 [2018-04-11 22:11:48,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:11:48,342 INFO L459 AbstractCegarLoop]: Abstraction has 469 states and 513 transitions. [2018-04-11 22:11:48,342 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 22:11:48,342 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 513 transitions. [2018-04-11 22:11:48,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-04-11 22:11:48,343 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:11:48,343 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 22:11:48,343 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 22:11:48,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1598361566, 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-11 22:11:48,353 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 22:11:48,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:11:48,396 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:11:48,413 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:11:48,414 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:11:48,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 22:11:48,415 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:48,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:48,422 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-11 22:11:48,437 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:11:48,438 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:11:48,438 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:11:48,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 22:11:48,439 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:48,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:48,443 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2018-04-11 22:11:48,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 22:11:48,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 22:11:48,469 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:48,470 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:48,475 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:48,475 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-04-11 22:11:48,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2018-04-11 22:11:48,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 22:11:48,493 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:48,497 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:48,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:11:48,503 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:50 [2018-04-11 22:11:48,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 37 [2018-04-11 22:11:48,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-04-11 22:11:48,550 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:48,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-11 22:11:48,555 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:48,557 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:48,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:48,559 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:57, output treesize:5 [2018-04-11 22:11:48,581 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 29 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 22:11:48,581 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 22:11:48,608 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 35 treesize of output 29 [2018-04-11 22:11:48,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-11 22:11:48,621 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:48,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-04-11 22:11:48,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-11 22:11:48,633 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:48,636 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:48,637 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 14 [2018-04-11 22:11:48,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 5 [2018-04-11 22:11:48,638 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:48,639 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:48,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-11 22:11:48,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-11 22:11:48,660 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:35, output treesize:25 [2018-04-11 22:11:48,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-11 22:11:48,677 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:48,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:48,679 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2018-04-11 22:11:48,757 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:48,757 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 2 variables, input treesize:25, output treesize:1 [2018-04-11 22:11:48,769 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 29 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 22:11:48,788 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:11:48,788 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-04-11 22:11:48,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 22:11:48,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 22:11:48,789 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2018-04-11 22:11:48,789 INFO L87 Difference]: Start difference. First operand 469 states and 513 transitions. Second operand 21 states. [2018-04-11 22:11:57,430 WARN L151 SmtUtils]: Spent 4037ms on a formula simplification. DAG size of input: 33 DAG size of output 31 [2018-04-11 22:11:59,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:11:59,809 INFO L93 Difference]: Finished difference Result 551 states and 598 transitions. [2018-04-11 22:11:59,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-11 22:11:59,810 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 88 [2018-04-11 22:11:59,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:11:59,812 INFO L225 Difference]: With dead ends: 551 [2018-04-11 22:11:59,812 INFO L226 Difference]: Without dead ends: 550 [2018-04-11 22:11:59,812 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=404, Invalid=1402, Unknown=0, NotChecked=0, Total=1806 [2018-04-11 22:11:59,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2018-04-11 22:11:59,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 473. [2018-04-11 22:11:59,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2018-04-11 22:11:59,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 518 transitions. [2018-04-11 22:11:59,828 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 518 transitions. Word has length 88 [2018-04-11 22:11:59,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:11:59,829 INFO L459 AbstractCegarLoop]: Abstraction has 473 states and 518 transitions. [2018-04-11 22:11:59,829 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 22:11:59,829 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 518 transitions. [2018-04-11 22:11:59,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-04-11 22:11:59,829 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:11:59,829 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 22:11:59,829 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 22:11:59,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1598361567, 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-11 22:11:59,835 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 22:11:59,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:11:59,862 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:11:59,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 22:11:59,869 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:59,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:59,872 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-04-11 22:11:59,884 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:11:59,884 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:11:59,885 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:11:59,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-04-11 22:11:59,886 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:59,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:59,888 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:9 [2018-04-11 22:11:59,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 22:11:59,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 22:11:59,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:59,904 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:59,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 22:11:59,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 22:11:59,913 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:59,914 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:59,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:59,920 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2018-04-11 22:11:59,935 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 75 treesize of output 76 [2018-04-11 22:11:59,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-04-11 22:11:59,937 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:59,944 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:59,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 70 [2018-04-11 22:11:59,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-04-11 22:11:59,957 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:59,964 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:59,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:11:59,971 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:91, output treesize:55 [2018-04-11 22:11:59,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 39 [2018-04-11 22:11:59,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 28 [2018-04-11 22:11:59,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:11:59,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-04-11 22:11:59,998 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:00,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:12:00,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-04-11 22:12:00,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2018-04-11 22:12:00,022 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:00,025 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:12:00,030 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:12:00,030 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:69, output treesize:13 [2018-04-11 22:12:00,053 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 29 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 22:12:00,053 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 22:12:00,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 54 [2018-04-11 22:12:00,078 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 22:12:00,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 34 treesize of output 32 [2018-04-11 22:12:00,096 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:00,110 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 3 xjuncts. [2018-04-11 22:12:00,110 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:85, output treesize:77 [2018-04-11 22:12:00,934 WARN L148 SmtUtils]: Spent 810ms on a formula simplification that was a NOOP. DAG size: 39 [2018-04-11 22:12:00,939 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 39 treesize of output 32 [2018-04-11 22:12:00,987 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 9 treesize of output 8 [2018-04-11 22:12:00,987 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:00,995 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 8 treesize of output 6 [2018-04-11 22:12:00,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-11 22:12:00,996 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:00,998 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:12:01,003 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-11 22:12:01,020 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 34 [2018-04-11 22:12:01,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-11 22:12:01,045 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:01,052 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 8 treesize of output 6 [2018-04-11 22:12:01,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-11 22:12:01,053 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:01,054 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:12:01,059 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:12:01,077 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 34 [2018-04-11 22:12:01,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-11 22:12:01,095 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:01,102 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 8 treesize of output 6 [2018-04-11 22:12:01,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-11 22:12:01,104 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:01,105 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:12:01,109 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:12:01,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 22:12:01,125 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 11 variables, input treesize:122, output treesize:13 [2018-04-11 22:12:02,875 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 29 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 22:12:02,894 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:12:02,894 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2018-04-11 22:12:02,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 22:12:02,895 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 22:12:02,895 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=316, Unknown=3, NotChecked=0, Total=380 [2018-04-11 22:12:02,895 INFO L87 Difference]: Start difference. First operand 473 states and 518 transitions. Second operand 20 states. [2018-04-11 22:12:03,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:12:03,771 INFO L93 Difference]: Finished difference Result 595 states and 653 transitions. [2018-04-11 22:12:03,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-11 22:12:03,771 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 88 [2018-04-11 22:12:03,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:12:03,773 INFO L225 Difference]: With dead ends: 595 [2018-04-11 22:12:03,773 INFO L226 Difference]: Without dead ends: 594 [2018-04-11 22:12:03,774 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=388, Invalid=1249, Unknown=3, NotChecked=0, Total=1640 [2018-04-11 22:12:03,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2018-04-11 22:12:03,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 473. [2018-04-11 22:12:03,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2018-04-11 22:12:03,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 517 transitions. [2018-04-11 22:12:03,792 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 517 transitions. Word has length 88 [2018-04-11 22:12:03,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:12:03,792 INFO L459 AbstractCegarLoop]: Abstraction has 473 states and 517 transitions. [2018-04-11 22:12:03,792 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 22:12:03,793 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 517 transitions. [2018-04-11 22:12:03,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-04-11 22:12:03,793 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:12:03,793 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 22:12:03,794 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 22:12:03,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1460764208, 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-11 22:12:03,801 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 22:12:03,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:12:03,828 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:12:03,837 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:12:03,838 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:12:03,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 22:12:03,839 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:03,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:12:03,844 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-11 22:12:03,859 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:12:03,859 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:12:03,860 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:12:03,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 22:12:03,861 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:03,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:12:03,864 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2018-04-11 22:12:03,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 22:12:03,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 22:12:03,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:03,882 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:12:03,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:12:03,886 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-04-11 22:12:03,899 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 38 treesize of output 34 [2018-04-11 22:12:03,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 22:12:03,901 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:03,904 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:12:03,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:12:03,909 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:41 [2018-04-11 22:12:03,926 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 48 treesize of output 30 [2018-04-11 22:12:03,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-04-11 22:12:03,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:03,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2018-04-11 22:12:03,931 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:03,932 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:12:03,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:12:03,933 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:48, output treesize:4 [2018-04-11 22:12:03,949 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 29 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 22:12:03,949 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 22:12:05,990 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 34 treesize of output 28 [2018-04-11 22:12:06,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-11 22:12:06,023 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:06,032 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 18 [2018-04-11 22:12:06,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-04-11 22:12:06,034 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:06,037 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:12:06,038 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-11 22:12:06,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-11 22:12:06,040 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:06,043 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:12:06,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 22:12:06,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 22:12:06,056 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:34, output treesize:14 [2018-04-11 22:12:06,150 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:06,151 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2018-04-11 22:12:06,167 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 29 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 22:12:06,187 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 22:12:06,187 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2018-04-11 22:12:06,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 22:12:06,188 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 22:12:06,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=254, Unknown=1, NotChecked=0, Total=306 [2018-04-11 22:12:06,188 INFO L87 Difference]: Start difference. First operand 473 states and 517 transitions. Second operand 18 states. [2018-04-11 22:12:18,709 WARN L148 SmtUtils]: Spent 101ms on a formula simplification that was a NOOP. DAG size: 35 [2018-04-11 22:12:25,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:12:25,054 INFO L93 Difference]: Finished difference Result 606 states and 664 transitions. [2018-04-11 22:12:25,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 22:12:25,054 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 93 [2018-04-11 22:12:25,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:12:25,056 INFO L225 Difference]: With dead ends: 606 [2018-04-11 22:12:25,056 INFO L226 Difference]: Without dead ends: 539 [2018-04-11 22:12:25,057 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=356, Invalid=1049, Unknown=1, NotChecked=0, Total=1406 [2018-04-11 22:12:25,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2018-04-11 22:12:25,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 305. [2018-04-11 22:12:25,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-04-11 22:12:25,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 331 transitions. [2018-04-11 22:12:25,068 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 331 transitions. Word has length 93 [2018-04-11 22:12:25,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:12:25,069 INFO L459 AbstractCegarLoop]: Abstraction has 305 states and 331 transitions. [2018-04-11 22:12:25,069 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 22:12:25,069 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 331 transitions. [2018-04-11 22:12:25,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-04-11 22:12:25,069 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:12:25,070 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 22:12:25,070 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 22:12:25,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1455288304, 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-11 22:12:25,076 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 22:12:25,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:12:25,104 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:12:25,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 22:12:25,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 22:12:25,132 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:25,133 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:12:25,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:12:25,137 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-04-11 22:12:25,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-04-11 22:12:25,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 22:12:25,158 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:25,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:12:25,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:12:25,173 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:11 [2018-04-11 22:12:25,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-11 22:12:25,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-04-11 22:12:25,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:25,206 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:12:25,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2018-04-11 22:12:25,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2018-04-11 22:12:25,212 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:25,214 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:12:25,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:12:25,217 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:11 [2018-04-11 22:12:25,240 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 22:12:25,240 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 22:12:25,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, 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-11 22:12:25,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 22:12:25,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 16 treesize of output 14 [2018-04-11 22:12:25,284 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:25,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 22:12:25,288 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:24 [2018-04-11 22:12:25,336 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 33 treesize of output 27 [2018-04-11 22:12:25,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-11 22:12:25,349 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:25,360 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-11 22:12:25,362 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-11 22:12:25,362 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:25,363 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:12:25,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2018-04-11 22:12:25,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-11 22:12:25,366 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:25,369 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:12:25,378 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-11 22:12:25,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-11 22:12:25,390 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:33, output treesize:19 [2018-04-11 22:12:25,493 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 22:12:25,512 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-11 22:12:25,512 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [13] total 24 [2018-04-11 22:12:25,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 22:12:25,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 22:12:25,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2018-04-11 22:12:25,513 INFO L87 Difference]: Start difference. First operand 305 states and 331 transitions. Second operand 25 states. [2018-04-11 22:12:26,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:12:26,132 INFO L93 Difference]: Finished difference Result 463 states and 504 transitions. [2018-04-11 22:12:26,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 22:12:26,132 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 95 [2018-04-11 22:12:26,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:12:26,133 INFO L225 Difference]: With dead ends: 463 [2018-04-11 22:12:26,133 INFO L226 Difference]: Without dead ends: 461 [2018-04-11 22:12:26,134 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 166 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=418, Invalid=1142, Unknown=0, NotChecked=0, Total=1560 [2018-04-11 22:12:26,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2018-04-11 22:12:26,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 315. [2018-04-11 22:12:26,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-04-11 22:12:26,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 342 transitions. [2018-04-11 22:12:26,145 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 342 transitions. Word has length 95 [2018-04-11 22:12:26,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:12:26,146 INFO L459 AbstractCegarLoop]: Abstraction has 315 states and 342 transitions. [2018-04-11 22:12:26,146 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 22:12:26,146 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 342 transitions. [2018-04-11 22:12:26,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-04-11 22:12:26,146 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:12:26,146 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 22:12:26,146 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 22:12:26,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1455288303, 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-11 22:12:26,152 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 22:12:26,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:12:26,178 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:12:26,187 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-11 22:12:26,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-11 22:12:26,189 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:26,190 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:12:26,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:12:26,191 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-04-11 22:12:26,201 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-04-11 22:12:26,201 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 22:12:26,204 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-11 22:12:26,204 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:26,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:12:26,205 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2018-04-11 22:12:26,212 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-04-11 22:12:26,231 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-11 22:12:26,231 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-04-11 22:12:26,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 22:12:26,232 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 22:12:26,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 22:12:26,232 INFO L87 Difference]: Start difference. First operand 315 states and 342 transitions. Second operand 6 states. [2018-04-11 22:12:26,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 22:12:26,367 INFO L93 Difference]: Finished difference Result 315 states and 342 transitions. [2018-04-11 22:12:26,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 22:12:26,367 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2018-04-11 22:12:26,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 22:12:26,368 INFO L225 Difference]: With dead ends: 315 [2018-04-11 22:12:26,368 INFO L226 Difference]: Without dead ends: 314 [2018-04-11 22:12:26,369 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-04-11 22:12:26,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-04-11 22:12:26,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2018-04-11 22:12:26,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-04-11 22:12:26,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 340 transitions. [2018-04-11 22:12:26,381 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 340 transitions. Word has length 95 [2018-04-11 22:12:26,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 22:12:26,381 INFO L459 AbstractCegarLoop]: Abstraction has 314 states and 340 transitions. [2018-04-11 22:12:26,381 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 22:12:26,381 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 340 transitions. [2018-04-11 22:12:26,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-04-11 22:12:26,382 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 22:12:26,382 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 22:12:26,382 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr66EnsuresViolationMEMORY_LEAK, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr62RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr56AssertViolationMEMORY_FREE, mainErr11RequiresViolation, mainErr63RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr32AssertViolationMEMORY_FREE, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr64AssertViolationMEMORY_FREE, mainErr57AssertViolationMEMORY_FREE, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr65AssertViolationMEMORY_FREE, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr33AssertViolationMEMORY_FREE, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-11 22:12:26,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1364019796, 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-11 22:12:26,388 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-11 22:12:26,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 22:12:26,426 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 22:12:26,440 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:12:26,440 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-04-11 22:12:26,441 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:26,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:12:26,442 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:5 [2018-04-11 22:12:26,449 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:12:26,450 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:12:26,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 22:12:26,450 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:26,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:12:26,457 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2018-04-11 22:12:26,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 22:12:26,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 22:12:26,494 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:26,495 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:12:26,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:12:26,501 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:30 [2018-04-11 22:12:26,513 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:12:26,513 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:12:26,514 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:12:26,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 52 [2018-04-11 22:12:26,515 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:26,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:12:26,524 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:49 [2018-04-11 22:12:26,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 44 [2018-04-11 22:12:26,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 22:12:26,560 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:26,566 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:12:26,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:12:26,577 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:60, output treesize:56 [2018-04-11 22:12:26,597 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:12:26,598 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:12:26,599 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:12:26,599 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:12:26,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2018-04-11 22:12:26,600 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:26,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:12:26,618 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:70, output treesize:82 [2018-04-11 22:12:26,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 69 [2018-04-11 22:12:26,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 22:12:26,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:26,705 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:12:26,723 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:12:26,723 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:96, output treesize:82 [2018-04-11 22:12:26,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 22:12:26,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 22:12:26,730 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:26,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:12:26,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 53 [2018-04-11 22:12:26,758 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:12:26,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 55 [2018-04-11 22:12:26,759 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:26,768 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:12:26,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:12:26,788 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:104, output treesize:96 [2018-04-11 22:12:26,827 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:12:26,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 125 [2018-04-11 22:12:26,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2018-04-11 22:12:26,832 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:26,849 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:12:26,872 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:12:26,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-04-11 22:12:26,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 22:12:26,877 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:26,881 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:12:26,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 22:12:26,909 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:140, output treesize:142 [2018-04-11 22:12:27,012 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:12:27,013 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 31 treesize of output 31 [2018-04-11 22:12:27,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-11 22:12:27,015 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:27,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 17 treesize of output 15 [2018-04-11 22:12:27,020 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:12:27,022 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:12:27,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:12:27,038 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:151, output treesize:136 [2018-04-11 22:12:27,079 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:12:27,082 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:12:27,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 88 [2018-04-11 22:12:27,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 22:12:27,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:27,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 35 [2018-04-11 22:12:27,100 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:27,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2018-04-11 22:12:27,119 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:12:27,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:12:27,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 22:12:27,139 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:130, output treesize:45 [2018-04-11 22:12:27,204 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:12:27,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 51 [2018-04-11 22:12:27,205 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:27,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 22:12:27,219 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:33 [2018-04-11 22:12:27,319 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 37 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 22:12:27,319 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-11 22:12:27,829 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 584 treesize of output 276 [2018-04-11 22:12:27,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 22:12:27,834 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:27,875 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 275 treesize of output 173 [2018-04-11 22:12:27,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 166 [2018-04-11 22:12:27,892 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 22:12:27,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 158 [2018-04-11 22:12:27,942 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:27,993 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:27,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 155 treesize of output 103 [2018-04-11 22:12:28,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-11 22:12:28,001 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:28,016 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:28,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 89 treesize of output 103 [2018-04-11 22:12:28,460 WARN L151 SmtUtils]: Spent 412ms on a formula simplification. DAG size of input: 278 DAG size of output 198 [2018-04-11 22:12:28,465 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 78 treesize of output 79 [2018-04-11 22:12:28,465 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:28,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 62 [2018-04-11 22:12:28,469 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:28,471 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 58 treesize of output 59 [2018-04-11 22:12:28,472 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:28,773 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 56 treesize of output 55 [2018-04-11 22:12:28,774 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:29,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 58 [2018-04-11 22:12:29,027 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-04-11 22:12:29,277 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:29,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2018-04-11 22:12:29,282 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:29,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2018-04-11 22:12:29,284 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:12:29,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-11 22:12:29,294 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:29,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-11 22:12:29,300 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:29,304 INFO L267 ElimStorePlain]: Start of recursive call 15: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:12:29,539 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:29,542 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:12:29,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 69 [2018-04-11 22:12:29,605 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:29,606 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:29,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 60 [2018-04-11 22:12:29,622 INFO L267 ElimStorePlain]: Start of recursive call 20: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 8 xjuncts. [2018-04-11 22:12:29,750 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:29,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 47 [2018-04-11 22:12:29,763 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-11 22:12:29,877 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:29,877 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:29,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 57 [2018-04-11 22:12:29,893 INFO L267 ElimStorePlain]: Start of recursive call 22: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 8 xjuncts. [2018-04-11 22:12:30,030 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:30,030 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:30,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 54 [2018-04-11 22:12:30,046 INFO L267 ElimStorePlain]: Start of recursive call 23: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 8 xjuncts. [2018-04-11 22:12:30,193 INFO L267 ElimStorePlain]: Start of recursive call 19: 4 dim-1 vars, End of recursive call: 8 dim-0 vars, and 12 xjuncts. [2018-04-11 22:12:30,197 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:30,199 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:12:30,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 58 [2018-04-11 22:12:30,224 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:30,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2018-04-11 22:12:30,234 INFO L267 ElimStorePlain]: Start of recursive call 25: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-11 22:12:30,290 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:30,291 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:30,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 59 [2018-04-11 22:12:30,311 INFO L267 ElimStorePlain]: Start of recursive call 26: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 16 xjuncts. [2018-04-11 22:12:30,439 INFO L267 ElimStorePlain]: Start of recursive call 24: 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 12 xjuncts. [2018-04-11 22:12:30,441 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:30,442 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:12:30,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 52 [2018-04-11 22:12:30,448 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:30,448 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:30,450 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:30,453 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:30,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 57 [2018-04-11 22:12:30,470 INFO L267 ElimStorePlain]: Start of recursive call 28: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-04-11 22:12:30,544 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-04-11 22:12:31,188 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:31,190 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 49 [2018-04-11 22:12:31,201 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:31,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 38 [2018-04-11 22:12:31,211 INFO L267 ElimStorePlain]: Start of recursive call 30: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-11 22:12:31,239 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-11 22:12:31,241 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:31,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 53 [2018-04-11 22:12:31,254 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:31,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 35 [2018-04-11 22:12:31,264 INFO L267 ElimStorePlain]: Start of recursive call 32: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-11 22:12:31,297 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-11 22:12:31,934 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:31,935 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 47 [2018-04-11 22:12:31,945 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:31,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 35 [2018-04-11 22:12:31,955 INFO L267 ElimStorePlain]: Start of recursive call 34: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-11 22:12:31,982 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-11 22:12:32,580 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:32,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 52 [2018-04-11 22:12:32,584 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:32,584 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:32,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2018-04-11 22:12:32,588 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:12:32,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-11 22:12:32,599 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:32,605 INFO L267 ElimStorePlain]: Start of recursive call 35: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:12:32,607 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:32,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 48 [2018-04-11 22:12:32,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-11 22:12:32,611 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:32,620 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:32,621 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:32,621 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:32,621 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:32,629 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 31 treesize of output 31 [2018-04-11 22:12:32,629 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:12:32,638 INFO L267 ElimStorePlain]: Start of recursive call 38: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:12:33,161 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:33,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 54 [2018-04-11 22:12:33,192 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 37 treesize of output 37 [2018-04-11 22:12:33,193 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 22:12:33,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2018-04-11 22:12:33,221 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:33,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 23 [2018-04-11 22:12:33,244 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:33,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-04-11 22:12:33,245 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:33,269 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:33,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 38 [2018-04-11 22:12:33,279 INFO L267 ElimStorePlain]: Start of recursive call 46: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-11 22:12:33,314 INFO L267 ElimStorePlain]: Start of recursive call 41: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-04-11 22:12:33,855 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:33,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 44 [2018-04-11 22:12:33,858 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:33,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2018-04-11 22:12:33,860 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:12:33,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-11 22:12:33,869 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:33,873 INFO L267 ElimStorePlain]: Start of recursive call 47: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:12:33,875 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:33,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2018-04-11 22:12:33,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-11 22:12:33,878 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:33,888 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:33,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 35 [2018-04-11 22:12:33,897 INFO L267 ElimStorePlain]: Start of recursive call 52: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-11 22:12:33,918 INFO L267 ElimStorePlain]: Start of recursive call 50: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-04-11 22:12:34,454 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:34,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 60 [2018-04-11 22:12:34,490 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:34,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2018-04-11 22:12:34,492 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:12:34,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-04-11 22:12:34,524 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:34,548 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:34,549 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:34,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 37 [2018-04-11 22:12:34,552 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:12:34,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 21 [2018-04-11 22:12:34,575 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:34,590 INFO L267 ElimStorePlain]: Start of recursive call 53: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 22:12:34,592 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:34,594 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 56 treesize of output 48 [2018-04-11 22:12:34,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-11 22:12:34,596 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:34,605 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:34,606 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:34,606 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:34,606 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:34,608 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 31 treesize of output 31 [2018-04-11 22:12:34,609 INFO L267 ElimStorePlain]: Start of recursive call 60: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:12:34,618 INFO L267 ElimStorePlain]: Start of recursive call 58: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:12:34,620 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:34,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 49 [2018-04-11 22:12:34,632 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:34,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-04-11 22:12:34,634 INFO L267 ElimStorePlain]: Start of recursive call 62: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:12:34,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-11 22:12:34,643 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:34,647 INFO L267 ElimStorePlain]: Start of recursive call 61: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:12:35,137 INFO L267 ElimStorePlain]: Start of recursive call 9: 3 dim-1 vars, 8 dim-2 vars, End of recursive call: 34 dim-0 vars, and 43 xjuncts. [2018-04-11 22:12:35,636 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 34 dim-0 vars, and 43 xjuncts. [2018-04-11 22:12:35,639 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:35,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 159 treesize of output 107 [2018-04-11 22:12:35,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-04-11 22:12:35,645 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:35,659 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:35,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 99 treesize of output 111 [2018-04-11 22:12:36,173 WARN L151 SmtUtils]: Spent 480ms on a formula simplification. DAG size of input: 308 DAG size of output 225 [2018-04-11 22:12:36,176 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 69 treesize of output 68 [2018-04-11 22:12:36,177 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:36,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 60 treesize of output 85 [2018-04-11 22:12:36,534 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 8 xjuncts. [2018-04-11 22:12:36,904 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:36,906 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 62 treesize of output 66 [2018-04-11 22:12:36,906 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:36,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 69 [2018-04-11 22:12:36,910 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:37,255 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:37,256 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 66 treesize of output 55 [2018-04-11 22:12:37,270 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:37,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 36 treesize of output 67 [2018-04-11 22:12:37,294 INFO L267 ElimStorePlain]: Start of recursive call 72: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 32 xjuncts. [2018-04-11 22:12:37,503 INFO L267 ElimStorePlain]: Start of recursive call 71: 1 dim-1 vars, End of recursive call: 8 dim-0 vars, and 16 xjuncts. [2018-04-11 22:12:38,154 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:38,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 56 [2018-04-11 22:12:38,170 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 15 treesize of output 10 [2018-04-11 22:12:38,170 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 2 xjuncts. [2018-04-11 22:12:38,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-11 22:12:38,184 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-04-11 22:12:38,194 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:38,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2018-04-11 22:12:38,196 INFO L267 ElimStorePlain]: Start of recursive call 76: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:12:38,204 INFO L267 ElimStorePlain]: Start of recursive call 73: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 22:12:38,860 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:38,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 68 [2018-04-11 22:12:38,901 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 51 treesize of output 47 [2018-04-11 22:12:38,901 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 2 xjuncts. [2018-04-11 22:12:38,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 52 [2018-04-11 22:12:38,948 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 2 xjuncts. [2018-04-11 22:12:38,996 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:38,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2018-04-11 22:12:38,998 INFO L267 ElimStorePlain]: Start of recursive call 80: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:12:39,000 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:39,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 33 [2018-04-11 22:12:39,002 INFO L267 ElimStorePlain]: Start of recursive call 81: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:12:39,049 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:39,050 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:39,052 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 46 treesize of output 35 [2018-04-11 22:12:39,053 INFO L267 ElimStorePlain]: Start of recursive call 82: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:12:39,055 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:39,055 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:39,058 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 47 treesize of output 36 [2018-04-11 22:12:39,058 INFO L267 ElimStorePlain]: Start of recursive call 83: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:12:39,100 INFO L267 ElimStorePlain]: Start of recursive call 77: 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2018-04-11 22:12:39,102 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:39,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 56 [2018-04-11 22:12:39,110 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 15 treesize of output 10 [2018-04-11 22:12:39,110 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 2 xjuncts. [2018-04-11 22:12:39,122 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:39,123 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:39,123 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:39,123 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:39,125 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 31 treesize of output 31 [2018-04-11 22:12:39,126 INFO L267 ElimStorePlain]: Start of recursive call 86: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:12:39,137 INFO L267 ElimStorePlain]: Start of recursive call 84: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 22:12:39,139 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:39,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 57 [2018-04-11 22:12:39,154 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:39,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2018-04-11 22:12:39,155 INFO L267 ElimStorePlain]: Start of recursive call 88: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:12:39,169 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 15 treesize of output 10 [2018-04-11 22:12:39,169 INFO L267 ElimStorePlain]: Start of recursive call 89: End of recursive call: and 2 xjuncts. [2018-04-11 22:12:39,177 INFO L267 ElimStorePlain]: Start of recursive call 87: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 22:12:39,871 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:39,872 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 69 treesize of output 60 [2018-04-11 22:12:39,874 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:39,875 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:39,877 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 33 treesize of output 25 [2018-04-11 22:12:39,878 INFO L267 ElimStorePlain]: Start of recursive call 91: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:12:39,894 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 15 treesize of output 10 [2018-04-11 22:12:39,894 INFO L267 ElimStorePlain]: Start of recursive call 92: End of recursive call: and 2 xjuncts. [2018-04-11 22:12:39,903 INFO L267 ElimStorePlain]: Start of recursive call 90: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 22:12:39,904 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:39,906 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 63 treesize of output 56 [2018-04-11 22:12:39,908 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:39,908 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:39,909 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:39,909 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:39,911 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 31 treesize of output 31 [2018-04-11 22:12:39,912 INFO L267 ElimStorePlain]: Start of recursive call 94: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:12:39,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2018-04-11 22:12:39,934 INFO L267 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 2 xjuncts. [2018-04-11 22:12:39,947 INFO L267 ElimStorePlain]: Start of recursive call 93: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 22:12:40,813 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:40,817 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:12:40,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 77 [2018-04-11 22:12:40,909 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:40,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 51 treesize of output 82 [2018-04-11 22:12:40,935 INFO L267 ElimStorePlain]: Start of recursive call 97: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 32 xjuncts. [2018-04-11 22:12:41,345 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:41,347 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:41,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 51 treesize of output 99 [2018-04-11 22:12:41,377 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-11 22:12:41,405 INFO L267 ElimStorePlain]: Start of recursive call 98: 32 dim-0 vars, End of recursive call: 32 dim-0 vars, and 128 xjuncts. [2018-04-11 22:12:42,988 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:42,990 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:43,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 51 treesize of output 99 [2018-04-11 22:12:43,021 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-11 22:12:43,036 INFO L267 ElimStorePlain]: Start of recursive call 99: 32 dim-0 vars, End of recursive call: 32 dim-0 vars, and 128 xjuncts. [2018-04-11 22:12:44,973 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:44,975 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:45,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 48 treesize of output 96 [2018-04-11 22:12:45,005 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-11 22:12:45,020 INFO L267 ElimStorePlain]: Start of recursive call 100: 32 dim-0 vars, End of recursive call: 32 dim-0 vars, and 128 xjuncts. [2018-04-11 22:12:47,092 INFO L267 ElimStorePlain]: Start of recursive call 96: 4 dim-1 vars, End of recursive call: 32 dim-0 vars, and 54 xjuncts. [2018-04-11 22:12:47,094 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:47,095 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:12:47,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 60 [2018-04-11 22:12:47,102 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:47,102 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:47,104 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:47,107 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:47,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 45 treesize of output 99 [2018-04-11 22:12:47,134 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-11 22:12:47,147 INFO L267 ElimStorePlain]: Start of recursive call 102: 32 dim-0 vars, End of recursive call: 32 dim-0 vars, and 80 xjuncts. [2018-04-11 22:12:48,365 INFO L267 ElimStorePlain]: Start of recursive call 101: 1 dim-1 vars, End of recursive call: 32 dim-0 vars, and 44 xjuncts. [2018-04-11 22:12:48,372 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:48,376 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:12:48,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 66 [2018-04-11 22:12:48,412 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:48,414 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:48,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 48 treesize of output 104 [2018-04-11 22:12:48,449 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-04-11 22:12:48,490 INFO L267 ElimStorePlain]: Start of recursive call 104: 64 dim-0 vars, End of recursive call: 64 dim-0 vars, and 256 xjuncts. [2018-04-11 22:12:50,812 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:50,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 42 treesize of output 73 [2018-04-11 22:12:50,838 INFO L267 ElimStorePlain]: Start of recursive call 105: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 32 xjuncts. [2018-04-11 22:12:51,728 INFO L267 ElimStorePlain]: Start of recursive call 103: 2 dim-1 vars, End of recursive call: 18 dim-0 vars, and 49 xjuncts. [2018-04-11 22:12:58,472 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:58,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 61 [2018-04-11 22:12:58,488 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:58,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 36 treesize of output 67 [2018-04-11 22:12:58,513 INFO L267 ElimStorePlain]: Start of recursive call 107: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 32 xjuncts. [2018-04-11 22:12:58,728 INFO L267 ElimStorePlain]: Start of recursive call 106: 1 dim-1 vars, End of recursive call: 8 dim-0 vars, and 16 xjuncts. [2018-04-11 22:12:58,730 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:58,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 57 [2018-04-11 22:12:58,745 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:12:58,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 39 treesize of output 70 [2018-04-11 22:12:58,768 INFO L267 ElimStorePlain]: Start of recursive call 109: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 32 xjuncts. [2018-04-11 22:12:58,971 INFO L267 ElimStorePlain]: Start of recursive call 108: 1 dim-1 vars, End of recursive call: 8 dim-0 vars, and 16 xjuncts. [2018-04-11 22:13:05,903 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:13:05,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 62 [2018-04-11 22:13:05,952 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 59 [2018-04-11 22:13:05,954 INFO L267 ElimStorePlain]: Start of recursive call 111: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-04-11 22:13:06,030 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2018-04-11 22:13:06,030 INFO L267 ElimStorePlain]: Start of recursive call 112: End of recursive call: and 1 xjuncts. [2018-04-11 22:13:06,094 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:13:06,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 44 treesize of output 70 [2018-04-11 22:13:06,116 INFO L267 ElimStorePlain]: Start of recursive call 113: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 32 xjuncts. [2018-04-11 22:13:06,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-04-11 22:13:06,322 INFO L267 ElimStorePlain]: Start of recursive call 114: End of recursive call: and 1 xjuncts. [2018-04-11 22:13:06,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 28 treesize of output 22 [2018-04-11 22:13:06,324 INFO L267 ElimStorePlain]: Start of recursive call 115: End of recursive call: and 1 xjuncts. [2018-04-11 22:13:06,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 30 [2018-04-11 22:13:06,326 INFO L267 ElimStorePlain]: Start of recursive call 116: End of recursive call: and 1 xjuncts. [2018-04-11 22:13:06,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2018-04-11 22:13:06,328 INFO L267 ElimStorePlain]: Start of recursive call 117: End of recursive call: and 1 xjuncts. [2018-04-11 22:13:06,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-04-11 22:13:06,330 INFO L267 ElimStorePlain]: Start of recursive call 118: End of recursive call: and 1 xjuncts. [2018-04-11 22:13:06,465 INFO L267 ElimStorePlain]: Start of recursive call 110: 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 15 xjuncts. [2018-04-11 22:13:13,404 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:13:13,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 57 [2018-04-11 22:13:13,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-11 22:13:13,407 INFO L267 ElimStorePlain]: Start of recursive call 120: End of recursive call: and 1 xjuncts. [2018-04-11 22:13:13,417 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:13:13,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 30 [2018-04-11 22:13:13,423 INFO L267 ElimStorePlain]: Start of recursive call 121: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 22:13:13,439 INFO L267 ElimStorePlain]: Start of recursive call 119: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 22:13:13,440 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:13:13,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 57 [2018-04-11 22:13:13,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-11 22:13:13,443 INFO L267 ElimStorePlain]: Start of recursive call 123: End of recursive call: and 1 xjuncts. [2018-04-11 22:13:13,455 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:13:13,455 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:13:13,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 34 [2018-04-11 22:13:13,462 INFO L267 ElimStorePlain]: Start of recursive call 124: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 22:13:13,480 INFO L267 ElimStorePlain]: Start of recursive call 122: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 22:13:13,482 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:13:13,484 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 63 treesize of output 54 [2018-04-11 22:13:13,498 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:13:13,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 67 [2018-04-11 22:13:13,532 INFO L267 ElimStorePlain]: Start of recursive call 126: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 32 xjuncts. [2018-04-11 22:13:13,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-11 22:13:13,673 INFO L267 ElimStorePlain]: Start of recursive call 127: End of recursive call: and 1 xjuncts. [2018-04-11 22:13:13,756 INFO L267 ElimStorePlain]: Start of recursive call 125: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 10 xjuncts. [2018-04-11 22:13:13,758 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:13:13,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 54 [2018-04-11 22:13:13,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-11 22:13:13,762 INFO L267 ElimStorePlain]: Start of recursive call 129: End of recursive call: and 1 xjuncts. [2018-04-11 22:13:13,775 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:13:13,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2018-04-11 22:13:13,777 INFO L267 ElimStorePlain]: Start of recursive call 130: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:13:13,785 INFO L267 ElimStorePlain]: Start of recursive call 128: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:13:20,944 INFO L267 ElimStorePlain]: Start of recursive call 66: 3 dim-1 vars, 8 dim-2 vars, End of recursive call: 129 dim-0 vars, and 163 xjuncts. [2018-04-11 22:13:27,854 INFO L267 ElimStorePlain]: Start of recursive call 64: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 129 dim-0 vars, and 162 xjuncts. [2018-04-11 22:13:38,861 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:13:38,883 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 158 treesize of output 121 [2018-04-11 22:13:38,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 108 [2018-04-11 22:13:38,887 INFO L267 ElimStorePlain]: Start of recursive call 132: End of recursive call: and 1 xjuncts. [2018-04-11 22:13:38,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 103 treesize of output 127 [2018-04-11 22:13:38,959 INFO L267 ElimStorePlain]: Start of recursive call 133: End of recursive call: and 4 xjuncts. [2018-04-11 22:13:39,094 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:13:39,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 105 treesize of output 134 [2018-04-11 22:13:39,141 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-11 22:13:41,796 WARN L151 SmtUtils]: Spent 2635ms on a formula simplification. DAG size of input: 888 DAG size of output 580 [2018-04-11 22:13:41,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 78 [2018-04-11 22:13:41,801 INFO L267 ElimStorePlain]: Start of recursive call 135: End of recursive call: and 1 xjuncts. [2018-04-11 22:13:41,807 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 94 treesize of output 95 [2018-04-11 22:13:41,807 INFO L267 ElimStorePlain]: Start of recursive call 136: End of recursive call: and 1 xjuncts. [2018-04-11 22:13:41,810 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 74 treesize of output 75 [2018-04-11 22:13:41,810 INFO L267 ElimStorePlain]: Start of recursive call 137: End of recursive call: and 1 xjuncts. [2018-04-11 22:13:43,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 74 [2018-04-11 22:13:43,403 INFO L267 ElimStorePlain]: Start of recursive call 138: End of recursive call: and 1 xjuncts. [2018-04-11 22:13:44,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 69 treesize of output 93 [2018-04-11 22:13:44,832 INFO L267 ElimStorePlain]: Start of recursive call 139: End of recursive call: and 4 xjuncts. [2018-04-11 22:13:46,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 64 treesize of output 89 [2018-04-11 22:13:46,409 INFO L267 ElimStorePlain]: Start of recursive call 140: End of recursive call: and 8 xjuncts. [2018-04-11 22:13:48,202 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:13:48,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 69 [2018-04-11 22:13:48,207 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:13:48,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2018-04-11 22:13:48,209 INFO L267 ElimStorePlain]: Start of recursive call 142: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:13:48,230 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 15 treesize of output 10 [2018-04-11 22:13:48,230 INFO L267 ElimStorePlain]: Start of recursive call 143: End of recursive call: and 2 xjuncts. [2018-04-11 22:13:48,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-11 22:13:48,244 INFO L267 ElimStorePlain]: Start of recursive call 144: End of recursive call: and 1 xjuncts. [2018-04-11 22:13:48,254 INFO L267 ElimStorePlain]: Start of recursive call 141: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 22:13:48,256 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:13:48,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 67 [2018-04-11 22:13:48,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-11 22:13:48,262 INFO L267 ElimStorePlain]: Start of recursive call 146: End of recursive call: and 1 xjuncts. [2018-04-11 22:13:48,278 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:13:48,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2018-04-11 22:13:48,280 INFO L267 ElimStorePlain]: Start of recursive call 147: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:13:48,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-11 22:13:48,292 INFO L267 ElimStorePlain]: Start of recursive call 148: End of recursive call: and 1 xjuncts. [2018-04-11 22:13:48,301 INFO L267 ElimStorePlain]: Start of recursive call 145: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:13:48,303 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:13:48,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 71 [2018-04-11 22:13:48,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-11 22:13:48,308 INFO L267 ElimStorePlain]: Start of recursive call 150: End of recursive call: and 1 xjuncts. [2018-04-11 22:13:48,323 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:13:48,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 39 [2018-04-11 22:13:48,334 INFO L267 ElimStorePlain]: Start of recursive call 151: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-11 22:13:48,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, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2018-04-11 22:13:48,367 INFO L267 ElimStorePlain]: Start of recursive call 152: End of recursive call: and 2 xjuncts. [2018-04-11 22:13:48,386 INFO L267 ElimStorePlain]: Start of recursive call 149: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 6 xjuncts. [2018-04-11 22:13:48,389 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:13:48,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 69 [2018-04-11 22:13:48,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-11 22:13:48,394 INFO L267 ElimStorePlain]: Start of recursive call 154: End of recursive call: and 1 xjuncts. [2018-04-11 22:13:48,409 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:13:48,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 39 [2018-04-11 22:13:48,420 INFO L267 ElimStorePlain]: Start of recursive call 155: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-11 22:13:48,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-11 22:13:48,448 INFO L267 ElimStorePlain]: Start of recursive call 156: End of recursive call: and 1 xjuncts. [2018-04-11 22:13:48,466 INFO L267 ElimStorePlain]: Start of recursive call 153: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-04-11 22:13:50,405 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:13:50,409 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:13:50,409 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:13:50,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 86 [2018-04-11 22:13:50,480 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:13:50,482 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:13:50,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 59 treesize of output 110 [2018-04-11 22:13:50,517 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-04-11 22:13:50,551 INFO L267 ElimStorePlain]: Start of recursive call 158: 64 dim-0 vars, End of recursive call: 64 dim-0 vars, and 256 xjuncts. [2018-04-11 22:13:53,338 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:13:53,340 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:13:53,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 56 treesize of output 107 [2018-04-11 22:13:53,376 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-04-11 22:13:53,410 INFO L267 ElimStorePlain]: Start of recursive call 159: 64 dim-0 vars, End of recursive call: 64 dim-0 vars, and 256 xjuncts. [2018-04-11 22:13:57,744 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:13:57,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 48 treesize of output 79 [2018-04-11 22:13:57,768 INFO L267 ElimStorePlain]: Start of recursive call 160: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 32 xjuncts. [2018-04-11 22:13:59,935 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:13:59,938 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:13:59,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 53 treesize of output 104 [2018-04-11 22:13:59,975 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-04-11 22:14:00,007 INFO L267 ElimStorePlain]: Start of recursive call 161: 64 dim-0 vars, End of recursive call: 64 dim-0 vars, and 256 xjuncts. [2018-04-11 22:14:04,914 INFO L267 ElimStorePlain]: Start of recursive call 157: 4 dim-1 vars, End of recursive call: 38 dim-0 vars, and 69 xjuncts. [2018-04-11 22:14:04,920 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:14:04,924 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:14:04,924 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:14:04,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 97 [2018-04-11 22:14:05,082 WARN L148 SmtUtils]: Spent 142ms on a formula simplification that was a NOOP. DAG size: 166 [2018-04-11 22:14:05,087 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:14:05,089 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:14:05,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 65 treesize of output 108 [2018-04-11 22:14:05,120 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-11 22:14:05,136 INFO L267 ElimStorePlain]: Start of recursive call 163: 32 dim-0 vars, End of recursive call: 32 dim-0 vars, and 128 xjuncts. [2018-04-11 22:14:06,629 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:14:06,631 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:14:06,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 59 treesize of output 102 [2018-04-11 22:14:06,664 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-11 22:14:06,685 INFO L267 ElimStorePlain]: Start of recursive call 164: 32 dim-0 vars, End of recursive call: 32 dim-0 vars, and 128 xjuncts. [2018-04-11 22:14:08,571 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:14:08,573 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:14:08,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 62 treesize of output 105 [2018-04-11 22:14:08,604 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-11 22:14:08,621 INFO L267 ElimStorePlain]: Start of recursive call 165: 32 dim-0 vars, End of recursive call: 32 dim-0 vars, and 128 xjuncts. [2018-04-11 22:14:10,737 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:14:10,739 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:14:10,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 56 treesize of output 99 [2018-04-11 22:14:10,769 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-11 22:14:10,786 INFO L267 ElimStorePlain]: Start of recursive call 166: 32 dim-0 vars, End of recursive call: 32 dim-0 vars, and 128 xjuncts. [2018-04-11 22:14:13,296 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:14:13,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 54 treesize of output 85 [2018-04-11 22:14:13,323 INFO L267 ElimStorePlain]: Start of recursive call 167: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 32 xjuncts. [2018-04-11 22:14:15,426 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:14:15,428 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:14:15,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 59 treesize of output 102 [2018-04-11 22:14:15,463 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-11 22:14:15,479 INFO L267 ElimStorePlain]: Start of recursive call 168: 32 dim-0 vars, End of recursive call: 32 dim-0 vars, and 128 xjuncts. [2018-04-11 22:14:19,129 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:14:19,132 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:14:19,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 62 treesize of output 105 [2018-04-11 22:14:19,167 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-11 22:14:19,183 INFO L267 ElimStorePlain]: Start of recursive call 169: 32 dim-0 vars, End of recursive call: 32 dim-0 vars, and 128 xjuncts. [2018-04-11 22:14:23,408 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:14:23,411 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:14:23,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 59 treesize of output 102 [2018-04-11 22:14:23,451 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-11 22:14:23,477 INFO L267 ElimStorePlain]: Start of recursive call 170: 32 dim-0 vars, End of recursive call: 32 dim-0 vars, and 128 xjuncts. [2018-04-11 22:14:27,993 INFO L267 ElimStorePlain]: Start of recursive call 162: 8 dim-1 vars, End of recursive call: 64 dim-0 vars, and 86 xjuncts. [2018-04-11 22:14:27,996 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:14:27,998 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:14:27,998 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 22:14:27,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 76 [2018-04-11 22:14:28,005 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:14:28,005 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:14:28,007 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:14:28,010 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:14:28,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 45 treesize of output 99 [2018-04-11 22:14:28,036 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-04-11 22:14:28,048 INFO L267 ElimStorePlain]: Start of recursive call 172: 32 dim-0 vars, End of recursive call: 32 dim-0 vars, and 80 xjuncts. [2018-04-11 22:14:29,360 INFO L267 ElimStorePlain]: Start of recursive call 171: 1 dim-1 vars, End of recursive call: 32 dim-0 vars, and 44 xjuncts. [2018-04-11 22:14:49,301 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:14:49,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 69 [2018-04-11 22:14:49,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2018-04-11 22:14:49,360 INFO L267 ElimStorePlain]: Start of recursive call 174: End of recursive call: and 1 xjuncts. [2018-04-11 22:14:49,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-04-11 22:14:49,385 INFO L267 ElimStorePlain]: Start of recursive call 175: End of recursive call: and 1 xjuncts. [2018-04-11 22:14:49,408 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:14:49,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 74 [2018-04-11 22:14:49,432 INFO L267 ElimStorePlain]: Start of recursive call 176: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 32 xjuncts. [2018-04-11 22:14:49,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 54 [2018-04-11 22:14:49,619 INFO L267 ElimStorePlain]: Start of recursive call 177: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 8 xjuncts. [2018-04-11 22:14:49,779 INFO L267 ElimStorePlain]: Start of recursive call 173: 4 dim-1 vars, End of recursive call: 4 dim-0 vars, and 15 xjuncts. [2018-04-11 22:15:10,468 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:15:10,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 58 [2018-04-11 22:15:10,475 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:15:10,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 67 [2018-04-11 22:15:10,499 INFO L267 ElimStorePlain]: Start of recursive call 179: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 32 xjuncts. [2018-04-11 22:15:10,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-11 22:15:10,636 INFO L267 ElimStorePlain]: Start of recursive call 180: End of recursive call: and 1 xjuncts. [2018-04-11 22:15:10,714 INFO L267 ElimStorePlain]: Start of recursive call 178: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 10 xjuncts. [2018-04-11 22:15:10,716 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:15:10,717 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 68 treesize of output 61 [2018-04-11 22:15:10,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-11 22:15:10,719 INFO L267 ElimStorePlain]: Start of recursive call 182: End of recursive call: and 1 xjuncts. [2018-04-11 22:15:10,732 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:15:10,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 30 [2018-04-11 22:15:10,738 INFO L267 ElimStorePlain]: Start of recursive call 183: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 22:15:10,758 INFO L267 ElimStorePlain]: Start of recursive call 181: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 22:15:10,760 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:15:10,761 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 68 treesize of output 61 [2018-04-11 22:15:10,763 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:15:10,763 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:15:10,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 34 [2018-04-11 22:15:10,770 INFO L267 ElimStorePlain]: Start of recursive call 185: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 22:15:10,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-04-11 22:15:10,793 INFO L267 ElimStorePlain]: Start of recursive call 186: End of recursive call: and 1 xjuncts. [2018-04-11 22:15:10,804 INFO L267 ElimStorePlain]: Start of recursive call 184: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 22:15:10,806 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:15:10,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 58 [2018-04-11 22:15:10,809 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:15:10,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2018-04-11 22:15:10,811 INFO L267 ElimStorePlain]: Start of recursive call 188: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:15:10,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-11 22:15:10,824 INFO L267 ElimStorePlain]: Start of recursive call 189: End of recursive call: and 1 xjuncts. [2018-04-11 22:15:10,831 INFO L267 ElimStorePlain]: Start of recursive call 187: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:15:31,661 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:15:31,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 72 [2018-04-11 22:15:31,703 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:15:31,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 46 [2018-04-11 22:15:31,705 INFO L267 ElimStorePlain]: Start of recursive call 191: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:15:31,735 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:15:31,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 40 [2018-04-11 22:15:31,737 INFO L267 ElimStorePlain]: Start of recursive call 192: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:15:31,767 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 38 treesize of output 34 [2018-04-11 22:15:31,768 INFO L267 ElimStorePlain]: Start of recursive call 193: End of recursive call: and 2 xjuncts. [2018-04-11 22:15:31,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2018-04-11 22:15:31,798 INFO L267 ElimStorePlain]: Start of recursive call 194: End of recursive call: and 1 xjuncts. [2018-04-11 22:15:31,825 INFO L267 ElimStorePlain]: Start of recursive call 190: 4 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-04-11 22:15:31,827 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:15:31,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 68 [2018-04-11 22:15:31,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 48 [2018-04-11 22:15:31,838 INFO L267 ElimStorePlain]: Start of recursive call 196: End of recursive call: and 1 xjuncts. [2018-04-11 22:15:31,865 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:15:31,866 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:15:31,866 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:15:31,866 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:15:31,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 56 [2018-04-11 22:15:31,869 INFO L267 ElimStorePlain]: Start of recursive call 197: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:15:31,894 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:15:31,895 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:15:31,895 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:15:31,895 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:15:31,897 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 45 treesize of output 45 [2018-04-11 22:15:31,898 INFO L267 ElimStorePlain]: Start of recursive call 198: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 22:15:31,925 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 40 treesize of output 36 [2018-04-11 22:15:31,925 INFO L267 ElimStorePlain]: Start of recursive call 199: End of recursive call: and 2 xjuncts. [2018-04-11 22:15:31,949 INFO L267 ElimStorePlain]: Start of recursive call 195: 4 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-04-11 22:15:31,953 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:15:31,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 83 [2018-04-11 22:15:32,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 61 [2018-04-11 22:15:32,046 INFO L267 ElimStorePlain]: Start of recursive call 201: End of recursive call: and 2 xjuncts. Received shutdown request... [2018-04-11 22:15:32,135 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:15:32,135 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 22:15:32,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 48 [2018-04-11 22:15:32,139 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-11 22:15:32,139 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-11 22:15:32,144 WARN L197 ceAbstractionStarter]: Timeout [2018-04-11 22:15:32,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 10:15:32 BoogieIcfgContainer [2018-04-11 22:15:32,144 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 22:15:32,145 INFO L168 Benchmark]: Toolchain (without parser) took 250322.52 ms. Allocated memory was 304.6 MB in the beginning and 388.0 MB in the end (delta: 83.4 MB). Free memory was 242.1 MB in the beginning and 305.7 MB in the end (delta: -63.6 MB). Peak memory consumption was 369.7 MB. Max. memory is 5.3 GB. [2018-04-11 22:15:32,146 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 304.6 MB. Free memory is still 266.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 22:15:32,146 INFO L168 Benchmark]: CACSL2BoogieTranslator took 343.93 ms. Allocated memory is still 304.6 MB. Free memory was 242.1 MB in the beginning and 215.8 MB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 5.3 GB. [2018-04-11 22:15:32,146 INFO L168 Benchmark]: Boogie Preprocessor took 67.83 ms. Allocated memory is still 304.6 MB. Free memory was 215.8 MB in the beginning and 212.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. [2018-04-11 22:15:32,147 INFO L168 Benchmark]: RCFGBuilder took 746.41 ms. Allocated memory was 304.6 MB in the beginning and 468.2 MB in the end (delta: 163.6 MB). Free memory was 212.9 MB in the beginning and 380.4 MB in the end (delta: -167.6 MB). Peak memory consumption was 21.8 MB. Max. memory is 5.3 GB. [2018-04-11 22:15:32,147 INFO L168 Benchmark]: TraceAbstraction took 249159.72 ms. Allocated memory was 468.2 MB in the beginning and 388.0 MB in the end (delta: -80.2 MB). Free memory was 380.4 MB in the beginning and 305.7 MB in the end (delta: 74.7 MB). Peak memory consumption was 344.5 MB. Max. memory is 5.3 GB. [2018-04-11 22:15:32,148 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.15 ms. Allocated memory is still 304.6 MB. Free memory is still 266.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 343.93 ms. Allocated memory is still 304.6 MB. Free memory was 242.1 MB in the beginning and 215.8 MB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 67.83 ms. Allocated memory is still 304.6 MB. Free memory was 215.8 MB in the beginning and 212.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 746.41 ms. Allocated memory was 304.6 MB in the beginning and 468.2 MB in the end (delta: 163.6 MB). Free memory was 212.9 MB in the beginning and 380.4 MB in the end (delta: -167.6 MB). Peak memory consumption was 21.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 249159.72 ms. Allocated memory was 468.2 MB in the beginning and 388.0 MB in the end (delta: -80.2 MB). Free memory was 380.4 MB in the beginning and 305.7 MB in the end (delta: 74.7 MB). Peak memory consumption was 344.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 680]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 662]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 662). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 686]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 686). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 659]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 659). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 661]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 668]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 668). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 628]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 628). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 663]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 674]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 674). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 663]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 690]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 690). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 691]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 691). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 650]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 677]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 644]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 667]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 686]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 686). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 653]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 671]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 671). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 663]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 687]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 687). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 647]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 691]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 691). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 661]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 672]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 647]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 671]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 671). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 680]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 680). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 664]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 664). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 667]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 642]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 642). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 648]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 648). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 667]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 691]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 691). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 690]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 690). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 663]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 663). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 660]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 669]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 677]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 677). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 668]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 668). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 653]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 653). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 661]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 640]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 640). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 684]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 684). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 672]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 672). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 659]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 659). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 661]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 661). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 692]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 692). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 687]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 687). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 662]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 662). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 638]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 638). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 691]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 691). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 647]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 692]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 692). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 684]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 684). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 644]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 644). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 660]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 660). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 647]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 647). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 664]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 664). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 667]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 667). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 674]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 674). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 650]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 650). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - TimeoutResultAtElement [Line: 669]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 669). Cancelled while BasicCegarLoop was analyzing trace of length 105 with TraceHistMax 3, while TraceCheckSpWp was constructing backward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while CnfTransformerHelper was transforming 0 disjunction. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 201 locations, 67 error locations. TIMEOUT Result, 249.1s OverallTime, 31 OverallIterations, 3 TraceHistogramMax, 46.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5593 SDtfs, 15880 SDslu, 28966 SDs, 0 SdLazy, 13863 SolverSat, 1013 SolverUnsat, 30 SolverUnknown, 0 SolverNotchecked, 33.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3802 GetRequests, 3118 SyntacticMatches, 28 SemanticMatches, 656 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 6145 ImplicationChecksByTransitivity, 22.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=473occurred in iteration=26, 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.4s AutomataMinimizationTime, 30 MinimizatonAttempts, 3970 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 14.1s InterpolantComputationTime, 1735 NumberOfCodeBlocks, 1735 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 3410 ConstructedInterpolants, 280 QuantifiedInterpolants, 2217597 SizeOfPredicates, 277 NumberOfNonLiveVariables, 4963 ConjunctsInSsa, 475 ConjunctsInUnsatCore, 60 InterpolantComputations, 43 PerfectInterpolantSequences, 499/642 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-0513_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_22-15-32-156.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0513_1_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_22-15-32-156.csv Completed graceful shutdown