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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-reverse_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-10 16:31:18,877 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-10 16:31:18,878 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-10 16:31:18,890 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-10 16:31:18,890 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-10 16:31:18,891 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-10 16:31:18,892 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-10 16:31:18,893 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-10 16:31:18,895 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-10 16:31:18,896 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-10 16:31:18,896 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-10 16:31:18,896 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-10 16:31:18,897 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-10 16:31:18,898 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-10 16:31:18,899 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-10 16:31:18,900 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-10 16:31:18,902 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-10 16:31:18,903 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-10 16:31:18,904 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-10 16:31:18,905 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-10 16:31:18,907 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-10 16:31:18,907 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-10 16:31:18,907 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-10 16:31:18,908 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-10 16:31:18,909 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-10 16:31:18,910 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-10 16:31:18,910 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-10 16:31:18,910 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-10 16:31:18,911 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-10 16:31:18,911 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-10 16:31:18,912 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-10 16:31:18,912 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-04-10 16:31:18,930 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-10 16:31:18,930 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-10 16:31:18,931 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-10 16:31:18,931 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-10 16:31:18,932 INFO L133 SettingsManager]: * Use SBE=true [2018-04-10 16:31:18,932 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-10 16:31:18,932 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-10 16:31:18,932 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-10 16:31:18,932 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-10 16:31:18,932 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-10 16:31:18,932 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-10 16:31:18,933 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-10 16:31:18,933 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-10 16:31:18,933 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-10 16:31:18,933 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-10 16:31:18,933 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-10 16:31:18,933 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-10 16:31:18,934 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-10 16:31:18,934 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-10 16:31:18,934 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-10 16:31:18,934 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-10 16:31:18,934 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-10 16:31:18,934 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-10 16:31:18,934 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL [2018-04-10 16:31:18,964 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-10 16:31:18,975 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-10 16:31:18,978 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-10 16:31:18,980 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-10 16:31:18,980 INFO L276 PluginConnector]: CDTParser initialized [2018-04-10 16:31:18,980 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,294 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG964862af9 [2018-04-10 16:31:19,429 INFO L287 CDTParser]: IsIndexed: true [2018-04-10 16:31:19,429 INFO L288 CDTParser]: Found 1 translation units. [2018-04-10 16:31:19,430 INFO L168 CDTParser]: Scanning dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,437 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-10 16:31:19,437 INFO L215 ultiparseSymbolTable]: [2018-04-10 16:31:19,437 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-10 16:31:19,437 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,437 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-10 16:31:19,437 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__nlink_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,437 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__pthread_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,438 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____fd_mask in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,438 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__wchar_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,438 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__loff_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,438 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____int64_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,438 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__uint in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,438 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__u_int8_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,438 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____uid_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,438 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__pthread_once_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,438 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__dev_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,438 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__pthread_condattr_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,438 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____daddr_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,438 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__id_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,438 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__pthread_spinlock_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,438 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__quad_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,438 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____fsblkcnt64_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,438 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____clockid_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,438 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____uint8_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,439 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____key_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,439 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____blkcnt_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,439 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__ushort in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,439 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__u_int16_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,439 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__pthread_cond_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,439 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____syscall_slong_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,439 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__off_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,439 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____u_int in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,439 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__ldiv_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,439 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____u_quad_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,439 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__pthread_barrier_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,439 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____useconds_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,439 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____fsfilcnt64_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,439 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__pthread_attr_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,439 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__register_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,440 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____quad_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,440 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____ssize_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,440 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____off_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,440 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____ino64_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,440 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__fsfilcnt_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,440 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____pid_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,440 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____timer_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,440 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__pthread_mutexattr_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,440 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____gid_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,440 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__u_int in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,440 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__sigset_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,440 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__timer_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,440 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__u_int32_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,441 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____int32_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,441 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__clockid_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,441 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____fsword_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,441 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____pthread_slist_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,441 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__ssize_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,441 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____blkcnt64_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,441 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____sig_atomic_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,441 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__pthread_rwlockattr_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,441 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____uint64_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,441 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__fd_mask in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,441 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__idtype_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,442 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__key_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,442 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____nlink_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,442 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__int32_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,442 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____id_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,442 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__lldiv_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,442 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__pthread_rwlock_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,442 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__fd_set in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,442 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____u_char in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,442 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____syscall_ulong_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,442 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__pthread_key_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,442 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____off64_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,442 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__fsblkcnt_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,443 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__div_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,443 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____uint32_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,443 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____blksize_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,443 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__blksize_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,443 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__DLL in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,443 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____rlim64_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,443 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____qaddr_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,443 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____rlim_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,443 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__pthread_barrierattr_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,443 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__blkcnt_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,444 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__u_char in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,444 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____suseconds_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,444 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__u_quad_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,444 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__time_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,444 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__pthread_mutex_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,444 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____fsblkcnt_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,444 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__uid_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,444 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__int16_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,444 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____uint16_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,444 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____fsid_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,444 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____socklen_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,444 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__ino_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,444 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__pid_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,445 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____intptr_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,445 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__u_int64_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,445 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__int8_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,445 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__daddr_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,445 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__gid_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,445 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__size_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,445 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__u_short in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,445 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____ino_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,445 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____time_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,445 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____u_long in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,445 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____int16_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,445 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____fsfilcnt_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,445 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__int64_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,445 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____mode_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,445 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__fsid_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,446 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__caddr_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,446 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____sigset_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,446 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____int8_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,446 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____clock_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,446 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____loff_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,446 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__ulong in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,446 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____caddr_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,446 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__u_long in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,446 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__suseconds_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,446 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____dev_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,446 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__clock_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,446 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i____u_short in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,447 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fdll_reverse_true_unreach_call_true_valid_memsafety_i__mode_t in dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:19,460 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG964862af9 [2018-04-10 16:31:19,463 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-10 16:31:19,464 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-10 16:31:19,464 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-10 16:31:19,465 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-10 16:31:19,468 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-10 16:31:19,469 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 04:31:19" (1/1) ... [2018-04-10 16:31:19,471 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a0510f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:31:19, skipping insertion in model container [2018-04-10 16:31:19,471 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.04 04:31:19" (1/1) ... [2018-04-10 16:31:19,481 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 16:31:19,504 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-10 16:31:19,635 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 16:31:19,674 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-10 16:31:19,679 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 115 non ball SCCs. Number of states in SCCs 115. [2018-04-10 16:31:19,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:31:19 WrapperNode [2018-04-10 16:31:19,714 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-10 16:31:19,714 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-10 16:31:19,714 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-10 16:31:19,714 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-10 16:31:19,723 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:31:19" (1/1) ... [2018-04-10 16:31:19,723 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:31:19" (1/1) ... [2018-04-10 16:31:19,735 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:31:19" (1/1) ... [2018-04-10 16:31:19,735 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:31:19" (1/1) ... [2018-04-10 16:31:19,745 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:31:19" (1/1) ... [2018-04-10 16:31:19,750 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:31:19" (1/1) ... [2018-04-10 16:31:19,753 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:31:19" (1/1) ... [2018-04-10 16:31:19,756 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-10 16:31:19,757 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-10 16:31:19,757 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-10 16:31:19,757 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-10 16:31:19,758 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:31:19" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-10 16:31:19,844 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-10 16:31:19,844 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-10 16:31:19,844 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-10 16:31:19,844 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-10 16:31:19,844 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-10 16:31:19,844 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-10 16:31:19,845 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-10 16:31:19,845 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-10 16:31:19,845 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-10 16:31:19,845 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-10 16:31:19,845 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-10 16:31:19,845 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-10 16:31:19,845 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-10 16:31:19,845 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-10 16:31:19,845 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-10 16:31:19,845 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-10 16:31:19,846 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-10 16:31:19,846 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-10 16:31:19,846 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-10 16:31:19,846 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-10 16:31:19,846 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-10 16:31:19,846 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-10 16:31:19,846 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-10 16:31:19,846 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-10 16:31:19,846 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-10 16:31:19,847 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-10 16:31:19,847 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-10 16:31:19,847 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-10 16:31:19,847 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-10 16:31:19,847 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-10 16:31:19,847 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-10 16:31:19,847 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-10 16:31:19,847 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-10 16:31:19,847 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-10 16:31:19,847 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-10 16:31:19,848 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-10 16:31:19,848 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-10 16:31:19,848 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-10 16:31:19,848 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-10 16:31:19,848 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-10 16:31:19,848 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-10 16:31:19,848 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-10 16:31:19,848 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-10 16:31:19,848 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-10 16:31:19,848 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-10 16:31:19,849 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-10 16:31:19,849 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-10 16:31:19,849 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-10 16:31:19,849 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-10 16:31:19,849 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-10 16:31:19,849 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-10 16:31:19,849 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-10 16:31:19,849 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-10 16:31:19,849 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-10 16:31:19,849 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-10 16:31:19,850 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-10 16:31:19,850 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-10 16:31:19,850 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-10 16:31:19,850 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-10 16:31:19,850 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-10 16:31:19,850 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-10 16:31:19,850 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-10 16:31:19,850 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-10 16:31:19,850 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-10 16:31:19,851 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-10 16:31:19,851 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-10 16:31:19,851 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-10 16:31:19,851 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-10 16:31:19,851 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-10 16:31:19,851 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-10 16:31:19,851 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-10 16:31:19,851 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-10 16:31:19,851 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-10 16:31:19,851 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-10 16:31:19,851 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-10 16:31:19,852 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-10 16:31:19,852 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-10 16:31:19,852 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-10 16:31:19,852 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-10 16:31:19,852 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-10 16:31:19,852 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-10 16:31:19,852 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-10 16:31:19,852 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-10 16:31:19,852 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-10 16:31:19,853 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-10 16:31:19,853 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-10 16:31:19,853 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-10 16:31:19,853 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-10 16:31:19,853 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-10 16:31:19,853 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-10 16:31:19,853 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-10 16:31:19,853 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-10 16:31:19,853 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-10 16:31:19,853 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-10 16:31:19,854 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-10 16:31:19,854 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-10 16:31:19,854 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-10 16:31:19,854 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-10 16:31:19,854 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-10 16:31:19,854 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-10 16:31:19,854 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-10 16:31:19,854 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-10 16:31:19,854 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-10 16:31:19,854 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-10 16:31:19,855 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-10 16:31:19,855 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-10 16:31:19,855 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-10 16:31:19,855 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-10 16:31:19,855 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-10 16:31:19,855 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-10 16:31:19,855 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-10 16:31:19,855 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-10 16:31:19,855 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-10 16:31:19,855 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-10 16:31:19,855 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-10 16:31:19,856 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-10 16:31:19,856 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-10 16:31:19,856 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-10 16:31:20,278 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-10 16:31:20,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 04:31:20 BoogieIcfgContainer [2018-04-10 16:31:20,279 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-10 16:31:20,279 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-10 16:31:20,279 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-10 16:31:20,281 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-10 16:31:20,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.04 04:31:19" (1/3) ... [2018-04-10 16:31:20,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18da2c59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 04:31:20, skipping insertion in model container [2018-04-10 16:31:20,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.04 04:31:19" (2/3) ... [2018-04-10 16:31:20,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18da2c59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.04 04:31:20, skipping insertion in model container [2018-04-10 16:31:20,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.04 04:31:20" (3/3) ... [2018-04-10 16:31:20,284 INFO L107 eAbstractionObserver]: Analyzing ICFG dll-reverse_true-unreach-call_true-valid-memsafety.i [2018-04-10 16:31:20,291 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-10 16:31:20,300 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 65 error locations. [2018-04-10 16:31:20,334 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-10 16:31:20,334 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-10 16:31:20,334 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-10 16:31:20,335 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-10 16:31:20,335 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-10 16:31:20,335 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-10 16:31:20,335 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-10 16:31:20,335 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-10 16:31:20,335 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-10 16:31:20,335 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-10 16:31:20,346 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states. [2018-04-10 16:31:20,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-10 16:31:20,353 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:31:20,354 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:31:20,354 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:31:20,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1664294412, now seen corresponding path program 1 times [2018-04-10 16:31:20,358 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:31:20,358 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:31:20,394 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:20,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:31:20,394 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:20,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:31:20,423 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:31:20,459 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-10 16:31:20,461 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:31:20,461 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 16:31:20,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 16:31:20,471 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 16:31:20,471 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 16:31:20,473 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 4 states. [2018-04-10 16:31:20,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:31:20,653 INFO L93 Difference]: Finished difference Result 168 states and 177 transitions. [2018-04-10 16:31:20,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 16:31:20,654 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-10 16:31:20,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:31:20,665 INFO L225 Difference]: With dead ends: 168 [2018-04-10 16:31:20,665 INFO L226 Difference]: Without dead ends: 164 [2018-04-10 16:31:20,667 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:31:20,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-04-10 16:31:20,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 150. [2018-04-10 16:31:20,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-04-10 16:31:20,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 158 transitions. [2018-04-10 16:31:20,709 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 158 transitions. Word has length 8 [2018-04-10 16:31:20,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:31:20,709 INFO L459 AbstractCegarLoop]: Abstraction has 150 states and 158 transitions. [2018-04-10 16:31:20,709 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 16:31:20,709 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 158 transitions. [2018-04-10 16:31:20,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-10 16:31:20,710 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:31:20,710 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:31:20,710 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:31:20,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1664294411, now seen corresponding path program 1 times [2018-04-10 16:31:20,710 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:31:20,710 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:31:20,712 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:20,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:31:20,712 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:20,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:31:20,723 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:31:20,757 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-10 16:31:20,757 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:31:20,757 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-10 16:31:20,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-10 16:31:20,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-10 16:31:20,758 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-10 16:31:20,759 INFO L87 Difference]: Start difference. First operand 150 states and 158 transitions. Second operand 4 states. [2018-04-10 16:31:20,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:31:20,870 INFO L93 Difference]: Finished difference Result 147 states and 155 transitions. [2018-04-10 16:31:20,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-10 16:31:20,871 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-10 16:31:20,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:31:20,872 INFO L225 Difference]: With dead ends: 147 [2018-04-10 16:31:20,872 INFO L226 Difference]: Without dead ends: 147 [2018-04-10 16:31:20,872 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:31:20,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-04-10 16:31:20,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-04-10 16:31:20,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-04-10 16:31:20,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 155 transitions. [2018-04-10 16:31:20,879 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 155 transitions. Word has length 8 [2018-04-10 16:31:20,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:31:20,880 INFO L459 AbstractCegarLoop]: Abstraction has 147 states and 155 transitions. [2018-04-10 16:31:20,880 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-10 16:31:20,880 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 155 transitions. [2018-04-10 16:31:20,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-10 16:31:20,880 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:31:20,880 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:31:20,881 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:31:20,881 INFO L82 PathProgramCache]: Analyzing trace with hash -224437887, now seen corresponding path program 1 times [2018-04-10 16:31:20,881 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:31:20,881 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:31:20,882 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:20,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:31:20,882 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:20,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:31:20,901 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:31:20,906 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:31:20,906 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:31:20,907 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:31:20,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:31:20,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:31:20,937 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:31:20,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:31:20,970 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:20,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:20,972 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-10 16:31:20,988 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-10 16:31:20,988 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:20,999 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-10 16:31:20,999 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-10 16:31:21,010 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-10 16:31:21,010 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:31:21,010 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:31:21,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:31:21,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:31:21,011 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:31:21,011 INFO L87 Difference]: Start difference. First operand 147 states and 155 transitions. Second operand 5 states. [2018-04-10 16:31:21,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:31:21,182 INFO L93 Difference]: Finished difference Result 154 states and 163 transitions. [2018-04-10 16:31:21,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 16:31:21,183 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-04-10 16:31:21,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:31:21,184 INFO L225 Difference]: With dead ends: 154 [2018-04-10 16:31:21,184 INFO L226 Difference]: Without dead ends: 154 [2018-04-10 16:31:21,184 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-10 16:31:21,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-04-10 16:31:21,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 136. [2018-04-10 16:31:21,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-04-10 16:31:21,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 148 transitions. [2018-04-10 16:31:21,191 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 148 transitions. Word has length 16 [2018-04-10 16:31:21,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:31:21,192 INFO L459 AbstractCegarLoop]: Abstraction has 136 states and 148 transitions. [2018-04-10 16:31:21,192 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:31:21,192 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 148 transitions. [2018-04-10 16:31:21,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-10 16:31:21,192 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:31:21,192 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:31:21,192 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:31:21,193 INFO L82 PathProgramCache]: Analyzing trace with hash -224437886, now seen corresponding path program 1 times [2018-04-10 16:31:21,193 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:31:21,193 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:31:21,194 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:21,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:31:21,194 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:21,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:31:21,205 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:31:21,208 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:31:21,208 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:31:21,208 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:31:21,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:31:21,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:31:21,234 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:31:21,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:31:21,239 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:21,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:31:21,245 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:21,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:21,251 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-10 16:31:21,289 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:21,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-10 16:31:21,291 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:21,304 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:21,304 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:21,305 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-10 16:31:21,305 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:21,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:31:21,311 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:21 [2018-04-10 16:31:21,322 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-10 16:31:21,322 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:31:21,322 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-10 16:31:21,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 16:31:21,323 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 16:31:21,323 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-10 16:31:21,323 INFO L87 Difference]: Start difference. First operand 136 states and 148 transitions. Second operand 7 states. [2018-04-10 16:31:21,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:31:21,647 INFO L93 Difference]: Finished difference Result 197 states and 211 transitions. [2018-04-10 16:31:21,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 16:31:21,647 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-04-10 16:31:21,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:31:21,649 INFO L225 Difference]: With dead ends: 197 [2018-04-10 16:31:21,649 INFO L226 Difference]: Without dead ends: 197 [2018-04-10 16:31:21,649 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-04-10 16:31:21,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-04-10 16:31:21,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 168. [2018-04-10 16:31:21,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-10 16:31:21,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 186 transitions. [2018-04-10 16:31:21,655 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 186 transitions. Word has length 16 [2018-04-10 16:31:21,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:31:21,656 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 186 transitions. [2018-04-10 16:31:21,656 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 16:31:21,656 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 186 transitions. [2018-04-10 16:31:21,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-10 16:31:21,656 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:31:21,656 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:31:21,656 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:31:21,657 INFO L82 PathProgramCache]: Analyzing trace with hash -936444636, now seen corresponding path program 1 times [2018-04-10 16:31:21,657 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:31:21,657 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:31:21,658 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:21,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:31:21,659 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:21,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:31:21,668 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:31:21,692 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-10 16:31:21,692 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:31:21,692 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:31:21,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:31:21,692 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:31:21,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:31:21,693 INFO L87 Difference]: Start difference. First operand 168 states and 186 transitions. Second operand 5 states. [2018-04-10 16:31:21,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:31:21,870 INFO L93 Difference]: Finished difference Result 295 states and 326 transitions. [2018-04-10 16:31:21,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 16:31:21,870 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-10 16:31:21,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:31:21,871 INFO L225 Difference]: With dead ends: 295 [2018-04-10 16:31:21,872 INFO L226 Difference]: Without dead ends: 295 [2018-04-10 16:31:21,872 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-10 16:31:21,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-04-10 16:31:21,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 167. [2018-04-10 16:31:21,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-04-10 16:31:21,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 184 transitions. [2018-04-10 16:31:21,878 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 184 transitions. Word has length 18 [2018-04-10 16:31:21,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:31:21,878 INFO L459 AbstractCegarLoop]: Abstraction has 167 states and 184 transitions. [2018-04-10 16:31:21,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:31:21,879 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 184 transitions. [2018-04-10 16:31:21,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-10 16:31:21,879 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:31:21,879 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:31:21,879 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:31:21,880 INFO L82 PathProgramCache]: Analyzing trace with hash -936444635, now seen corresponding path program 1 times [2018-04-10 16:31:21,880 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:31:21,880 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:31:21,880 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:21,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:31:21,881 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:21,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:31:21,890 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:31:21,923 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-10 16:31:21,923 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:31:21,923 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:31:21,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:31:21,924 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:31:21,924 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:31:21,924 INFO L87 Difference]: Start difference. First operand 167 states and 184 transitions. Second operand 5 states. [2018-04-10 16:31:22,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:31:22,145 INFO L93 Difference]: Finished difference Result 294 states and 324 transitions. [2018-04-10 16:31:22,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 16:31:22,145 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-10 16:31:22,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:31:22,146 INFO L225 Difference]: With dead ends: 294 [2018-04-10 16:31:22,147 INFO L226 Difference]: Without dead ends: 294 [2018-04-10 16:31:22,147 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-10 16:31:22,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-04-10 16:31:22,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 166. [2018-04-10 16:31:22,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-04-10 16:31:22,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 182 transitions. [2018-04-10 16:31:22,152 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 182 transitions. Word has length 18 [2018-04-10 16:31:22,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:31:22,153 INFO L459 AbstractCegarLoop]: Abstraction has 166 states and 182 transitions. [2018-04-10 16:31:22,153 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:31:22,153 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 182 transitions. [2018-04-10 16:31:22,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-10 16:31:22,153 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:31:22,154 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:31:22,154 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:31:22,154 INFO L82 PathProgramCache]: Analyzing trace with hash -261740378, now seen corresponding path program 1 times [2018-04-10 16:31:22,154 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:31:22,154 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:31:22,155 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:22,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:31:22,156 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:22,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:31:22,166 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:31:22,170 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:31:22,170 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:31:22,170 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:31:22,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:31:22,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:31:22,206 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:31:22,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:31:22,216 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:22,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:22,219 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-10 16:31:22,227 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-10 16:31:22,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:31:22,229 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:22,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:22,237 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-10 16:31:22,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-10 16:31:22,238 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:22,240 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:22,244 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-10 16:31:22,244 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:34, output treesize:20 [2018-04-10 16:31:22,252 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-10 16:31:22,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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-10 16:31:22,254 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:22,256 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:22,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:22,259 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:16 [2018-04-10 16:31:22,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-04-10 16:31:22,282 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 24 treesize of output 23 [2018-04-10 16:31:22,282 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:22,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:22,298 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-10 16:31:22,298 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:25 [2018-04-10 16:31:22,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2018-04-10 16:31:22,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-10 16:31:22,319 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:22,322 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:22,325 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-10 16:31:22,325 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:35, output treesize:5 [2018-04-10 16:31:22,336 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-10 16:31:22,337 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:31:22,337 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-10 16:31:22,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-10 16:31:22,337 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-10 16:31:22,337 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-04-10 16:31:22,337 INFO L87 Difference]: Start difference. First operand 166 states and 182 transitions. Second operand 11 states. [2018-04-10 16:31:22,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:31:22,736 INFO L93 Difference]: Finished difference Result 186 states and 199 transitions. [2018-04-10 16:31:22,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-10 16:31:22,736 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-04-10 16:31:22,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:31:22,737 INFO L225 Difference]: With dead ends: 186 [2018-04-10 16:31:22,737 INFO L226 Difference]: Without dead ends: 186 [2018-04-10 16:31:22,738 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=157, Invalid=349, Unknown=0, NotChecked=0, Total=506 [2018-04-10 16:31:22,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-04-10 16:31:22,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 168. [2018-04-10 16:31:22,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-10 16:31:22,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 185 transitions. [2018-04-10 16:31:22,742 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 185 transitions. Word has length 22 [2018-04-10 16:31:22,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:31:22,742 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 185 transitions. [2018-04-10 16:31:22,742 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-10 16:31:22,742 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 185 transitions. [2018-04-10 16:31:22,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-10 16:31:22,742 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:31:22,743 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:31:22,743 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:31:22,743 INFO L82 PathProgramCache]: Analyzing trace with hash -261740377, now seen corresponding path program 1 times [2018-04-10 16:31:22,743 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:31:22,743 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:31:22,744 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:22,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:31:22,744 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:22,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:31:22,754 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:31:22,758 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:31:22,758 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:31:22,758 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:31:22,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:31:22,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:31:22,786 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:31:22,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:31:22,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:22,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:22,805 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-10 16:31:22,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:31:22,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:31:22,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:22,822 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:22,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:31:22,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:31:22,834 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:22,835 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:22,841 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-10 16:31:22,841 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:31, output treesize:20 [2018-04-10 16:31:22,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 38 [2018-04-10 16:31:22,891 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:22,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2018-04-10 16:31:22,894 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:22,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2018-04-10 16:31:22,926 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:22,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:22,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-04-10 16:31:22,972 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:22,974 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 21 treesize of output 34 [2018-04-10 16:31:22,974 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:22,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:31:22,994 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:23,002 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:23,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:31:23,013 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:53, output treesize:45 [2018-04-10 16:31:23,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 91 [2018-04-10 16:31:23,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 65 [2018-04-10 16:31:23,052 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:23,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 49 [2018-04-10 16:31:23,073 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-10 16:31:23,093 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:23,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 57 [2018-04-10 16:31:23,096 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-10 16:31:23,138 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-10 16:31:23,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 44 [2018-04-10 16:31:23,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 7 [2018-04-10 16:31:23,164 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:23,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-04-10 16:31:23,173 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:23,178 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:23,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 48 [2018-04-10 16:31:23,190 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:23,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 24 [2018-04-10 16:31:23,193 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:23,216 INFO L267 ElimStorePlain]: Start of recursive call 9: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:23,223 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-10 16:31:23,224 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:107, output treesize:9 [2018-04-10 16:31:23,242 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-10 16:31:23,242 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:31:23,243 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-10 16:31:23,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-10 16:31:23,243 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-10 16:31:23,243 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-04-10 16:31:23,243 INFO L87 Difference]: Start difference. First operand 168 states and 185 transitions. Second operand 11 states. [2018-04-10 16:31:23,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:31:23,795 INFO L93 Difference]: Finished difference Result 218 states and 236 transitions. [2018-04-10 16:31:23,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-10 16:31:23,799 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-04-10 16:31:23,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:31:23,800 INFO L225 Difference]: With dead ends: 218 [2018-04-10 16:31:23,800 INFO L226 Difference]: Without dead ends: 218 [2018-04-10 16:31:23,801 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=219, Invalid=431, Unknown=0, NotChecked=0, Total=650 [2018-04-10 16:31:23,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-04-10 16:31:23,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 163. [2018-04-10 16:31:23,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-04-10 16:31:23,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 179 transitions. [2018-04-10 16:31:23,804 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 179 transitions. Word has length 22 [2018-04-10 16:31:23,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:31:23,804 INFO L459 AbstractCegarLoop]: Abstraction has 163 states and 179 transitions. [2018-04-10 16:31:23,804 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-10 16:31:23,804 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 179 transitions. [2018-04-10 16:31:23,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-10 16:31:23,805 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:31:23,805 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:31:23,805 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:31:23,805 INFO L82 PathProgramCache]: Analyzing trace with hash -791769497, now seen corresponding path program 1 times [2018-04-10 16:31:23,805 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:31:23,805 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:31:23,807 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:23,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:31:23,807 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:23,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:31:23,815 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:31:23,817 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:31:23,817 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:31:23,817 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:31:23,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:31:23,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:31:23,835 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:31:23,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:31:23,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:31:23,855 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:23,856 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:23,862 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-10 16:31:23,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:31:23,864 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:23,865 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:23,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:23,869 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-04-10 16:31:23,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, 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-10 16:31:23,881 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:23,881 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-10 16:31:23,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:23,890 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:23,914 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-10 16:31:23,917 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:23,917 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-10 16:31:23,918 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:23,922 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:23,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:23,930 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2018-04-10 16:31:23,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-04-10 16:31:23,965 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:23,965 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:23,966 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:31:23,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2018-04-10 16:31:23,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:23,969 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:23,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-04-10 16:31:23,980 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:23,981 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:23,982 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:31:23,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2018-04-10 16:31:23,983 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:23,988 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:23,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:23,995 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:59, output treesize:7 [2018-04-10 16:31:24,013 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:31:24,013 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:31:24,013 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-10 16:31:24,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 16:31:24,013 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 16:31:24,013 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-04-10 16:31:24,014 INFO L87 Difference]: Start difference. First operand 163 states and 179 transitions. Second operand 9 states. [2018-04-10 16:31:24,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:31:24,274 INFO L93 Difference]: Finished difference Result 196 states and 214 transitions. [2018-04-10 16:31:24,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-10 16:31:24,274 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2018-04-10 16:31:24,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:31:24,275 INFO L225 Difference]: With dead ends: 196 [2018-04-10 16:31:24,275 INFO L226 Difference]: Without dead ends: 196 [2018-04-10 16:31:24,275 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2018-04-10 16:31:24,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-04-10 16:31:24,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 170. [2018-04-10 16:31:24,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-04-10 16:31:24,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 186 transitions. [2018-04-10 16:31:24,279 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 186 transitions. Word has length 27 [2018-04-10 16:31:24,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:31:24,279 INFO L459 AbstractCegarLoop]: Abstraction has 170 states and 186 transitions. [2018-04-10 16:31:24,279 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 16:31:24,279 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 186 transitions. [2018-04-10 16:31:24,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-10 16:31:24,280 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:31:24,280 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:31:24,280 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:31:24,280 INFO L82 PathProgramCache]: Analyzing trace with hash -435040589, now seen corresponding path program 1 times [2018-04-10 16:31:24,280 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:31:24,280 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:31:24,281 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:24,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:31:24,281 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:24,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:31:24,287 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:31:24,323 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-10 16:31:24,323 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:31:24,323 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-10 16:31:24,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-10 16:31:24,323 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-10 16:31:24,323 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-10 16:31:24,323 INFO L87 Difference]: Start difference. First operand 170 states and 186 transitions. Second operand 6 states. [2018-04-10 16:31:24,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:31:24,460 INFO L93 Difference]: Finished difference Result 190 states and 206 transitions. [2018-04-10 16:31:24,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-10 16:31:24,460 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-04-10 16:31:24,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:31:24,461 INFO L225 Difference]: With dead ends: 190 [2018-04-10 16:31:24,461 INFO L226 Difference]: Without dead ends: 190 [2018-04-10 16:31:24,461 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-04-10 16:31:24,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-04-10 16:31:24,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 182. [2018-04-10 16:31:24,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-04-10 16:31:24,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 200 transitions. [2018-04-10 16:31:24,464 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 200 transitions. Word has length 28 [2018-04-10 16:31:24,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:31:24,464 INFO L459 AbstractCegarLoop]: Abstraction has 182 states and 200 transitions. [2018-04-10 16:31:24,464 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-10 16:31:24,464 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 200 transitions. [2018-04-10 16:31:24,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-10 16:31:24,465 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:31:24,465 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:31:24,465 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:31:24,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1484125475, now seen corresponding path program 1 times [2018-04-10 16:31:24,465 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:31:24,465 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:31:24,466 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:24,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:31:24,466 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:24,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:31:24,474 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:31:24,568 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-10 16:31:24,568 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:31:24,568 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:31:24,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:31:24,568 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:31:24,568 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:31:24,568 INFO L87 Difference]: Start difference. First operand 182 states and 200 transitions. Second operand 5 states. [2018-04-10 16:31:24,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:31:24,670 INFO L93 Difference]: Finished difference Result 242 states and 265 transitions. [2018-04-10 16:31:24,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 16:31:24,670 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-04-10 16:31:24,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:31:24,671 INFO L225 Difference]: With dead ends: 242 [2018-04-10 16:31:24,671 INFO L226 Difference]: Without dead ends: 242 [2018-04-10 16:31:24,698 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-10 16:31:24,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-04-10 16:31:24,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 181. [2018-04-10 16:31:24,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-04-10 16:31:24,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 198 transitions. [2018-04-10 16:31:24,701 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 198 transitions. Word has length 30 [2018-04-10 16:31:24,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:31:24,702 INFO L459 AbstractCegarLoop]: Abstraction has 181 states and 198 transitions. [2018-04-10 16:31:24,702 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:31:24,702 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 198 transitions. [2018-04-10 16:31:24,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-10 16:31:24,702 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:31:24,703 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:31:24,703 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:31:24,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1484125474, now seen corresponding path program 1 times [2018-04-10 16:31:24,703 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:31:24,703 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:31:24,704 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:24,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:31:24,704 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:24,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:31:24,711 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:31:24,751 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-10 16:31:24,751 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:31:24,751 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-10 16:31:24,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:31:24,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:31:24,752 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:31:24,752 INFO L87 Difference]: Start difference. First operand 181 states and 198 transitions. Second operand 5 states. [2018-04-10 16:31:24,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:31:24,900 INFO L93 Difference]: Finished difference Result 241 states and 263 transitions. [2018-04-10 16:31:24,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-10 16:31:24,900 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-04-10 16:31:24,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:31:24,901 INFO L225 Difference]: With dead ends: 241 [2018-04-10 16:31:24,901 INFO L226 Difference]: Without dead ends: 241 [2018-04-10 16:31:24,901 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-10 16:31:24,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-04-10 16:31:24,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 180. [2018-04-10 16:31:24,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-04-10 16:31:24,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 196 transitions. [2018-04-10 16:31:24,904 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 196 transitions. Word has length 30 [2018-04-10 16:31:24,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:31:24,904 INFO L459 AbstractCegarLoop]: Abstraction has 180 states and 196 transitions. [2018-04-10 16:31:24,904 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:31:24,904 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 196 transitions. [2018-04-10 16:31:24,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-10 16:31:24,905 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:31:24,905 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] [2018-04-10 16:31:24,905 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:31:24,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1808714207, now seen corresponding path program 1 times [2018-04-10 16:31:24,905 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:31:24,905 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:31:24,906 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:24,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:31:24,907 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:24,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:31:24,915 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:31:24,917 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:31:24,917 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:31:24,917 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:31:24,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:31:24,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:31:24,943 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:31:24,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:31:24,961 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:24,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:24,965 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-10 16:31:24,976 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-10 16:31:24,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:31:24,979 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:24,981 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:24,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:31:24,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:31:24,993 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:24,994 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:25,000 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-10 16:31:25,001 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:34, output treesize:20 [2018-04-10 16:31:25,012 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-10 16:31:25,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 16:31:25,015 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:25,016 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:25,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:25,020 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:16 [2018-04-10 16:31:25,045 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 23 treesize of output 35 [2018-04-10 16:31:25,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-04-10 16:31:25,049 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:25,062 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:25,067 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-10 16:31:25,068 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:25 [2018-04-10 16:31:25,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2018-04-10 16:31:25,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-04-10 16:31:25,093 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:25,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-10 16:31:25,103 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:25,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:25,110 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-10 16:31:25,111 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:35, output treesize:5 [2018-04-10 16:31:25,127 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-10 16:31:25,127 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:31:25,127 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-10 16:31:25,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-10 16:31:25,128 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-10 16:31:25,128 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-04-10 16:31:25,128 INFO L87 Difference]: Start difference. First operand 180 states and 196 transitions. Second operand 11 states. [2018-04-10 16:31:25,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:31:25,510 INFO L93 Difference]: Finished difference Result 196 states and 211 transitions. [2018-04-10 16:31:25,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-10 16:31:25,510 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2018-04-10 16:31:25,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:31:25,511 INFO L225 Difference]: With dead ends: 196 [2018-04-10 16:31:25,511 INFO L226 Difference]: Without dead ends: 196 [2018-04-10 16:31:25,511 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=161, Invalid=345, Unknown=0, NotChecked=0, Total=506 [2018-04-10 16:31:25,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-04-10 16:31:25,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 182. [2018-04-10 16:31:25,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-04-10 16:31:25,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 199 transitions. [2018-04-10 16:31:25,514 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 199 transitions. Word has length 34 [2018-04-10 16:31:25,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:31:25,515 INFO L459 AbstractCegarLoop]: Abstraction has 182 states and 199 transitions. [2018-04-10 16:31:25,515 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-10 16:31:25,515 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 199 transitions. [2018-04-10 16:31:25,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-10 16:31:25,516 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:31:25,516 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] [2018-04-10 16:31:25,516 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:31:25,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1808714208, now seen corresponding path program 1 times [2018-04-10 16:31:25,516 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:31:25,516 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:31:25,517 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:25,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:31:25,517 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:25,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:31:25,525 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:31:25,528 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:31:25,528 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:31:25,529 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:31:25,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:31:25,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:31:25,553 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:31:25,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:31:25,574 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:25,581 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:25,581 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:25,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-10 16:31:25,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:25,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:25,588 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-04-10 16:31:25,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-10 16:31:25,597 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:25,605 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-10 16:31:25,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-10 16:31:25,608 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:25,610 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:25,616 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-10 16:31:25,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:31:25,618 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:25,619 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:25,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:25,623 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:42, output treesize:25 [2018-04-10 16:31:25,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-10 16:31:25,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:31:25,661 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:25,665 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:25,674 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 52 treesize of output 48 [2018-04-10 16:31:25,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:31:25,680 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:25,687 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:25,695 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-10 16:31:25,696 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:67, output treesize:51 [2018-04-10 16:31:25,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2018-04-10 16:31:25,718 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 30 treesize of output 19 [2018-04-10 16:31:25,718 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:25,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 16:31:25,726 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:25,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:25,741 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 24 treesize of output 22 [2018-04-10 16:31:25,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 16:31:25,743 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:25,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10 16:31:25,749 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:25,750 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:25,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:25,755 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:65, output treesize:9 [2018-04-10 16:31:25,776 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-10 16:31:25,776 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:31:25,776 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-10 16:31:25,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 16:31:25,777 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 16:31:25,777 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-04-10 16:31:25,777 INFO L87 Difference]: Start difference. First operand 182 states and 199 transitions. Second operand 9 states. [2018-04-10 16:31:26,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:31:26,057 INFO L93 Difference]: Finished difference Result 182 states and 197 transitions. [2018-04-10 16:31:26,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-10 16:31:26,058 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-04-10 16:31:26,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:31:26,058 INFO L225 Difference]: With dead ends: 182 [2018-04-10 16:31:26,058 INFO L226 Difference]: Without dead ends: 182 [2018-04-10 16:31:26,059 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2018-04-10 16:31:26,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-04-10 16:31:26,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2018-04-10 16:31:26,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-04-10 16:31:26,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 196 transitions. [2018-04-10 16:31:26,062 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 196 transitions. Word has length 34 [2018-04-10 16:31:26,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:31:26,062 INFO L459 AbstractCegarLoop]: Abstraction has 180 states and 196 transitions. [2018-04-10 16:31:26,062 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 16:31:26,062 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 196 transitions. [2018-04-10 16:31:26,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-10 16:31:26,063 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:31:26,063 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:31:26,063 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:31:26,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1468980777, now seen corresponding path program 1 times [2018-04-10 16:31:26,064 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:31:26,064 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:31:26,065 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:26,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:31:26,065 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:26,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:31:26,084 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:31:26,093 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:31:26,093 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:31:26,093 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:31:26,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:31:26,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:31:26,128 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:31:26,136 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:26,137 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:26,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-10 16:31:26,138 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:26,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:26,142 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2018-04-10 16:31:26,151 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-10 16:31:26,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-10 16:31:26,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:26,155 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:26,160 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-10 16:31:26,160 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-04-10 16:31:26,182 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 39 treesize of output 35 [2018-04-10 16:31:26,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:31:26,184 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:26,189 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:26,194 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-10 16:31:26,194 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:36 [2018-04-10 16:31:26,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 26 [2018-04-10 16:31:26,218 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-10 16:31:26,219 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:26,224 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 16:31:26,224 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:26,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:26,230 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-10 16:31:26,231 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:43, output treesize:15 [2018-04-10 16:31:26,254 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:31:26,255 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:31:26,255 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-10 16:31:26,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-10 16:31:26,255 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-10 16:31:26,255 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-04-10 16:31:26,255 INFO L87 Difference]: Start difference. First operand 180 states and 196 transitions. Second operand 9 states. [2018-04-10 16:31:26,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:31:26,540 INFO L93 Difference]: Finished difference Result 186 states and 202 transitions. [2018-04-10 16:31:26,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-10 16:31:26,541 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-04-10 16:31:26,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:31:26,541 INFO L225 Difference]: With dead ends: 186 [2018-04-10 16:31:26,541 INFO L226 Difference]: Without dead ends: 186 [2018-04-10 16:31:26,542 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2018-04-10 16:31:26,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-04-10 16:31:26,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 171. [2018-04-10 16:31:26,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-04-10 16:31:26,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 187 transitions. [2018-04-10 16:31:26,545 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 187 transitions. Word has length 34 [2018-04-10 16:31:26,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:31:26,545 INFO L459 AbstractCegarLoop]: Abstraction has 171 states and 187 transitions. [2018-04-10 16:31:26,545 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-10 16:31:26,545 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 187 transitions. [2018-04-10 16:31:26,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-10 16:31:26,546 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:31:26,546 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:31:26,546 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:31:26,546 INFO L82 PathProgramCache]: Analyzing trace with hash -917197866, now seen corresponding path program 1 times [2018-04-10 16:31:26,546 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:31:26,546 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:31:26,547 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:26,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:31:26,547 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:26,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:31:26,556 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:31:26,562 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:31:26,562 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:31:26,562 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:31:26,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:31:26,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:31:26,613 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:31:26,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:31:26,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:26,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:26,647 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-04-10 16:31:26,662 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-10 16:31:26,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:31:26,664 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:26,666 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:26,680 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-10 16:31:26,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:31:26,682 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:26,684 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:26,694 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-10 16:31:26,694 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:29 [2018-04-10 16:31:26,744 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 36 treesize of output 50 [2018-04-10 16:31:26,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-04-10 16:31:26,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:26,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:26,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 51 [2018-04-10 16:31:26,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2018-04-10 16:31:26,785 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:26,798 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:26,808 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-10 16:31:26,808 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:78, output treesize:62 [2018-04-10 16:31:26,896 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 54 treesize of output 60 [2018-04-10 16:31:26,900 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:26,901 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:31:26,901 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:31:26,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 66 [2018-04-10 16:31:26,902 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:26,926 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:26,926 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:31:26,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 65 [2018-04-10 16:31:26,927 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:26,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:26,965 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 66 treesize of output 65 [2018-04-10 16:31:26,969 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:26,970 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:31:26,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 53 [2018-04-10 16:31:26,978 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:27,005 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:27,006 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 53 treesize of output 64 [2018-04-10 16:31:27,007 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:27,023 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:31:27,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-10 16:31:27,042 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:107, output treesize:177 [2018-04-10 16:31:27,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 100 [2018-04-10 16:31:27,153 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:31:27,153 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:31:27,154 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:27,154 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:31:27,155 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 80 [2018-04-10 16:31:27,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:27,202 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:27,259 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 102 treesize of output 84 [2018-04-10 16:31:27,261 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:31:27,262 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:27,262 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:31:27,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 25 [2018-04-10 16:31:27,263 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:27,278 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:27,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 16:31:27,304 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:211, output treesize:95 [2018-04-10 16:31:27,454 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:27,455 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:27,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2018-04-10 16:31:27,460 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2018-04-10 16:31:27,460 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 16:31:27,470 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:27,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-10 16:31:27,471 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:27,474 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:27,478 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-10 16:31:27,478 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:52, output treesize:10 [2018-04-10 16:31:27,513 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:31:27,513 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:31:27,513 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-10 16:31:27,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-10 16:31:27,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-10 16:31:27,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2018-04-10 16:31:27,513 INFO L87 Difference]: Start difference. First operand 171 states and 187 transitions. Second operand 18 states. [2018-04-10 16:31:28,610 WARN L151 SmtUtils]: Spent 120ms on a formula simplification. DAG size of input: 166 DAG size of output 79 [2018-04-10 16:31:29,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:31:29,797 INFO L93 Difference]: Finished difference Result 326 states and 358 transitions. [2018-04-10 16:31:29,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-10 16:31:29,798 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 39 [2018-04-10 16:31:29,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:31:29,801 INFO L225 Difference]: With dead ends: 326 [2018-04-10 16:31:29,802 INFO L226 Difference]: Without dead ends: 326 [2018-04-10 16:31:29,802 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=254, Invalid=1077, Unknown=1, NotChecked=0, Total=1332 [2018-04-10 16:31:29,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-04-10 16:31:29,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 196. [2018-04-10 16:31:29,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-04-10 16:31:29,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 216 transitions. [2018-04-10 16:31:29,805 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 216 transitions. Word has length 39 [2018-04-10 16:31:29,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:31:29,805 INFO L459 AbstractCegarLoop]: Abstraction has 196 states and 216 transitions. [2018-04-10 16:31:29,805 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-10 16:31:29,805 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 216 transitions. [2018-04-10 16:31:29,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-10 16:31:29,806 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:31:29,806 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:31:29,806 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:31:29,806 INFO L82 PathProgramCache]: Analyzing trace with hash -917197865, now seen corresponding path program 1 times [2018-04-10 16:31:29,806 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:31:29,806 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:31:29,807 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:29,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:31:29,807 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:29,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:31:29,814 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:31:29,822 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:31:29,822 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:31:29,822 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:31:29,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:31:29,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:31:29,855 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:31:29,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:31:29,861 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:29,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:29,863 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:31:29,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-10 16:31:29,878 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:29,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:29,886 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:23 [2018-04-10 16:31:29,898 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-10 16:31:29,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:31:29,900 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:29,901 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:29,927 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-10 16:31:29,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:31:29,929 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:29,931 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:29,960 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-10 16:31:29,960 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:34 [2018-04-10 16:31:30,019 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 23 treesize of output 35 [2018-04-10 16:31:30,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-04-10 16:31:30,022 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:30,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:30,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 56 [2018-04-10 16:31:30,079 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:30,080 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:31:30,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 46 [2018-04-10 16:31:30,081 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:30,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-04-10 16:31:30,102 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:30,110 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:30,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:31:30,123 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:67, output treesize:71 [2018-04-10 16:31:30,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 74 treesize of output 97 [2018-04-10 16:31:30,232 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:30,234 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 72 treesize of output 93 [2018-04-10 16:31:30,234 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:30,328 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:30,328 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:31:30,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 97 [2018-04-10 16:31:30,332 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-10 16:31:30,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 80 [2018-04-10 16:31:30,400 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:30,451 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:31:30,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 86 [2018-04-10 16:31:30,452 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-10 16:31:30,492 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-10 16:31:30,541 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:31:30,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 106 [2018-04-10 16:31:30,544 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:31:30,545 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:30,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 90 [2018-04-10 16:31:30,546 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:30,572 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:30,576 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:31:30,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 105 [2018-04-10 16:31:30,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 60 [2018-04-10 16:31:30,581 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:30,592 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:30,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 11 case distinctions, treesize of input 122 treesize of output 137 [2018-04-10 16:31:30,624 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:31:30,625 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 112 treesize of output 109 [2018-04-10 16:31:30,626 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:30,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 146 [2018-04-10 16:31:30,800 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:30,830 INFO L267 ElimStorePlain]: Start of recursive call 11: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:30,835 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:31:30,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 118 treesize of output 101 [2018-04-10 16:31:30,844 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:31:30,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 47 [2018-04-10 16:31:30,845 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:30,856 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:30,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 9 dim-0 vars, and 4 xjuncts. [2018-04-10 16:31:30,915 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 4 variables, input treesize:127, output treesize:448 [2018-04-10 16:31:31,365 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:31,367 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:31,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 180 treesize of output 175 [2018-04-10 16:31:31,385 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 164 treesize of output 183 [2018-04-10 16:31:31,386 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 16:31:31,493 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:31,494 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 121 [2018-04-10 16:31:31,495 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-10 16:31:31,555 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:31:31,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 99 [2018-04-10 16:31:31,556 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:31,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 152 treesize of output 133 [2018-04-10 16:31:31,638 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:31,695 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:31,695 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:31:31,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 105 [2018-04-10 16:31:31,698 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-10 16:31:31,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 109 [2018-04-10 16:31:31,775 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:31:31,838 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:31:31,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 103 [2018-04-10 16:31:31,840 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:31,903 INFO L267 ElimStorePlain]: Start of recursive call 2: 7 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-04-10 16:31:31,981 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 112 treesize of output 88 [2018-04-10 16:31:31,983 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:31:31,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 26 [2018-04-10 16:31:31,984 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:31,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 16:31:31,998 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:32,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10 16:31:32,010 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:32,018 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:32,025 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 108 treesize of output 92 [2018-04-10 16:31:32,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 73 [2018-04-10 16:31:32,028 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:32,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 77 [2018-04-10 16:31:32,061 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:32,092 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:31:32,093 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 61 [2018-04-10 16:31:32,093 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:32,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 40 [2018-04-10 16:31:32,125 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:32,153 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:31:32,153 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:32,154 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:31:32,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 51 [2018-04-10 16:31:32,154 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:32,173 INFO L267 ElimStorePlain]: Start of recursive call 14: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:32,180 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 108 treesize of output 92 [2018-04-10 16:31:32,182 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:31:32,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 66 [2018-04-10 16:31:32,183 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:32,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 45 [2018-04-10 16:31:32,241 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:32,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 40 [2018-04-10 16:31:32,269 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:32,300 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:31:32,301 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 62 [2018-04-10 16:31:32,301 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:32,334 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:32,334 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:31:32,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 48 [2018-04-10 16:31:32,335 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:32,354 INFO L267 ElimStorePlain]: Start of recursive call 20: 5 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:32,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-04-10 16:31:32,393 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 6 variables, input treesize:204, output treesize:91 [2018-04-10 16:31:32,471 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:31:32,472 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:31:32,472 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-10 16:31:32,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-10 16:31:32,472 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-10 16:31:32,472 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2018-04-10 16:31:32,472 INFO L87 Difference]: Start difference. First operand 196 states and 216 transitions. Second operand 19 states. [2018-04-10 16:31:33,107 WARN L151 SmtUtils]: Spent 152ms on a formula simplification. DAG size of input: 120 DAG size of output 117 [2018-04-10 16:31:33,504 WARN L151 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 146 DAG size of output 102 [2018-04-10 16:31:33,679 WARN L151 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 154 DAG size of output 107 [2018-04-10 16:31:34,018 WARN L151 SmtUtils]: Spent 145ms on a formula simplification. DAG size of input: 172 DAG size of output 75 [2018-04-10 16:31:37,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:31:37,603 INFO L93 Difference]: Finished difference Result 324 states and 354 transitions. [2018-04-10 16:31:37,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-10 16:31:37,603 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 39 [2018-04-10 16:31:37,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:31:37,604 INFO L225 Difference]: With dead ends: 324 [2018-04-10 16:31:37,604 INFO L226 Difference]: Without dead ends: 324 [2018-04-10 16:31:37,604 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=383, Invalid=1597, Unknown=0, NotChecked=0, Total=1980 [2018-04-10 16:31:37,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-04-10 16:31:37,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 230. [2018-04-10 16:31:37,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-04-10 16:31:37,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 255 transitions. [2018-04-10 16:31:37,608 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 255 transitions. Word has length 39 [2018-04-10 16:31:37,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:31:37,609 INFO L459 AbstractCegarLoop]: Abstraction has 230 states and 255 transitions. [2018-04-10 16:31:37,609 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-10 16:31:37,609 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 255 transitions. [2018-04-10 16:31:37,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-10 16:31:37,609 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:31:37,609 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:31:37,610 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:31:37,610 INFO L82 PathProgramCache]: Analyzing trace with hash 364674278, now seen corresponding path program 1 times [2018-04-10 16:31:37,610 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:31:37,610 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:31:37,611 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:37,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:31:37,611 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:37,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:31:37,620 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:31:37,633 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:31:37,633 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:31:37,633 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:31:37,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:31:37,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:31:37,664 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:31:37,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:31:37,671 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:37,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:37,674 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:31:37,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:31:37,705 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:37,717 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-10 16:31:37,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:37,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:37,725 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:31 [2018-04-10 16:31:37,753 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-10 16:31:37,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:31:37,756 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:37,758 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:37,772 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-10 16:31:37,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:31:37,774 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:37,775 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:37,785 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-10 16:31:37,786 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:53, output treesize:43 [2018-04-10 16:31:37,802 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-10 16:31:37,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10 16:31:37,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:37,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:37,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:37,813 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:39 [2018-04-10 16:31:37,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 42 [2018-04-10 16:31:37,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2018-04-10 16:31:37,852 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:37,867 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:37,877 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-10 16:31:37,877 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:48 [2018-04-10 16:31:38,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 39 treesize of output 64 [2018-04-10 16:31:38,019 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:38,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 68 [2018-04-10 16:31:38,035 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-10 16:31:38,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 52 [2018-04-10 16:31:38,152 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-10 16:31:38,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 53 [2018-04-10 16:31:38,228 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 16:31:38,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 39 [2018-04-10 16:31:38,287 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:38,331 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2018-04-10 16:31:38,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 85 [2018-04-10 16:31:38,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 85 [2018-04-10 16:31:38,391 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:38,428 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:38,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 60 [2018-04-10 16:31:38,437 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 20 treesize of output 31 [2018-04-10 16:31:38,438 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-04-10 16:31:38,449 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:38,451 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:31:38,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 64 [2018-04-10 16:31:38,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2018-04-10 16:31:38,453 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:38,462 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:38,473 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 60 treesize of output 68 [2018-04-10 16:31:38,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 64 [2018-04-10 16:31:38,476 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:38,513 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:38,515 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:31:38,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 65 [2018-04-10 16:31:38,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2018-04-10 16:31:38,517 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:38,529 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:38,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 9 dim-0 vars, and 5 xjuncts. [2018-04-10 16:31:38,610 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 4 variables, input treesize:74, output treesize:376 [2018-04-10 16:31:38,750 WARN L151 SmtUtils]: Spent 111ms on a formula simplification. DAG size of input: 118 DAG size of output 96 [2018-04-10 16:31:38,755 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:38,755 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:38,757 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:38,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 70 [2018-04-10 16:31:38,757 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:38,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 44 [2018-04-10 16:31:38,815 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:38,865 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 2 case distinctions, treesize of input 106 treesize of output 116 [2018-04-10 16:31:38,865 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-10 16:31:38,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 48 [2018-04-10 16:31:38,918 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:38,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 4 dim-1 vars, End of recursive call: 12 dim-0 vars, and 5 xjuncts. [2018-04-10 16:31:38,985 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 13 variables, input treesize:299, output treesize:331 [2018-04-10 16:31:39,581 WARN L148 SmtUtils]: Spent 468ms on a formula simplification that was a NOOP. DAG size: 127 [2018-04-10 16:31:39,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 52 [2018-04-10 16:31:39,591 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:31:39,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 16:31:39,591 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:39,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:39,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 86 [2018-04-10 16:31:39,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 16:31:39,685 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:39,699 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:31:39,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2018-04-10 16:31:39,700 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:39,710 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:39,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 105 treesize of output 83 [2018-04-10 16:31:39,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 79 treesize of output 72 [2018-04-10 16:31:39,784 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:39,847 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:31:39,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 64 [2018-04-10 16:31:39,880 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:39,910 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:31:39,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 54 [2018-04-10 16:31:39,911 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:39,929 INFO L267 ElimStorePlain]: Start of recursive call 7: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:39,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 48 [2018-04-10 16:31:39,995 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:31:39,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 16:31:39,996 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:40,002 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:40,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 64 [2018-04-10 16:31:40,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 16:31:40,063 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:40,074 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:31:40,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2018-04-10 16:31:40,075 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:40,083 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:40,137 INFO L267 ElimStorePlain]: Start of recursive call 1: 15 dim-0 vars, 5 dim-2 vars, End of recursive call: 15 dim-0 vars, and 5 xjuncts. [2018-04-10 16:31:40,137 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 20 variables, input treesize:419, output treesize:246 [2018-04-10 16:31:41,666 WARN L148 SmtUtils]: Spent 1496ms on a formula simplification that was a NOOP. DAG size: 113 [2018-04-10 16:31:43,071 WARN L151 SmtUtils]: Spent 1329ms on a formula simplification. DAG size of input: 211 DAG size of output 122 [2018-04-10 16:31:43,198 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:43,200 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:43,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 77 [2018-04-10 16:31:43,212 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:31:43,216 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 70 [2018-04-10 16:31:43,217 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-10 16:31:43,278 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:43,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 51 [2018-04-10 16:31:43,279 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:43,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2018-04-10 16:31:43,327 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:43,367 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:31:43,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2018-04-10 16:31:43,368 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:43,439 INFO L267 ElimStorePlain]: Start of recursive call 2: 7 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:43,476 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 48 treesize of output 40 [2018-04-10 16:31:43,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10 16:31:43,480 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:43,489 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:31:43,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-04-10 16:31:43,489 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:43,496 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:43,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 74 [2018-04-10 16:31:43,534 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 63 treesize of output 55 [2018-04-10 16:31:43,534 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:43,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 56 [2018-04-10 16:31:43,605 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-04-10 16:31:43,666 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:31:43,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2018-04-10 16:31:43,667 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:43,747 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:43,747 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:31:43,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2018-04-10 16:31:43,749 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:43,843 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 38 treesize of output 33 [2018-04-10 16:31:43,843 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:43,904 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:31:43,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2018-04-10 16:31:43,905 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:43,906 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:31:43,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2018-04-10 16:31:43,906 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:43,983 INFO L267 ElimStorePlain]: Start of recursive call 10: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-10 16:31:44,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 17 dim-0 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:31:44,024 INFO L202 ElimStorePlain]: Needed 17 recursive calls to eliminate 20 variables, input treesize:200, output treesize:16 [2018-04-10 16:31:44,062 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:31:44,062 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:31:44,062 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-10 16:31:44,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-10 16:31:44,063 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-10 16:31:44,063 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2018-04-10 16:31:44,063 INFO L87 Difference]: Start difference. First operand 230 states and 255 transitions. Second operand 19 states. [2018-04-10 16:31:44,950 WARN L151 SmtUtils]: Spent 244ms on a formula simplification. DAG size of input: 164 DAG size of output 121 [2018-04-10 16:31:45,179 WARN L151 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 190 DAG size of output 125 [2018-04-10 16:31:45,769 WARN L151 SmtUtils]: Spent 442ms on a formula simplification. DAG size of input: 225 DAG size of output 171 [2018-04-10 16:31:52,544 WARN L151 SmtUtils]: Spent 6666ms on a formula simplification. DAG size of input: 273 DAG size of output 210 [2018-04-10 16:31:53,195 WARN L151 SmtUtils]: Spent 556ms on a formula simplification. DAG size of input: 269 DAG size of output 171 [2018-04-10 16:31:53,624 WARN L151 SmtUtils]: Spent 310ms on a formula simplification. DAG size of input: 244 DAG size of output 140 [2018-04-10 16:31:55,332 WARN L151 SmtUtils]: Spent 1272ms on a formula simplification. DAG size of input: 247 DAG size of output 143 [2018-04-10 16:31:56,055 WARN L151 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 126 DAG size of output 118 [2018-04-10 16:31:56,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:31:56,379 INFO L93 Difference]: Finished difference Result 304 states and 333 transitions. [2018-04-10 16:31:56,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-10 16:31:56,379 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 40 [2018-04-10 16:31:56,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:31:56,380 INFO L225 Difference]: With dead ends: 304 [2018-04-10 16:31:56,381 INFO L226 Difference]: Without dead ends: 304 [2018-04-10 16:31:56,381 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=320, Invalid=1320, Unknown=0, NotChecked=0, Total=1640 [2018-04-10 16:31:56,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-04-10 16:31:56,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 230. [2018-04-10 16:31:56,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-04-10 16:31:56,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 254 transitions. [2018-04-10 16:31:56,385 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 254 transitions. Word has length 40 [2018-04-10 16:31:56,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:31:56,385 INFO L459 AbstractCegarLoop]: Abstraction has 230 states and 254 transitions. [2018-04-10 16:31:56,385 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-10 16:31:56,385 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 254 transitions. [2018-04-10 16:31:56,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-10 16:31:56,386 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:31:56,386 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:31:56,386 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:31:56,386 INFO L82 PathProgramCache]: Analyzing trace with hash 364674279, now seen corresponding path program 1 times [2018-04-10 16:31:56,386 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:31:56,387 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:31:56,387 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:56,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:31:56,387 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:56,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:31:56,395 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:31:56,400 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:31:56,401 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:31:56,401 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:31:56,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:31:56,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:31:56,430 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:31:56,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:31:56,479 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:56,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:56,481 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:31:56,496 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:56,496 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:56,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-10 16:31:56,497 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:56,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:31:56,504 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:56,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:56,510 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-04-10 16:31:56,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-10 16:31:56,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-10 16:31:56,523 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:56,524 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:56,533 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-10 16:31:56,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:31:56,534 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:56,535 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:56,541 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-10 16:31:56,541 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2018-04-10 16:31:56,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-04-10 16:31:56,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:31:56,571 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:56,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:56,589 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 52 treesize of output 56 [2018-04-10 16:31:56,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-10 16:31:56,590 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:56,595 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:56,605 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-10 16:31:56,606 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:88, output treesize:72 [2018-04-10 16:31:56,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 49 [2018-04-10 16:31:56,670 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:56,670 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:31:56,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 44 [2018-04-10 16:31:56,671 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:56,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:56,697 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 74 treesize of output 64 [2018-04-10 16:31:56,699 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:56,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-04-10 16:31:56,700 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:56,708 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:56,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:31:56,719 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:114, output treesize:98 [2018-04-10 16:31:56,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-10 16:31:56,769 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:56,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:31:56,781 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:96 [2018-04-10 16:31:56,814 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 73 treesize of output 56 [2018-04-10 16:31:56,816 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:56,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-10 16:31:56,817 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:56,825 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:31:56,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 29 [2018-04-10 16:31:56,826 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:56,830 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:56,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2018-04-10 16:31:56,843 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:31:56,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2018-04-10 16:31:56,844 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:56,851 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:56,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-10 16:31:56,851 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:56,855 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:56,860 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-10 16:31:56,861 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:110, output treesize:12 [2018-04-10 16:31:56,881 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:31:56,881 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:31:56,881 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-10 16:31:56,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-10 16:31:56,881 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-10 16:31:56,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-04-10 16:31:56,881 INFO L87 Difference]: Start difference. First operand 230 states and 254 transitions. Second operand 15 states. [2018-04-10 16:31:57,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:31:57,866 INFO L93 Difference]: Finished difference Result 314 states and 343 transitions. [2018-04-10 16:31:57,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-10 16:31:57,867 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2018-04-10 16:31:57,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:31:57,867 INFO L225 Difference]: With dead ends: 314 [2018-04-10 16:31:57,868 INFO L226 Difference]: Without dead ends: 314 [2018-04-10 16:31:57,868 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=169, Invalid=587, Unknown=0, NotChecked=0, Total=756 [2018-04-10 16:31:57,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-04-10 16:31:57,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 230. [2018-04-10 16:31:57,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-04-10 16:31:57,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 253 transitions. [2018-04-10 16:31:57,871 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 253 transitions. Word has length 40 [2018-04-10 16:31:57,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:31:57,871 INFO L459 AbstractCegarLoop]: Abstraction has 230 states and 253 transitions. [2018-04-10 16:31:57,871 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-10 16:31:57,871 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 253 transitions. [2018-04-10 16:31:57,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-10 16:31:57,872 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:31:57,872 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:31:57,872 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:31:57,872 INFO L82 PathProgramCache]: Analyzing trace with hash -275087979, now seen corresponding path program 1 times [2018-04-10 16:31:57,872 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:31:57,872 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:31:57,873 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:57,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:31:57,874 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:57,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:31:57,880 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:31:57,924 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-10 16:31:57,924 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-10 16:31:57,924 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-10 16:31:57,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-10 16:31:57,924 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-10 16:31:57,924 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-10 16:31:57,925 INFO L87 Difference]: Start difference. First operand 230 states and 253 transitions. Second operand 5 states. [2018-04-10 16:31:58,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:31:58,022 INFO L93 Difference]: Finished difference Result 242 states and 264 transitions. [2018-04-10 16:31:58,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-10 16:31:58,022 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-04-10 16:31:58,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:31:58,022 INFO L225 Difference]: With dead ends: 242 [2018-04-10 16:31:58,023 INFO L226 Difference]: Without dead ends: 242 [2018-04-10 16:31:58,023 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-10 16:31:58,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-04-10 16:31:58,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 226. [2018-04-10 16:31:58,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-04-10 16:31:58,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 248 transitions. [2018-04-10 16:31:58,025 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 248 transitions. Word has length 42 [2018-04-10 16:31:58,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:31:58,025 INFO L459 AbstractCegarLoop]: Abstraction has 226 states and 248 transitions. [2018-04-10 16:31:58,025 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-10 16:31:58,025 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 248 transitions. [2018-04-10 16:31:58,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-10 16:31:58,025 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:31:58,025 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] [2018-04-10 16:31:58,025 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:31:58,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1171852504, now seen corresponding path program 1 times [2018-04-10 16:31:58,026 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:31:58,026 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:31:58,026 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:58,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:31:58,026 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:31:58,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:31:58,032 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:31:58,034 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:31:58,034 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:31:58,034 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:31:58,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:31:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:31:58,057 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:31:58,091 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:58,091 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:31:58,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-10 16:31:58,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:58,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:58,099 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2018-04-10 16:31:58,112 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-10 16:31:58,113 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-10 16:31:58,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:58,115 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:58,123 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-10 16:31:58,123 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:35 [2018-04-10 16:31:58,159 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 39 treesize of output 35 [2018-04-10 16:31:58,160 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:31:58,160 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:31:58,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:31:58,170 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-10 16:31:58,170 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:48 [2018-04-10 16:31:58,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2018-04-10 16:31:58,220 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 20 treesize of output 31 [2018-04-10 16:31:58,220 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:31:58,229 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:31:58,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2018-04-10 16:31:58,245 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:64, output treesize:102 [2018-04-10 16:32:06,296 WARN L148 SmtUtils]: Spent 8037ms on a formula simplification that was a NOOP. DAG size: 47 [2018-04-10 16:32:14,337 WARN L148 SmtUtils]: Spent 8017ms on a formula simplification that was a NOOP. DAG size: 47 [2018-04-10 16:32:14,343 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 66 treesize of output 53 [2018-04-10 16:32:14,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 10 [2018-04-10 16:32:14,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:32:14,356 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:32:14,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-04-10 16:32:14,357 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:14,365 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:32:14,391 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 55 treesize of output 48 [2018-04-10 16:32:14,392 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:32:14,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-04-10 16:32:14,393 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:14,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 16:32:14,402 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:32:14,407 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:32:14,426 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-10 16:32:14,426 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 11 variables, input treesize:122, output treesize:46 [2018-04-10 16:32:14,475 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:32:14,476 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:32:14,476 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-10 16:32:14,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-10 16:32:14,476 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-10 16:32:14,476 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2018-04-10 16:32:14,476 INFO L87 Difference]: Start difference. First operand 226 states and 248 transitions. Second operand 17 states. [2018-04-10 16:32:30,798 WARN L151 SmtUtils]: Spent 16039ms on a formula simplification. DAG size of input: 60 DAG size of output 53 [2018-04-10 16:32:42,877 WARN L151 SmtUtils]: Spent 12044ms on a formula simplification. DAG size of input: 91 DAG size of output 54 [2018-04-10 16:32:55,004 WARN L151 SmtUtils]: Spent 12053ms on a formula simplification. DAG size of input: 98 DAG size of output 57 [2018-04-10 16:33:07,089 WARN L151 SmtUtils]: Spent 12050ms on a formula simplification. DAG size of input: 98 DAG size of output 57 [2018-04-10 16:33:07,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:33:07,487 INFO L93 Difference]: Finished difference Result 309 states and 335 transitions. [2018-04-10 16:33:07,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-10 16:33:07,488 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 46 [2018-04-10 16:33:07,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:33:07,488 INFO L225 Difference]: With dead ends: 309 [2018-04-10 16:33:07,488 INFO L226 Difference]: Without dead ends: 309 [2018-04-10 16:33:07,489 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 68.7s TimeCoverageRelationStatistics Valid=290, Invalid=1042, Unknown=0, NotChecked=0, Total=1332 [2018-04-10 16:33:07,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-04-10 16:33:07,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 238. [2018-04-10 16:33:07,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-04-10 16:33:07,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 262 transitions. [2018-04-10 16:33:07,491 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 262 transitions. Word has length 46 [2018-04-10 16:33:07,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:33:07,491 INFO L459 AbstractCegarLoop]: Abstraction has 238 states and 262 transitions. [2018-04-10 16:33:07,491 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-10 16:33:07,491 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 262 transitions. [2018-04-10 16:33:07,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-10 16:33:07,491 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:33:07,491 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] [2018-04-10 16:33:07,491 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:33:07,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1171852503, now seen corresponding path program 1 times [2018-04-10 16:33:07,492 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:33:07,492 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:33:07,492 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:33:07,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:33:07,492 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:33:07,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:33:07,498 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:33:07,502 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:33:07,502 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:33:07,502 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:33:07,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:33:07,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:33:07,523 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:33:07,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:33:07,540 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:07,550 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:07,551 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:07,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-10 16:33:07,552 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:07,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:07,577 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2018-04-10 16:33:07,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-10 16:33:07,596 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:07,610 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-10 16:33:07,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-10 16:33:07,613 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:07,616 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:07,629 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-10 16:33:07,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:33:07,631 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:07,633 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:07,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:07,640 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:51, output treesize:34 [2018-04-10 16:33:07,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 56 [2018-04-10 16:33:07,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:33:07,677 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:07,683 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:07,697 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 36 treesize of output 37 [2018-04-10 16:33:07,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:33:07,699 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:07,704 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:07,714 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-10 16:33:07,714 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:83, output treesize:67 [2018-04-10 16:33:07,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 72 [2018-04-10 16:33:07,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 31 [2018-04-10 16:33:07,778 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:33:07,791 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:33:07,821 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:33:07,821 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 80 treesize of output 72 [2018-04-10 16:33:07,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 22 [2018-04-10 16:33:07,823 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:07,832 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:07,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 75 [2018-04-10 16:33:07,838 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:33:07,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 28 [2018-04-10 16:33:07,839 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:07,848 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:07,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-10 16:33:07,895 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:99, output treesize:145 [2018-04-10 16:33:08,056 WARN L148 SmtUtils]: Spent 143ms on a formula simplification that was a NOOP. DAG size: 48 [2018-04-10 16:33:10,168 WARN L148 SmtUtils]: Spent 2097ms on a formula simplification that was a NOOP. DAG size: 48 [2018-04-10 16:33:10,174 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 100 treesize of output 83 [2018-04-10 16:33:10,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 10 [2018-04-10 16:33:10,178 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-10 16:33:10,191 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:33:10,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 29 [2018-04-10 16:33:10,192 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:10,203 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:33:10,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 43 [2018-04-10 16:33:10,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2018-04-10 16:33:10,241 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:10,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-04-10 16:33:10,247 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:10,252 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:10,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 46 [2018-04-10 16:33:10,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-04-10 16:33:10,255 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:10,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-04-10 16:33:10,263 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:10,268 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:10,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 69 [2018-04-10 16:33:10,296 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:33:10,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2018-04-10 16:33:10,297 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:10,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 16:33:10,306 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:10,312 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:10,335 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 43 treesize of output 35 [2018-04-10 16:33:10,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-04-10 16:33:10,336 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:10,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-04-10 16:33:10,342 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:10,348 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:10,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:33:10,366 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 11 variables, input treesize:179, output treesize:23 [2018-04-10 16:33:10,404 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:33:10,404 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:33:10,404 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-10 16:33:10,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-10 16:33:10,405 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-10 16:33:10,405 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2018-04-10 16:33:10,405 INFO L87 Difference]: Start difference. First operand 238 states and 262 transitions. Second operand 17 states. [2018-04-10 16:33:11,092 WARN L148 SmtUtils]: Spent 346ms on a formula simplification that was a NOOP. DAG size: 51 [2018-04-10 16:33:24,422 WARN L151 SmtUtils]: Spent 13297ms on a formula simplification. DAG size of input: 97 DAG size of output 56 [2018-04-10 16:33:35,024 WARN L151 SmtUtils]: Spent 10559ms on a formula simplification. DAG size of input: 106 DAG size of output 65 [2018-04-10 16:33:47,215 WARN L151 SmtUtils]: Spent 12159ms on a formula simplification. DAG size of input: 106 DAG size of output 65 [2018-04-10 16:33:47,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:33:47,528 INFO L93 Difference]: Finished difference Result 310 states and 337 transitions. [2018-04-10 16:33:47,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-10 16:33:47,528 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 46 [2018-04-10 16:33:47,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:33:47,529 INFO L225 Difference]: With dead ends: 310 [2018-04-10 16:33:47,529 INFO L226 Difference]: Without dead ends: 310 [2018-04-10 16:33:47,530 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 39.0s TimeCoverageRelationStatistics Valid=244, Invalid=1016, Unknown=0, NotChecked=0, Total=1260 [2018-04-10 16:33:47,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-04-10 16:33:47,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 237. [2018-04-10 16:33:47,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-04-10 16:33:47,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 260 transitions. [2018-04-10 16:33:47,533 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 260 transitions. Word has length 46 [2018-04-10 16:33:47,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:33:47,534 INFO L459 AbstractCegarLoop]: Abstraction has 237 states and 260 transitions. [2018-04-10 16:33:47,534 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-10 16:33:47,534 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 260 transitions. [2018-04-10 16:33:47,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-10 16:33:47,534 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:33:47,535 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:33:47,535 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:33:47,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1165044608, now seen corresponding path program 1 times [2018-04-10 16:33:47,535 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:33:47,535 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:33:47,536 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:33:47,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:33:47,536 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:33:47,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:33:47,544 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:33:47,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:33:47,580 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:33:47,580 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:33:47,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:33:47,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:33:47,601 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:33:47,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10 16:33:47,605 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:47,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:47,606 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2018-04-10 16:33:47,617 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:33:47,617 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-10 16:33:47,617 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 6 [2018-04-10 16:33:47,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-10 16:33:47,618 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-10 16:33:47,618 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-04-10 16:33:47,618 INFO L87 Difference]: Start difference. First operand 237 states and 260 transitions. Second operand 7 states. [2018-04-10 16:33:47,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:33:47,828 INFO L93 Difference]: Finished difference Result 290 states and 315 transitions. [2018-04-10 16:33:47,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-10 16:33:47,828 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2018-04-10 16:33:47,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:33:47,829 INFO L225 Difference]: With dead ends: 290 [2018-04-10 16:33:47,829 INFO L226 Difference]: Without dead ends: 290 [2018-04-10 16:33:47,829 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-04-10 16:33:47,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-04-10 16:33:47,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 242. [2018-04-10 16:33:47,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-04-10 16:33:47,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 269 transitions. [2018-04-10 16:33:47,833 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 269 transitions. Word has length 49 [2018-04-10 16:33:47,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:33:47,833 INFO L459 AbstractCegarLoop]: Abstraction has 242 states and 269 transitions. [2018-04-10 16:33:47,833 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-10 16:33:47,833 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 269 transitions. [2018-04-10 16:33:47,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-10 16:33:47,834 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:33:47,834 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:33:47,834 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:33:47,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1165044607, now seen corresponding path program 1 times [2018-04-10 16:33:47,834 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:33:47,834 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:33:47,835 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:33:47,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:33:47,835 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:33:47,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:33:47,844 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:33:47,847 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:33:47,847 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:33:47,847 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:33:47,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:33:47,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:33:47,866 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:33:47,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:33:47,875 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:47,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:47,877 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-10 16:33:47,898 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:47,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-10 16:33:47,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:47,910 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:47,911 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:47,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-10 16:33:47,911 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:47,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:33:47,919 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:31 [2018-04-10 16:33:47,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-10 16:33:47,929 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:47,932 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-10 16:33:47,933 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2018-04-10 16:33:48,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:33:48,024 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:33:48,024 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-10 16:33:48,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-10 16:33:48,024 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-10 16:33:48,025 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-04-10 16:33:48,025 INFO L87 Difference]: Start difference. First operand 242 states and 269 transitions. Second operand 11 states. [2018-04-10 16:33:48,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:33:48,746 INFO L93 Difference]: Finished difference Result 353 states and 388 transitions. [2018-04-10 16:33:48,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-10 16:33:48,746 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2018-04-10 16:33:48,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:33:48,748 INFO L225 Difference]: With dead ends: 353 [2018-04-10 16:33:48,748 INFO L226 Difference]: Without dead ends: 353 [2018-04-10 16:33:48,748 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=353, Unknown=2, NotChecked=0, Total=506 [2018-04-10 16:33:48,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-04-10 16:33:48,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 258. [2018-04-10 16:33:48,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-04-10 16:33:48,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 290 transitions. [2018-04-10 16:33:48,751 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 290 transitions. Word has length 49 [2018-04-10 16:33:48,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:33:48,751 INFO L459 AbstractCegarLoop]: Abstraction has 258 states and 290 transitions. [2018-04-10 16:33:48,751 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-10 16:33:48,752 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 290 transitions. [2018-04-10 16:33:48,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-10 16:33:48,752 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:33:48,752 INFO L355 BasicCegarLoop]: trace histogram [3, 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] [2018-04-10 16:33:48,752 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:33:48,753 INFO L82 PathProgramCache]: Analyzing trace with hash 571776038, now seen corresponding path program 2 times [2018-04-10 16:33:48,753 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:33:48,753 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:33:48,754 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:33:48,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-10 16:33:48,754 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:33:48,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:33:48,763 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:33:48,774 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:33:48,774 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:33:48,774 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:33:48,775 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-10 16:33:48,800 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-10 16:33:48,800 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:33:48,803 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:33:48,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:33:48,811 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:48,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:48,812 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-10 16:33:48,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-10 16:33:48,818 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:48,827 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:48,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-10 16:33:48,827 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:48,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:48,836 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:19 [2018-04-10 16:33:48,872 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:48,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-10 16:33:48,872 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:48,887 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:48,888 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:48,888 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:48,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 34 [2018-04-10 16:33:48,889 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:48,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:48,907 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:42 [2018-04-10 16:33:48,940 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-10 16:33:48,942 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-10 16:33:48,942 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:48,944 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:48,960 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-10 16:33:48,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:33:48,962 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:48,963 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:48,974 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-10 16:33:48,974 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:61, output treesize:58 [2018-04-10 16:33:49,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 81 [2018-04-10 16:33:49,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:33:49,036 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:49,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:49,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 51 [2018-04-10 16:33:49,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-04-10 16:33:49,070 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:49,074 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:49,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:49,087 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:108, output treesize:92 [2018-04-10 16:33:49,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 66 [2018-04-10 16:33:49,171 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:49,171 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:33:49,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 56 [2018-04-10 16:33:49,172 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:49,179 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:49,200 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:49,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 94 [2018-04-10 16:33:49,203 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:49,203 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:49,203 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 29 treesize of output 53 [2018-04-10 16:33:49,204 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:49,215 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:49,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:49,229 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:125, output treesize:109 [2018-04-10 16:33:49,257 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:49,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 12 [2018-04-10 16:33:49,257 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:49,270 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-10 16:33:49,270 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:121, output treesize:96 [2018-04-10 16:33:49,367 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:49,368 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:49,368 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:49,369 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:49,369 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 29 treesize of output 21 [2018-04-10 16:33:49,369 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:49,383 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:49,383 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:49,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 84 [2018-04-10 16:33:49,391 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:49,392 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:33:49,394 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:49,399 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 80 [2018-04-10 16:33:49,400 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-10 16:33:49,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2018-04-10 16:33:49,415 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-10 16:33:49,420 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:33:49,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 41 [2018-04-10 16:33:49,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 19 [2018-04-10 16:33:49,431 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:49,436 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:49,437 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:49,437 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:33:49,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 22 [2018-04-10 16:33:49,437 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:49,441 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:49,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:49,447 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:132, output treesize:7 [2018-04-10 16:33:49,472 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:33:49,473 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:33:49,473 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-10 16:33:49,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-10 16:33:49,473 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-10 16:33:49,473 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2018-04-10 16:33:49,473 INFO L87 Difference]: Start difference. First operand 258 states and 290 transitions. Second operand 19 states. [2018-04-10 16:33:50,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-10 16:33:50,970 INFO L93 Difference]: Finished difference Result 291 states and 318 transitions. [2018-04-10 16:33:50,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-10 16:33:50,970 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-04-10 16:33:50,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-10 16:33:50,971 INFO L225 Difference]: With dead ends: 291 [2018-04-10 16:33:50,971 INFO L226 Difference]: Without dead ends: 291 [2018-04-10 16:33:50,971 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=264, Invalid=1068, Unknown=0, NotChecked=0, Total=1332 [2018-04-10 16:33:50,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-04-10 16:33:50,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 251. [2018-04-10 16:33:50,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-04-10 16:33:50,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 280 transitions. [2018-04-10 16:33:50,973 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 280 transitions. Word has length 49 [2018-04-10 16:33:50,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-10 16:33:50,973 INFO L459 AbstractCegarLoop]: Abstraction has 251 states and 280 transitions. [2018-04-10 16:33:50,973 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-10 16:33:50,973 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 280 transitions. [2018-04-10 16:33:50,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-04-10 16:33:50,974 INFO L347 BasicCegarLoop]: Found error trace [2018-04-10 16:33:50,974 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-10 16:33:50,974 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr51RequiresViolation, mainErr26RequiresViolation, mainErr54RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr31RequiresViolation, mainErr46RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr58RequiresViolation, mainErr15RequiresViolation, mainErr49RequiresViolation, mainErr63AssertViolationMEMORY_FREE, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr55RequiresViolation, mainErr17RequiresViolation, mainErr42RequiresViolation, mainErr30RequiresViolation, mainErr11RequiresViolation, mainErr57RequiresViolation, mainErr24RequiresViolation, mainErr44RequiresViolation, mainErr10RequiresViolation, mainErr43RequiresViolation, mainErr4RequiresViolation, mainErr50RequiresViolation, mainErr37RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr61RequiresViolation, mainErr59RequiresViolation, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr21RequiresViolation, mainErr41RequiresViolation, mainErr56RequiresViolation, mainErr62AssertViolationMEMORY_FREE, mainErr64EnsuresViolationMEMORY_LEAK, mainErr48RequiresViolation, mainErr39RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr52RequiresViolation, mainErr45RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr60RequiresViolation, mainErr9RequiresViolation, mainErr53RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr8RequiresViolation, mainErr34RequiresViolation, mainErr47RequiresViolation, mainErr14RequiresViolation, mainErr40RequiresViolation]=== [2018-04-10 16:33:50,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1801919173, now seen corresponding path program 3 times [2018-04-10 16:33:50,974 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-10 16:33:50,974 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-10 16:33:50,974 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:33:50,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-10 16:33:50,975 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-10 16:33:50,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-10 16:33:50,981 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-10 16:33:50,984 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-10 16:33:50,984 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-10 16:33:50,984 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-10 16:33:50,985 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-10 16:33:51,012 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-10 16:33:51,012 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-10 16:33:51,014 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-10 16:33:51,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:33:51,028 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:51,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:33:51,032 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:51,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:51,035 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-10 16:33:51,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-10 16:33:51,063 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:51,073 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-10 16:33:51,073 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:51,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:51,081 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:33 [2018-04-10 16:33:51,101 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-10 16:33:51,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:33:51,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:51,104 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:51,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-10 16:33:51,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-10 16:33:51,114 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:51,115 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:51,123 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-10 16:33:51,123 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:52, output treesize:45 [2018-04-10 16:33:51,168 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 36 treesize of output 50 [2018-04-10 16:33:51,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-04-10 16:33:51,170 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:51,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:51,212 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 53 treesize of output 58 [2018-04-10 16:33:51,215 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:51,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 51 [2018-04-10 16:33:51,216 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-10 16:33:51,222 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:33:51,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 46 treesize of output 45 [2018-04-10 16:33:51,237 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:51,246 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:51,256 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-10 16:33:51,256 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:94, output treesize:78 [2018-04-10 16:33:51,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 35 [2018-04-10 16:33:51,281 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:51,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-04-10 16:33:51,282 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:51,291 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:51,299 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-10 16:33:51,299 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:86, output treesize:58 [2018-04-10 16:33:51,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 52 [2018-04-10 16:33:51,347 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:51,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 52 [2018-04-10 16:33:51,355 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:51,379 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:51,379 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:33:51,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 44 [2018-04-10 16:33:51,381 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:51,396 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:33:51,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-10 16:33:51,410 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:69, output treesize:101 [2018-04-10 16:33:51,452 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:51,452 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 59 treesize of output 62 [2018-04-10 16:33:51,452 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:51,488 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:51,489 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:51,490 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:51,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 105 [2018-04-10 16:33:51,491 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:51,525 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 93 treesize of output 98 [2018-04-10 16:33:51,525 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:51,560 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:51,561 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:51,561 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 58 treesize of output 62 [2018-04-10 16:33:51,561 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:51,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-10 16:33:51,594 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:141, output treesize:155 [2018-04-10 16:33:51,645 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 75 treesize of output 68 [2018-04-10 16:33:51,647 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:51,648 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:51,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 33 [2018-04-10 16:33:51,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:51,664 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:51,709 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 117 treesize of output 118 [2018-04-10 16:33:51,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:33:51,711 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:51,731 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:51,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 67 [2018-04-10 16:33:51,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:33:51,734 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:51,745 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:51,788 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:51,795 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 3 case distinctions, treesize of input 117 treesize of output 120 [2018-04-10 16:33:51,803 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:51,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 124 [2018-04-10 16:33:51,805 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:51,861 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:51,861 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:33:51,861 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 78 [2018-04-10 16:33:51,862 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:51,895 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:33:51,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-04-10 16:33:51,942 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:193, output treesize:255 [2018-04-10 16:33:52,079 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:52,079 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:52,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 173 [2018-04-10 16:33:52,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:33:52,087 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:52,109 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:52,163 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 145 treesize of output 150 [2018-04-10 16:33:52,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-10 16:33:52,165 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:52,182 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:52,239 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:52,242 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 113 treesize of output 117 [2018-04-10 16:33:52,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-10 16:33:52,243 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:52,258 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:52,300 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:52,303 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 106 [2018-04-10 16:33:52,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-10 16:33:52,304 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:52,318 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:52,353 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-10 16:33:52,353 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:271, output treesize:235 [2018-04-10 16:33:52,571 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:52,592 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 123 treesize of output 147 [2018-04-10 16:33:52,596 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-10 16:33:52,596 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:52,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 114 [2018-04-10 16:33:52,789 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:52,905 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:52,905 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:33:52,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 112 [2018-04-10 16:33:52,907 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-10 16:33:53,016 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 108 treesize of output 123 [2018-04-10 16:33:53,017 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-10 16:33:53,120 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-10 16:33:53,218 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-04-10 16:33:53,388 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:33:53,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 109 [2018-04-10 16:33:53,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 54 [2018-04-10 16:33:53,392 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:53,409 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:53,411 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:33:53,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 113 [2018-04-10 16:33:53,415 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:33:53,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, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-04-10 16:33:53,415 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:53,429 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:53,450 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 114 treesize of output 141 [2018-04-10 16:33:53,453 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 126 [2018-04-10 16:33:53,453 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:53,510 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:53,513 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:33:53,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 149 [2018-04-10 16:33:53,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 24 [2018-04-10 16:33:53,517 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:53,538 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:53,675 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:53,680 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:53,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 204 treesize of output 202 [2018-04-10 16:33:53,710 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-10 16:33:53,722 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-10 16:33:54,204 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:54,204 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:33:54,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 158 treesize of output 168 [2018-04-10 16:33:54,206 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:33:54,633 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:33:55,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 201 treesize of output 208 [2018-04-10 16:33:55,040 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:55,337 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:33:55,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 150 [2018-04-10 16:33:55,338 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:33:56,232 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 194 treesize of output 217 [2018-04-10 16:33:56,233 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 2 xjuncts. [2018-04-10 16:33:56,490 INFO L267 ElimStorePlain]: Start of recursive call 16: 8 dim-1 vars, End of recursive call: 5 dim-0 vars, and 6 xjuncts. [2018-04-10 16:33:56,905 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:33:56,908 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 177 [2018-04-10 16:33:56,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2018-04-10 16:33:56,911 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:56,937 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:56,939 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:33:56,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 153 [2018-04-10 16:33:56,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 54 [2018-04-10 16:33:56,944 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:56,967 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:56,969 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:56,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 221 treesize of output 246 [2018-04-10 16:33:56,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 21 [2018-04-10 16:33:56,978 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:57,010 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:57,021 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:33:57,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 203 [2018-04-10 16:33:57,026 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:33:57,027 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32 [2018-04-10 16:33:57,027 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:57,049 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:57,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 208 treesize of output 239 [2018-04-10 16:33:57,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 225 treesize of output 232 [2018-04-10 16:33:57,075 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:57,156 INFO L267 ElimStorePlain]: Start of recursive call 31: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:57,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 148 [2018-04-10 16:33:57,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 11 [2018-04-10 16:33:57,164 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:57,189 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:57,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 25 dim-0 vars, and 10 xjuncts. [2018-04-10 16:33:57,545 INFO L202 ElimStorePlain]: Needed 34 recursive calls to eliminate 8 variables, input treesize:331, output treesize:1535 [2018-04-10 16:33:58,027 WARN L151 SmtUtils]: Spent 362ms on a formula simplification. DAG size of input: 350 DAG size of output 234 [2018-04-10 16:33:58,041 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:58,041 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 202 treesize of output 193 [2018-04-10 16:33:58,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:58,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 75 [2018-04-10 16:33:58,217 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:58,370 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:58,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 96 [2018-04-10 16:33:58,370 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:58,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 139 [2018-04-10 16:33:58,537 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:58,679 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 141 treesize of output 140 [2018-04-10 16:33:58,679 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:58,825 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 118 treesize of output 122 [2018-04-10 16:33:58,826 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-10 16:33:58,967 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:58,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 216 treesize of output 263 [2018-04-10 16:33:58,979 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-04-10 16:33:59,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 17 dim-0 vars, 7 dim-1 vars, End of recursive call: 17 dim-0 vars, and 7 xjuncts. [2018-04-10 16:33:59,116 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 24 variables, input treesize:1069, output treesize:822 [2018-04-10 16:33:59,350 WARN L148 SmtUtils]: Spent 146ms on a formula simplification that was a NOOP. DAG size: 214 [2018-04-10 16:33:59,591 WARN L148 SmtUtils]: Spent 115ms on a formula simplification that was a NOOP. DAG size: 214 [2018-04-10 16:33:59,602 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:59,602 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:33:59,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 156 [2018-04-10 16:33:59,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-10 16:33:59,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:59,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-10 16:33:59,627 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:59,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 5 treesize of output 1 [2018-04-10 16:33:59,639 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:59,649 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:33:59,797 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 139 treesize of output 143 [2018-04-10 16:33:59,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 134 [2018-04-10 16:33:59,799 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:59,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 114 [2018-04-10 16:33:59,842 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:59,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 122 [2018-04-10 16:33:59,881 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:59,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 95 [2018-04-10 16:33:59,930 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 16:33:59,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 100 [2018-04-10 16:33:59,966 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:00,000 INFO L267 ElimStorePlain]: Start of recursive call 6: 5 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:34:00,171 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 100 treesize of output 82 [2018-04-10 16:34:00,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 16 [2018-04-10 16:34:00,173 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:00,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 7 [2018-04-10 16:34:00,184 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:00,192 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:00,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 114 [2018-04-10 16:34:00,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 7 treesize of output 1 [2018-04-10 16:34:00,360 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:00,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 9 [2018-04-10 16:34:00,376 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:00,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-10 16:34:00,391 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:00,403 INFO L267 ElimStorePlain]: Start of recursive call 15: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:00,549 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 89 treesize of output 75 [2018-04-10 16:34:00,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-04-10 16:34:00,550 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:00,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-10 16:34:00,560 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:00,567 INFO L267 ElimStorePlain]: Start of recursive call 19: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:00,738 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 107 treesize of output 111 [2018-04-10 16:34:00,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 96 [2018-04-10 16:34:00,742 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:00,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 103 [2018-04-10 16:34:00,813 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:00,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 89 [2018-04-10 16:34:00,886 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:00,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 72 [2018-04-10 16:34:00,949 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:00,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 90 [2018-04-10 16:34:00,997 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:01,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 83 treesize of output 68 [2018-04-10 16:34:01,084 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:01,111 INFO L267 ElimStorePlain]: Start of recursive call 22: 8 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:01,254 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:01,255 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:01,269 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 3 case distinctions, treesize of input 188 treesize of output 212 [2018-04-10 16:34:01,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 200 treesize of output 193 [2018-04-10 16:34:01,273 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:01,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 166 [2018-04-10 16:34:01,492 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:01,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 161 [2018-04-10 16:34:01,704 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:02,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 154 [2018-04-10 16:34:02,083 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:02,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 176 treesize of output 179 [2018-04-10 16:34:02,285 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:02,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 164 [2018-04-10 16:34:02,480 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:02,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 153 [2018-04-10 16:34:02,662 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:02,838 INFO L682 Elim1Store]: detected equality via solver [2018-04-10 16:34:02,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 159 [2018-04-10 16:34:02,839 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:03,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 170 [2018-04-10 16:34:03,021 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:03,189 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 141 [2018-04-10 16:34:03,189 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:03,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 165 treesize of output 160 [2018-04-10 16:34:03,338 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:03,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 147 [2018-04-10 16:34:03,490 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:03,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 160 treesize of output 153 [2018-04-10 16:34:03,639 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:03,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 142 [2018-04-10 16:34:03,770 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:03,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 139 [2018-04-10 16:34:03,890 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:03,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 133 [2018-04-10 16:34:03,997 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:04,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 134 [2018-04-10 16:34:04,080 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:04,231 INFO L267 ElimStorePlain]: Start of recursive call 29: 20 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-10 16:34:04,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 17 dim-0 vars, 7 dim-2 vars, End of recursive call: 23 dim-0 vars, and 9 xjuncts. [2018-04-10 16:34:04,383 INFO L202 ElimStorePlain]: Needed 46 recursive calls to eliminate 24 variables, input treesize:920, output treesize:854 [2018-04-10 16:34:04,652 WARN L151 SmtUtils]: Spent 200ms on a formula simplification. DAG size of input: 214 DAG size of output 168 [2018-04-10 16:34:05,414 WARN L151 SmtUtils]: Spent 659ms on a formula simplification. DAG size of input: 171 DAG size of output 168 [2018-04-10 16:34:05,772 WARN L151 SmtUtils]: Spent 281ms on a formula simplification. DAG size of input: 140 DAG size of output 116 [2018-04-10 16:34:05,788 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 97 treesize of output 71 [2018-04-10 16:34:05,789 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 34 treesize of output 33 [2018-04-10 16:34:05,790 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:05,803 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:05,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 12 [2018-04-10 16:34:05,804 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:05,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 14 [2018-04-10 16:34:05,815 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:05,822 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:05,877 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:05,878 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:05,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 68 [2018-04-10 16:34:05,890 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 68 [2018-04-10 16:34:05,891 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-10 16:34:05,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 53 [2018-04-10 16:34:05,920 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:05,944 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 36 [2018-04-10 16:34:05,944 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-04-10 16:34:05,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 48 [2018-04-10 16:34:05,970 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:05,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 36 [2018-04-10 16:34:05,993 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:06,013 INFO L267 ElimStorePlain]: Start of recursive call 6: 5 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-10 16:34:06,082 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:06,083 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:06,085 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:06,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 131 treesize of output 112 [2018-04-10 16:34:06,106 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 93 [2018-04-10 16:34:06,107 INFO L267 ElimStorePlain]: Start of recursive call 13: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-04-10 16:34:06,231 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:06,232 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:06,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 72 [2018-04-10 16:34:06,232 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:06,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 73 treesize of output 64 [2018-04-10 16:34:06,340 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:06,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 54 [2018-04-10 16:34:06,341 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:06,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 66 [2018-04-10 16:34:06,343 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:06,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 51 [2018-04-10 16:34:06,431 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:06,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 61 [2018-04-10 16:34:06,436 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-04-10 16:34:06,437 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 54 treesize of output 43 [2018-04-10 16:34:06,437 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:06,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 65 [2018-04-10 16:34:06,524 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:06,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 50 [2018-04-10 16:34:06,608 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:06,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2018-04-10 16:34:06,686 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:06,768 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 60 treesize of output 49 [2018-04-10 16:34:06,768 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:06,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 70 [2018-04-10 16:34:06,843 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-10 16:34:06,912 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 64 treesize of output 63 [2018-04-10 16:34:06,912 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:06,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 49 [2018-04-10 16:34:06,983 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 2 xjuncts. [2018-04-10 16:34:07,058 INFO L267 ElimStorePlain]: Start of recursive call 12: 11 dim-1 vars, End of recursive call: 5 dim-0 vars, and 7 xjuncts. [2018-04-10 16:34:07,197 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:07,197 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:07,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2018-04-10 16:34:07,201 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 10 treesize of output 15 [2018-04-10 16:34:07,202 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:07,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2018-04-10 16:34:07,209 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:07,214 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-10 16:34:07,349 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:07,350 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:07,355 INFO L700 Elim1Store]: detected not equals via solver [2018-04-10 16:34:07,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 83 [2018-04-10 16:34:07,364 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 51 [2018-04-10 16:34:07,365 INFO L267 ElimStorePlain]: Start of recursive call 32: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-04-10 16:34:07,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-10 16:34:07,389 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:07,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 46 [2018-04-10 16:34:07,394 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 2 xjuncts. [2018-04-10 16:34:07,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 36 [2018-04-10 16:34:07,396 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-04-10 16:34:07,421 INFO L267 ElimStorePlain]: Start of recursive call 31: 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 3 xjuncts. [2018-04-10 16:34:07,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 5 dim-2 vars, End of recursive call: 21 dim-0 vars, and 13 xjuncts. [2018-04-10 16:34:07,571 INFO L202 ElimStorePlain]: Needed 35 recursive calls to eliminate 21 variables, input treesize:466, output treesize:337 [2018-04-10 16:34:09,818 WARN L151 SmtUtils]: Spent 2154ms on a formula simplification. DAG size of input: 173 DAG size of output 32 [2018-04-10 16:34:10,054 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-10 16:34:10,054 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-10 16:34:10,054 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-10 16:34:10,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-10 16:34:10,055 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-10 16:34:10,055 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=575, Unknown=0, NotChecked=0, Total=650 [2018-04-10 16:34:10,055 INFO L87 Difference]: Start difference. First operand 251 states and 280 transitions. Second operand 26 states. [2018-04-10 16:34:11,980 WARN L151 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 101 DAG size of output 85 [2018-04-10 16:34:12,394 WARN L151 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 144 DAG size of output 111 [2018-04-10 16:34:12,859 WARN L148 SmtUtils]: Spent 173ms on a formula simplification that was a NOOP. DAG size: 242 [2018-04-10 16:34:15,633 WARN L151 SmtUtils]: Spent 418ms on a formula simplification. DAG size of input: 376 DAG size of output 230 [2018-04-10 16:34:17,175 WARN L151 SmtUtils]: Spent 1168ms on a formula simplification. DAG size of input: 426 DAG size of output 268 [2018-04-10 16:34:33,646 WARN L151 SmtUtils]: Spent 16253ms on a formula simplification. DAG size of input: 442 DAG size of output 276 [2018-04-10 16:34:41,315 WARN L151 SmtUtils]: Spent 7461ms on a formula simplification. DAG size of input: 459 DAG size of output 296 [2018-04-10 16:34:42,544 WARN L151 SmtUtils]: Spent 1062ms on a formula simplification. DAG size of input: 437 DAG size of output 283 [2018-04-10 16:34:46,056 WARN L151 SmtUtils]: Spent 3281ms on a formula simplification. DAG size of input: 463 DAG size of output 300 [2018-04-10 16:34:46,723 WARN L151 SmtUtils]: Spent 513ms on a formula simplification. DAG size of input: 402 DAG size of output 247 [2018-04-10 16:34:48,167 WARN L151 SmtUtils]: Spent 1236ms on a formula simplification. DAG size of input: 481 DAG size of output 315 Received shutdown request... [2018-04-10 16:34:48,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-10 16:34:48,277 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-10 16:34:48,281 WARN L197 ceAbstractionStarter]: Timeout [2018-04-10 16:34:48,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.04 04:34:48 BoogieIcfgContainer [2018-04-10 16:34:48,281 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-10 16:34:48,282 INFO L168 Benchmark]: Toolchain (without parser) took 208818.34 ms. Allocated memory was 399.0 MB in the beginning and 736.1 MB in the end (delta: 337.1 MB). Free memory was 331.0 MB in the beginning and 445.6 MB in the end (delta: -114.5 MB). Peak memory consumption was 222.6 MB. Max. memory is 5.3 GB. [2018-04-10 16:34:48,283 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 399.0 MB. Free memory is still 354.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-10 16:34:48,283 INFO L168 Benchmark]: CACSL2BoogieTranslator took 249.50 ms. Allocated memory is still 399.0 MB. Free memory was 331.0 MB in the beginning and 302.0 MB in the end (delta: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 5.3 GB. [2018-04-10 16:34:48,283 INFO L168 Benchmark]: Boogie Preprocessor took 42.27 ms. Allocated memory is still 399.0 MB. Free memory was 302.0 MB in the beginning and 299.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-10 16:34:48,283 INFO L168 Benchmark]: RCFGBuilder took 521.95 ms. Allocated memory was 399.0 MB in the beginning and 606.1 MB in the end (delta: 207.1 MB). Free memory was 299.3 MB in the beginning and 519.8 MB in the end (delta: -220.5 MB). Peak memory consumption was 23.0 MB. Max. memory is 5.3 GB. [2018-04-10 16:34:48,283 INFO L168 Benchmark]: TraceAbstraction took 208002.09 ms. Allocated memory was 606.1 MB in the beginning and 736.1 MB in the end (delta: 130.0 MB). Free memory was 519.8 MB in the beginning and 445.6 MB in the end (delta: 74.3 MB). Peak memory consumption was 204.3 MB. Max. memory is 5.3 GB. [2018-04-10 16:34:48,284 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.18 ms. Allocated memory is still 399.0 MB. Free memory is still 354.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 249.50 ms. Allocated memory is still 399.0 MB. Free memory was 331.0 MB in the beginning and 302.0 MB in the end (delta: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 42.27 ms. Allocated memory is still 399.0 MB. Free memory was 302.0 MB in the beginning and 299.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 521.95 ms. Allocated memory was 399.0 MB in the beginning and 606.1 MB in the end (delta: 207.1 MB). Free memory was 299.3 MB in the beginning and 519.8 MB in the end (delta: -220.5 MB). Peak memory consumption was 23.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 208002.09 ms. Allocated memory was 606.1 MB in the beginning and 736.1 MB in the end (delta: 130.0 MB). Free memory was 519.8 MB in the beginning and 445.6 MB in the end (delta: 74.3 MB). Peak memory consumption was 204.3 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1037]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1037). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 1041]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 997]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 997). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 1004]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1004). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 1011]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 986]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 986). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 1021]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 987]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 1044]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1044). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 1034]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1034). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1053). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 1041]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1041). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 1018]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1018). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 1042]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1042). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 1006]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 1020]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1020). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 1018]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1018). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 988). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 1037]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1037). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 988). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 1052]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1052). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 1044]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1044). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 1000]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1000). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 1011]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 1042]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1042). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 1053). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 982]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 982). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 1034]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1034). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 1011]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 1006]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1006). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 987]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 987). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 1037]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1037). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 1020]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1020). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 997]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 997). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 1004]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1004). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 986]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 986). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 1052]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1052). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 1037]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1037). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 1000]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1000). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 1008]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1008). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 1021]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1021). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 993). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - TimeoutResultAtElement [Line: 1011]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 1011). Cancelled while BasicCegarLoop was constructing difference of abstraction (251states) and interpolant automaton (currently 29 states, 26 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 52 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 156 locations, 65 error locations. TIMEOUT Result, 207.9s OverallTime, 26 OverallIterations, 3 TraceHistogramMax, 155.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2463 SDtfs, 9333 SDslu, 8624 SDs, 0 SdLazy, 14110 SolverSat, 902 SolverUnsat, 11 SolverUnknown, 0 SolverNotchecked, 12.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 938 GetRequests, 444 SyntacticMatches, 6 SemanticMatches, 487 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2609 ImplicationChecksByTransitivity, 171.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=258occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 1302 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 51.5s InterpolantComputationTime, 1488 NumberOfCodeBlocks, 1488 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 857 ConstructedInterpolants, 192 QuantifiedInterpolants, 1527361 SizeOfPredicates, 240 NumberOfNonLiveVariables, 2806 ConjunctsInSsa, 571 ConjunctsInUnsatCore, 27 InterpolantComputations, 16 PerfectInterpolantSequences, 23/78 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-reverse_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-10_16-34-48-289.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-reverse_true-unreach-call_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-10_16-34-48-289.csv Completed graceful shutdown