java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 17:25:58,121 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 17:25:58,122 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 17:25:58,135 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 17:25:58,135 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 17:25:58,136 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 17:25:58,137 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 17:25:58,139 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 17:25:58,140 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 17:25:58,141 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 17:25:58,141 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 17:25:58,142 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 17:25:58,142 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 17:25:58,143 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 17:25:58,144 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 17:25:58,145 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 17:25:58,147 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 17:25:58,148 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 17:25:58,149 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 17:25:58,150 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 17:25:58,152 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 17:25:58,152 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 17:25:58,152 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 17:25:58,153 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 17:25:58,154 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 17:25:58,155 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 17:25:58,155 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 17:25:58,156 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 17:25:58,156 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 17:25:58,156 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 17:25:58,157 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 17:25:58,157 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-11 17:25:58,180 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 17:25:58,180 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 17:25:58,181 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 17:25:58,182 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 17:25:58,182 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 17:25:58,182 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 17:25:58,182 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 17:25:58,182 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 17:25:58,183 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 17:25:58,183 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 17:25:58,183 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 17:25:58,183 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 17:25:58,183 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 17:25:58,183 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 17:25:58,183 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 17:25:58,184 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 17:25:58,184 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 17:25:58,184 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 17:25:58,184 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 17:25:58,184 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 17:25:58,184 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 17:25:58,185 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 17:25:58,185 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 17:25:58,185 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-11 17:25:58,216 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 17:25:58,228 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 17:25:58,232 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 17:25:58,233 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 17:25:58,234 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 17:25:58,235 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,534 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG0e7a2b1fa [2018-04-11 17:25:58,687 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 17:25:58,688 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 17:25:58,688 INFO L168 CDTParser]: Scanning sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,695 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 17:25:58,695 INFO L215 ultiparseSymbolTable]: [2018-04-11 17:25:58,695 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 17:25:58,696 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,696 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 17:25:58,696 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_rwlockattr_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,696 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____gid_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,696 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____uint16_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,696 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__clock_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,696 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_char in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,696 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____int16_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,696 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____u_long in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,696 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__blkcnt_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,697 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__daddr_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,697 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____loff_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,697 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__suseconds_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,697 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_int32_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,697 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____sigset_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,697 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__fd_mask in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,697 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__sigset_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,697 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____ino_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,697 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_spinlock_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,697 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__SLL in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,698 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____caddr_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,698 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____off_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,698 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____ino64_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,698 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_long in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,698 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____fsid_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,698 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__ulong in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,698 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____uint32_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,698 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__uid_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,698 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__fsblkcnt_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,698 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__lldiv_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,698 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__wchar_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,699 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__int16_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,699 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__blksize_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,699 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____clockid_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,699 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__clockid_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,699 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____pthread_slist_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,699 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____int32_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,699 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____syscall_ulong_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,699 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____sig_atomic_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,699 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__div_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,700 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,700 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____id_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,700 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____fd_mask in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,700 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__quad_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,700 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_int8_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,700 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_int16_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,700 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_cond_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,700 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____fsblkcnt64_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,700 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____pid_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,701 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____rlim_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,701 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____timer_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,701 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_mutexattr_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,701 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_attr_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,701 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_int in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,701 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____u_char in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,701 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____u_quad_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,701 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_barrier_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,701 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____quad_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,702 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____off64_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,702 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____suseconds_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,702 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____fsfilcnt64_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,702 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_int64_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,702 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____blkcnt64_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,702 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pid_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,702 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__ldiv_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,702 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__ino_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,702 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__fsfilcnt_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,702 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____ssize_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,702 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____socklen_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,703 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____mode_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,703 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__int32_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,703 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__idtype_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,703 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____int8_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,703 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____nlink_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,703 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____intptr_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,703 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__timer_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,703 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__size_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,703 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__off_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,704 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__key_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,704 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____uint64_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,704 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_once_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,704 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____fsword_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,704 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__caddr_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,704 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__mode_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,704 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____u_short in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,704 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__nlink_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,704 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_short in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,704 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____uid_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,704 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__gid_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,705 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__ssize_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,705 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__uint in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,705 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__loff_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,705 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____useconds_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,705 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__fd_set in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,705 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_condattr_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,705 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__dev_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,705 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____rlim64_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,705 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____blksize_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,705 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__id_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,705 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____qaddr_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,705 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____clock_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,705 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_key_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,705 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____dev_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,705 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____fsblkcnt_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,705 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__fsid_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,705 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____u_int in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,705 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____blkcnt_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,705 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__time_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,705 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_rwlock_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,705 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_mutex_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,705 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____fsfilcnt_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,706 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____syscall_slong_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,706 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__pthread_barrierattr_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,706 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__register_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,706 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__int64_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,706 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____daddr_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,706 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____int64_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,706 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__int8_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,706 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____time_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,706 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____uint8_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,706 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i____key_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,706 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__u_quad_t in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,706 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fsll_simple_white_blue_true_unreach_call_false_valid_memtrack_i__ushort in sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:58,718 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG0e7a2b1fa [2018-04-11 17:25:58,721 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 17:25:58,722 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 17:25:58,723 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 17:25:58,723 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 17:25:58,726 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 17:25:58,727 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 05:25:58" (1/1) ... [2018-04-11 17:25:58,728 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f19b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:25:58, skipping insertion in model container [2018-04-11 17:25:58,729 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 05:25:58" (1/1) ... [2018-04-11 17:25:58,739 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 17:25:58,765 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 17:25:58,901 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 17:25:58,933 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 17:25:58,939 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 115 non ball SCCs. Number of states in SCCs 115. [2018-04-11 17:25:58,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:25:58 WrapperNode [2018-04-11 17:25:58,978 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 17:25:58,979 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 17:25:58,979 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 17:25:58,979 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 17:25:58,991 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:25:58" (1/1) ... [2018-04-11 17:25:58,991 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:25:58" (1/1) ... [2018-04-11 17:25:59,003 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:25:58" (1/1) ... [2018-04-11 17:25:59,004 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:25:58" (1/1) ... [2018-04-11 17:25:59,012 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:25:58" (1/1) ... [2018-04-11 17:25:59,017 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:25:58" (1/1) ... [2018-04-11 17:25:59,020 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:25:58" (1/1) ... [2018-04-11 17:25:59,023 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 17:25:59,024 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 17:25:59,024 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 17:25:59,024 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 17:25:59,024 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:25:58" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 17:25:59,121 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 17:25:59,121 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 17:25:59,122 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 17:25:59,122 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 17:25:59,122 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 17:25:59,122 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 17:25:59,122 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 17:25:59,122 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 17:25:59,122 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 17:25:59,122 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 17:25:59,122 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 17:25:59,122 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 17:25:59,123 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 17:25:59,123 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 17:25:59,123 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 17:25:59,123 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 17:25:59,123 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 17:25:59,123 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 17:25:59,123 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 17:25:59,123 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 17:25:59,123 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 17:25:59,124 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 17:25:59,124 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 17:25:59,124 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 17:25:59,124 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 17:25:59,124 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 17:25:59,124 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 17:25:59,124 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 17:25:59,124 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 17:25:59,124 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 17:25:59,124 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 17:25:59,125 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 17:25:59,125 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 17:25:59,125 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 17:25:59,125 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 17:25:59,125 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 17:25:59,125 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 17:25:59,125 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 17:25:59,125 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 17:25:59,125 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 17:25:59,125 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 17:25:59,126 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 17:25:59,126 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 17:25:59,126 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 17:25:59,126 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 17:25:59,126 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 17:25:59,126 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 17:25:59,126 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 17:25:59,126 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 17:25:59,126 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 17:25:59,126 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 17:25:59,127 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 17:25:59,127 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 17:25:59,127 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 17:25:59,127 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 17:25:59,127 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 17:25:59,127 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 17:25:59,127 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 17:25:59,127 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 17:25:59,128 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 17:25:59,128 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 17:25:59,128 INFO L128 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-04-11 17:25:59,128 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 17:25:59,128 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 17:25:59,128 INFO L128 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-04-11 17:25:59,128 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 17:25:59,128 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 17:25:59,128 INFO L128 BoogieDeclarations]: Found specification of procedure quick_exit [2018-04-11 17:25:59,129 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 17:25:59,129 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 17:25:59,129 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 17:25:59,129 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 17:25:59,129 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 17:25:59,129 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 17:25:59,129 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 17:25:59,129 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 17:25:59,129 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 17:25:59,129 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 17:25:59,129 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 17:25:59,130 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 17:25:59,130 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 17:25:59,130 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 17:25:59,130 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 17:25:59,130 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 17:25:59,130 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 17:25:59,130 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 17:25:59,130 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 17:25:59,130 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 17:25:59,131 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 17:25:59,131 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 17:25:59,131 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 17:25:59,131 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 17:25:59,131 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 17:25:59,131 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 17:25:59,131 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 17:25:59,131 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 17:25:59,131 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 17:25:59,131 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 17:25:59,132 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 17:25:59,132 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 17:25:59,132 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 17:25:59,132 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 17:25:59,132 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 17:25:59,132 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 17:25:59,132 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 17:25:59,132 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 17:25:59,132 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 17:25:59,132 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-04-11 17:25:59,132 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 17:25:59,133 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 17:25:59,133 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-11 17:25:59,133 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 17:25:59,133 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-11 17:25:59,133 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 17:25:59,133 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 17:25:59,133 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 17:25:59,133 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 17:25:59,133 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 17:25:59,513 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 17:25:59,514 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 05:25:59 BoogieIcfgContainer [2018-04-11 17:25:59,514 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 17:25:59,514 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 17:25:59,514 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 17:25:59,516 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 17:25:59,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 05:25:58" (1/3) ... [2018-04-11 17:25:59,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33cdc703 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 05:25:59, skipping insertion in model container [2018-04-11 17:25:59,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 05:25:58" (2/3) ... [2018-04-11 17:25:59,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33cdc703 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 05:25:59, skipping insertion in model container [2018-04-11 17:25:59,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 05:25:59" (3/3) ... [2018-04-11 17:25:59,518 INFO L107 eAbstractionObserver]: Analyzing ICFG sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i [2018-04-11 17:25:59,524 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 17:25:59,529 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 43 error locations. [2018-04-11 17:25:59,553 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 17:25:59,554 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 17:25:59,554 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 17:25:59,554 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 17:25:59,554 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 17:25:59,554 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 17:25:59,554 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 17:25:59,554 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 17:25:59,554 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 17:25:59,555 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 17:25:59,566 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states. [2018-04-11 17:25:59,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-11 17:25:59,573 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:25:59,573 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:25:59,573 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-04-11 17:25:59,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1982669053, now seen corresponding path program 1 times [2018-04-11 17:25:59,577 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:25:59,577 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:25:59,610 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:25:59,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:25:59,610 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:25:59,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:25:59,639 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:25:59,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:25:59,678 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:25:59,678 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 17:25:59,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 17:25:59,687 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 17:25:59,687 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 17:25:59,688 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 4 states. [2018-04-11 17:25:59,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:25:59,874 INFO L93 Difference]: Finished difference Result 156 states and 166 transitions. [2018-04-11 17:25:59,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 17:25:59,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-11 17:25:59,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:25:59,885 INFO L225 Difference]: With dead ends: 156 [2018-04-11 17:25:59,886 INFO L226 Difference]: Without dead ends: 147 [2018-04-11 17:25:59,887 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 17:25:59,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-04-11 17:25:59,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 103. [2018-04-11 17:25:59,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-04-11 17:25:59,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 109 transitions. [2018-04-11 17:25:59,921 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 109 transitions. Word has length 8 [2018-04-11 17:25:59,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:25:59,922 INFO L459 AbstractCegarLoop]: Abstraction has 103 states and 109 transitions. [2018-04-11 17:25:59,922 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 17:25:59,922 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 109 transitions. [2018-04-11 17:25:59,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-04-11 17:25:59,922 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:25:59,922 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:25:59,922 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-04-11 17:25:59,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1982669052, now seen corresponding path program 1 times [2018-04-11 17:25:59,923 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:25:59,923 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:25:59,924 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:25:59,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:25:59,924 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:25:59,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:25:59,936 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:25:59,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:25:59,976 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:25:59,977 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 17:25:59,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 17:25:59,978 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 17:25:59,978 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 17:25:59,978 INFO L87 Difference]: Start difference. First operand 103 states and 109 transitions. Second operand 4 states. [2018-04-11 17:26:00,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:00,083 INFO L93 Difference]: Finished difference Result 131 states and 139 transitions. [2018-04-11 17:26:00,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 17:26:00,084 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-04-11 17:26:00,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:00,085 INFO L225 Difference]: With dead ends: 131 [2018-04-11 17:26:00,085 INFO L226 Difference]: Without dead ends: 131 [2018-04-11 17:26:00,086 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 17:26:00,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-04-11 17:26:00,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 101. [2018-04-11 17:26:00,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-04-11 17:26:00,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2018-04-11 17:26:00,092 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 8 [2018-04-11 17:26:00,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:00,092 INFO L459 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2018-04-11 17:26:00,092 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 17:26:00,092 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2018-04-11 17:26:00,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-11 17:26:00,093 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:00,093 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:26:00,093 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-04-11 17:26:00,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1611689904, now seen corresponding path program 1 times [2018-04-11 17:26:00,093 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:00,093 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:00,095 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:00,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:00,095 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:00,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:00,113 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:00,119 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:26:00,119 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:26:00,119 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:26:00,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:00,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:00,147 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:26:00,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:26:00,173 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:00,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:00,174 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 17:26:00,188 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:00,188 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:00,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 17:26:00,190 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:00,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:00,195 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-04-11 17:26:00,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:26:00,206 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:26:00,206 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 17:26:00,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 17:26:00,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 17:26:00,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-11 17:26:00,207 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand 6 states. [2018-04-11 17:26:00,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:00,430 INFO L93 Difference]: Finished difference Result 118 states and 125 transitions. [2018-04-11 17:26:00,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 17:26:00,430 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-04-11 17:26:00,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:00,431 INFO L225 Difference]: With dead ends: 118 [2018-04-11 17:26:00,431 INFO L226 Difference]: Without dead ends: 118 [2018-04-11 17:26:00,431 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-04-11 17:26:00,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-04-11 17:26:00,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 99. [2018-04-11 17:26:00,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-04-11 17:26:00,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 110 transitions. [2018-04-11 17:26:00,437 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 110 transitions. Word has length 15 [2018-04-11 17:26:00,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:00,437 INFO L459 AbstractCegarLoop]: Abstraction has 99 states and 110 transitions. [2018-04-11 17:26:00,437 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 17:26:00,437 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 110 transitions. [2018-04-11 17:26:00,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-11 17:26:00,438 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:00,438 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:26:00,438 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-04-11 17:26:00,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1611689903, now seen corresponding path program 1 times [2018-04-11 17:26:00,438 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:00,438 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:00,440 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:00,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:00,440 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:00,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:00,450 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:00,454 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:26:00,469 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:26:00,469 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:26:00,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:00,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:00,488 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:26:00,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:26:00,495 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:00,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:26:00,501 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:00,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:00,505 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 17:26:00,541 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:00,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 17:26:00,542 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:00,549 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:00,550 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:00,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 17:26:00,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:00,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:00,556 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:21 [2018-04-11 17:26:00,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:26:00,573 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:26:00,573 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 17:26:00,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 17:26:00,573 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 17:26:00,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-04-11 17:26:00,574 INFO L87 Difference]: Start difference. First operand 99 states and 110 transitions. Second operand 7 states. [2018-04-11 17:26:00,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:00,896 INFO L93 Difference]: Finished difference Result 173 states and 188 transitions. [2018-04-11 17:26:00,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 17:26:00,896 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-04-11 17:26:00,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:00,899 INFO L225 Difference]: With dead ends: 173 [2018-04-11 17:26:00,899 INFO L226 Difference]: Without dead ends: 173 [2018-04-11 17:26:00,900 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-04-11 17:26:00,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-04-11 17:26:00,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 139. [2018-04-11 17:26:00,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-04-11 17:26:00,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 163 transitions. [2018-04-11 17:26:00,907 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 163 transitions. Word has length 15 [2018-04-11 17:26:00,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:00,908 INFO L459 AbstractCegarLoop]: Abstraction has 139 states and 163 transitions. [2018-04-11 17:26:00,908 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 17:26:00,908 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 163 transitions. [2018-04-11 17:26:00,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-11 17:26:00,908 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:00,909 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-11 17:26:00,911 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-04-11 17:26:00,911 INFO L82 PathProgramCache]: Analyzing trace with hash -455507554, now seen corresponding path program 1 times [2018-04-11 17:26:00,911 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:00,911 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:00,912 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:00,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:00,913 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:00,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:00,921 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:00,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:26:00,936 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:26:00,936 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 17:26:00,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 17:26:00,936 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 17:26:00,936 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 17:26:00,936 INFO L87 Difference]: Start difference. First operand 139 states and 163 transitions. Second operand 4 states. [2018-04-11 17:26:01,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:01,011 INFO L93 Difference]: Finished difference Result 156 states and 171 transitions. [2018-04-11 17:26:01,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 17:26:01,011 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-04-11 17:26:01,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:01,012 INFO L225 Difference]: With dead ends: 156 [2018-04-11 17:26:01,012 INFO L226 Difference]: Without dead ends: 156 [2018-04-11 17:26:01,013 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 17:26:01,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-04-11 17:26:01,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 138. [2018-04-11 17:26:01,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-04-11 17:26:01,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 162 transitions. [2018-04-11 17:26:01,017 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 162 transitions. Word has length 18 [2018-04-11 17:26:01,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:01,017 INFO L459 AbstractCegarLoop]: Abstraction has 138 states and 162 transitions. [2018-04-11 17:26:01,017 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 17:26:01,017 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 162 transitions. [2018-04-11 17:26:01,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-11 17:26:01,018 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:01,018 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-11 17:26:01,018 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-04-11 17:26:01,018 INFO L82 PathProgramCache]: Analyzing trace with hash -455507553, now seen corresponding path program 1 times [2018-04-11 17:26:01,018 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:01,018 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:01,019 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:01,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:01,019 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:01,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:01,025 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:01,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:26:01,050 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:26:01,050 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 17:26:01,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 17:26:01,051 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 17:26:01,051 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 17:26:01,051 INFO L87 Difference]: Start difference. First operand 138 states and 162 transitions. Second operand 4 states. [2018-04-11 17:26:01,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:01,119 INFO L93 Difference]: Finished difference Result 158 states and 175 transitions. [2018-04-11 17:26:01,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 17:26:01,119 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-04-11 17:26:01,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:01,119 INFO L225 Difference]: With dead ends: 158 [2018-04-11 17:26:01,119 INFO L226 Difference]: Without dead ends: 158 [2018-04-11 17:26:01,120 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 17:26:01,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-04-11 17:26:01,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 136. [2018-04-11 17:26:01,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-04-11 17:26:01,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 160 transitions. [2018-04-11 17:26:01,125 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 160 transitions. Word has length 18 [2018-04-11 17:26:01,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:01,125 INFO L459 AbstractCegarLoop]: Abstraction has 136 states and 160 transitions. [2018-04-11 17:26:01,125 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 17:26:01,125 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 160 transitions. [2018-04-11 17:26:01,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-11 17:26:01,125 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:01,126 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-11 17:26:01,126 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-04-11 17:26:01,126 INFO L82 PathProgramCache]: Analyzing trace with hash -414531954, now seen corresponding path program 1 times [2018-04-11 17:26:01,126 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:01,126 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:01,127 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:01,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:01,127 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:01,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:01,133 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:01,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:26:01,174 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:26:01,174 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 17:26:01,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 17:26:01,174 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 17:26:01,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 17:26:01,175 INFO L87 Difference]: Start difference. First operand 136 states and 160 transitions. Second operand 6 states. [2018-04-11 17:26:01,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:01,372 INFO L93 Difference]: Finished difference Result 239 states and 285 transitions. [2018-04-11 17:26:01,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 17:26:01,372 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-04-11 17:26:01,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:01,373 INFO L225 Difference]: With dead ends: 239 [2018-04-11 17:26:01,373 INFO L226 Difference]: Without dead ends: 239 [2018-04-11 17:26:01,373 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-04-11 17:26:01,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-04-11 17:26:01,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 126. [2018-04-11 17:26:01,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-04-11 17:26:01,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 149 transitions. [2018-04-11 17:26:01,380 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 149 transitions. Word has length 18 [2018-04-11 17:26:01,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:01,380 INFO L459 AbstractCegarLoop]: Abstraction has 126 states and 149 transitions. [2018-04-11 17:26:01,380 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 17:26:01,380 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 149 transitions. [2018-04-11 17:26:01,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-11 17:26:01,381 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:01,381 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-11 17:26:01,381 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-04-11 17:26:01,381 INFO L82 PathProgramCache]: Analyzing trace with hash -414531955, now seen corresponding path program 1 times [2018-04-11 17:26:01,381 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:01,381 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:01,382 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:01,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:01,382 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:01,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:01,388 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:01,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:26:01,424 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:26:01,424 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 17:26:01,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 17:26:01,425 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 17:26:01,425 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 17:26:01,425 INFO L87 Difference]: Start difference. First operand 126 states and 149 transitions. Second operand 6 states. [2018-04-11 17:26:01,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:01,576 INFO L93 Difference]: Finished difference Result 228 states and 271 transitions. [2018-04-11 17:26:01,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 17:26:01,576 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-04-11 17:26:01,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:01,577 INFO L225 Difference]: With dead ends: 228 [2018-04-11 17:26:01,577 INFO L226 Difference]: Without dead ends: 228 [2018-04-11 17:26:01,577 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-04-11 17:26:01,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-04-11 17:26:01,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 125. [2018-04-11 17:26:01,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-04-11 17:26:01,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 148 transitions. [2018-04-11 17:26:01,580 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 148 transitions. Word has length 18 [2018-04-11 17:26:01,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:01,580 INFO L459 AbstractCegarLoop]: Abstraction has 125 states and 148 transitions. [2018-04-11 17:26:01,580 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 17:26:01,580 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 148 transitions. [2018-04-11 17:26:01,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-11 17:26:01,580 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:01,580 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] [2018-04-11 17:26:01,580 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-04-11 17:26:01,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1233727545, now seen corresponding path program 1 times [2018-04-11 17:26:01,581 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:01,581 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:01,581 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:01,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:01,582 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:01,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:01,589 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:01,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:26:01,621 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:26:01,621 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 17:26:01,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 17:26:01,621 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 17:26:01,622 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 17:26:01,622 INFO L87 Difference]: Start difference. First operand 125 states and 148 transitions. Second operand 5 states. [2018-04-11 17:26:01,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:01,689 INFO L93 Difference]: Finished difference Result 143 states and 168 transitions. [2018-04-11 17:26:01,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 17:26:01,689 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-04-11 17:26:01,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:01,690 INFO L225 Difference]: With dead ends: 143 [2018-04-11 17:26:01,690 INFO L226 Difference]: Without dead ends: 143 [2018-04-11 17:26:01,690 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-11 17:26:01,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-04-11 17:26:01,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 133. [2018-04-11 17:26:01,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-04-11 17:26:01,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 158 transitions. [2018-04-11 17:26:01,692 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 158 transitions. Word has length 23 [2018-04-11 17:26:01,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:01,692 INFO L459 AbstractCegarLoop]: Abstraction has 133 states and 158 transitions. [2018-04-11 17:26:01,692 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 17:26:01,692 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 158 transitions. [2018-04-11 17:26:01,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-11 17:26:01,693 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:01,693 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:26:01,693 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-04-11 17:26:01,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1788148930, now seen corresponding path program 1 times [2018-04-11 17:26:01,693 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:01,693 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:01,694 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:01,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:01,694 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:01,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:01,702 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:01,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:26:01,771 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:26:01,771 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 17:26:01,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 17:26:01,772 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 17:26:01,772 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 17:26:01,772 INFO L87 Difference]: Start difference. First operand 133 states and 158 transitions. Second operand 5 states. [2018-04-11 17:26:01,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:01,936 INFO L93 Difference]: Finished difference Result 169 states and 184 transitions. [2018-04-11 17:26:01,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 17:26:01,936 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-04-11 17:26:01,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:01,937 INFO L225 Difference]: With dead ends: 169 [2018-04-11 17:26:01,937 INFO L226 Difference]: Without dead ends: 169 [2018-04-11 17:26:01,937 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 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-11 17:26:01,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-04-11 17:26:01,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 111. [2018-04-11 17:26:01,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-04-11 17:26:01,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 123 transitions. [2018-04-11 17:26:01,940 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 123 transitions. Word has length 23 [2018-04-11 17:26:01,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:01,940 INFO L459 AbstractCegarLoop]: Abstraction has 111 states and 123 transitions. [2018-04-11 17:26:01,940 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 17:26:01,941 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 123 transitions. [2018-04-11 17:26:01,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 17:26:01,941 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:01,941 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] [2018-04-11 17:26:01,941 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-04-11 17:26:01,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1692504881, now seen corresponding path program 1 times [2018-04-11 17:26:01,942 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:01,942 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:01,943 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:01,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:01,943 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:01,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:01,952 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:01,954 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:26:01,955 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:26:01,955 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:26:01,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:01,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:01,978 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:26:02,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-04-11 17:26:02,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 17:26:02,019 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:02,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:02,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:02,022 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-04-11 17:26:02,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 17:26:02,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 17:26:02,045 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:02,045 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:02,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:02,047 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-04-11 17:26:02,051 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:26:02,052 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:26:02,052 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-11 17:26:02,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 17:26:02,052 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 17:26:02,052 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-11 17:26:02,052 INFO L87 Difference]: Start difference. First operand 111 states and 123 transitions. Second operand 9 states. [2018-04-11 17:26:02,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:02,484 INFO L93 Difference]: Finished difference Result 156 states and 169 transitions. [2018-04-11 17:26:02,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 17:26:02,484 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-04-11 17:26:02,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:02,485 INFO L225 Difference]: With dead ends: 156 [2018-04-11 17:26:02,485 INFO L226 Difference]: Without dead ends: 156 [2018-04-11 17:26:02,485 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2018-04-11 17:26:02,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-04-11 17:26:02,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 115. [2018-04-11 17:26:02,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-04-11 17:26:02,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 127 transitions. [2018-04-11 17:26:02,487 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 127 transitions. Word has length 28 [2018-04-11 17:26:02,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:02,488 INFO L459 AbstractCegarLoop]: Abstraction has 115 states and 127 transitions. [2018-04-11 17:26:02,488 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 17:26:02,488 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 127 transitions. [2018-04-11 17:26:02,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 17:26:02,488 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:02,488 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:26:02,489 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-04-11 17:26:02,489 INFO L82 PathProgramCache]: Analyzing trace with hash 877482672, now seen corresponding path program 1 times [2018-04-11 17:26:02,489 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:02,489 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:02,490 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:02,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:02,490 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:02,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:02,497 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:02,499 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:26:02,499 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:26:02,500 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:26:02,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:02,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:02,524 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:26:02,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 17:26:02,534 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:02,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:02,539 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-04-11 17:26:02,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 17:26:02,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:26:02,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:02,558 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:02,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:02,562 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-11 17:26:02,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-04-11 17:26:02,604 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:02,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, 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 9 [2018-04-11 17:26:02,605 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:02,607 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:02,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:02,613 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:11 [2018-04-11 17:26:02,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:26:02,628 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:26:02,628 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-11 17:26:02,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 17:26:02,629 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 17:26:02,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-04-11 17:26:02,629 INFO L87 Difference]: Start difference. First operand 115 states and 127 transitions. Second operand 10 states. [2018-04-11 17:26:02,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:02,996 INFO L93 Difference]: Finished difference Result 146 states and 159 transitions. [2018-04-11 17:26:02,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 17:26:02,996 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2018-04-11 17:26:02,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:02,997 INFO L225 Difference]: With dead ends: 146 [2018-04-11 17:26:02,997 INFO L226 Difference]: Without dead ends: 146 [2018-04-11 17:26:02,998 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2018-04-11 17:26:02,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-04-11 17:26:03,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 120. [2018-04-11 17:26:03,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-04-11 17:26:03,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 134 transitions. [2018-04-11 17:26:03,001 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 134 transitions. Word has length 29 [2018-04-11 17:26:03,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:03,001 INFO L459 AbstractCegarLoop]: Abstraction has 120 states and 134 transitions. [2018-04-11 17:26:03,001 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 17:26:03,001 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 134 transitions. [2018-04-11 17:26:03,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 17:26:03,002 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:03,002 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:26:03,002 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-04-11 17:26:03,002 INFO L82 PathProgramCache]: Analyzing trace with hash 877482673, now seen corresponding path program 1 times [2018-04-11 17:26:03,002 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:03,002 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:03,003 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:03,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:03,004 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:03,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:03,014 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:03,017 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:26:03,017 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:26:03,017 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:26:03,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:03,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:03,042 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:26:03,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:26:03,055 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:03,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:03,058 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 17:26:03,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 17:26:03,078 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:03,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:03,085 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2018-04-11 17:26:03,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 17:26:03,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:26:03,122 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:03,123 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:03,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 17:26:03,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:26:03,140 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:03,142 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:03,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:03,153 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:45, output treesize:35 [2018-04-11 17:26:03,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-04-11 17:26:03,214 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:03,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 9 [2018-04-11 17:26:03,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:03,217 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:03,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-04-11 17:26:03,230 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:03,231 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-11 17:26:03,231 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:03,234 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:03,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:03,242 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:55, output treesize:17 [2018-04-11 17:26:03,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:26:03,286 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:26:03,286 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-11 17:26:03,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 17:26:03,287 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 17:26:03,287 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-04-11 17:26:03,288 INFO L87 Difference]: Start difference. First operand 120 states and 134 transitions. Second operand 12 states. [2018-04-11 17:26:03,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:03,760 INFO L93 Difference]: Finished difference Result 168 states and 181 transitions. [2018-04-11 17:26:03,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 17:26:03,760 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-04-11 17:26:03,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:03,761 INFO L225 Difference]: With dead ends: 168 [2018-04-11 17:26:03,761 INFO L226 Difference]: Without dead ends: 168 [2018-04-11 17:26:03,761 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2018-04-11 17:26:03,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-04-11 17:26:03,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 122. [2018-04-11 17:26:03,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-04-11 17:26:03,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 135 transitions. [2018-04-11 17:26:03,763 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 135 transitions. Word has length 29 [2018-04-11 17:26:03,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:03,763 INFO L459 AbstractCegarLoop]: Abstraction has 122 states and 135 transitions. [2018-04-11 17:26:03,764 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 17:26:03,764 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 135 transitions. [2018-04-11 17:26:03,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 17:26:03,764 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:03,764 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] [2018-04-11 17:26:03,764 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-04-11 17:26:03,765 INFO L82 PathProgramCache]: Analyzing trace with hash 221581916, now seen corresponding path program 1 times [2018-04-11 17:26:03,765 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:03,765 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:03,765 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:03,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:03,766 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:03,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:03,774 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:03,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:26:03,893 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:26:03,893 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-11 17:26:03,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 17:26:03,894 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 17:26:03,894 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-04-11 17:26:03,894 INFO L87 Difference]: Start difference. First operand 122 states and 135 transitions. Second operand 9 states. [2018-04-11 17:26:04,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:04,128 INFO L93 Difference]: Finished difference Result 183 states and 197 transitions. [2018-04-11 17:26:04,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 17:26:04,128 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-04-11 17:26:04,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:04,128 INFO L225 Difference]: With dead ends: 183 [2018-04-11 17:26:04,128 INFO L226 Difference]: Without dead ends: 183 [2018-04-11 17:26:04,129 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2018-04-11 17:26:04,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-04-11 17:26:04,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 126. [2018-04-11 17:26:04,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-04-11 17:26:04,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 139 transitions. [2018-04-11 17:26:04,132 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 139 transitions. Word has length 32 [2018-04-11 17:26:04,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:04,132 INFO L459 AbstractCegarLoop]: Abstraction has 126 states and 139 transitions. [2018-04-11 17:26:04,132 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 17:26:04,132 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 139 transitions. [2018-04-11 17:26:04,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 17:26:04,132 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:04,132 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] [2018-04-11 17:26:04,132 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-04-11 17:26:04,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1146002921, now seen corresponding path program 1 times [2018-04-11 17:26:04,132 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:04,132 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:04,133 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:04,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:04,133 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:04,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:04,138 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:04,140 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:26:04,140 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:26:04,140 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:26:04,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:04,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:04,157 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:26:04,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:26:04,180 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:04,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:04,183 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 17:26:04,207 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:04,210 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:04,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 17:26:04,211 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:04,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:04,219 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-11 17:26:04,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 17:26:04,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:26:04,244 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:04,246 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:04,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:04,255 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:35 [2018-04-11 17:26:04,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-04-11 17:26:04,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 17:26:04,342 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:04,348 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:04,356 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:04,356 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:43 [2018-04-11 17:26:04,436 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 36 treesize of output 29 [2018-04-11 17:26:04,438 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:04,439 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-11 17:26:04,439 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:04,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 17:26:04,445 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:04,448 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:04,455 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:04,455 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:53, output treesize:15 [2018-04-11 17:26:04,483 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:26:04,483 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:26:04,483 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-11 17:26:04,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 17:26:04,483 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 17:26:04,484 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-04-11 17:26:04,484 INFO L87 Difference]: Start difference. First operand 126 states and 139 transitions. Second operand 14 states. [2018-04-11 17:26:05,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:05,106 INFO L93 Difference]: Finished difference Result 216 states and 236 transitions. [2018-04-11 17:26:05,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 17:26:05,106 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2018-04-11 17:26:05,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:05,107 INFO L225 Difference]: With dead ends: 216 [2018-04-11 17:26:05,107 INFO L226 Difference]: Without dead ends: 216 [2018-04-11 17:26:05,108 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=186, Invalid=570, Unknown=0, NotChecked=0, Total=756 [2018-04-11 17:26:05,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-04-11 17:26:05,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 145. [2018-04-11 17:26:05,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-04-11 17:26:05,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 163 transitions. [2018-04-11 17:26:05,111 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 163 transitions. Word has length 32 [2018-04-11 17:26:05,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:05,111 INFO L459 AbstractCegarLoop]: Abstraction has 145 states and 163 transitions. [2018-04-11 17:26:05,111 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 17:26:05,111 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 163 transitions. [2018-04-11 17:26:05,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 17:26:05,112 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:05,112 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] [2018-04-11 17:26:05,112 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-04-11 17:26:05,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1146002920, now seen corresponding path program 1 times [2018-04-11 17:26:05,112 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:05,112 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:05,113 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:05,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:05,113 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:05,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:05,121 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:05,125 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:26:05,125 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:26:05,125 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:26:05,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:05,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:05,150 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:26:05,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 6 treesize of output 5 [2018-04-11 17:26:05,160 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:05,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:05,166 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 17:26:05,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:26:05,185 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:05,195 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:05,196 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:05,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 17:26:05,196 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:05,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:05,203 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-04-11 17:26:05,215 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 17:26:05,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 8 treesize of output 7 [2018-04-11 17:26:05,217 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:05,218 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:05,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 17:26:05,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:26:05,230 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:05,231 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:05,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:05,239 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:37 [2018-04-11 17:26:05,282 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 34 treesize of output 35 [2018-04-11 17:26:05,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 17:26:05,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:05,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:05,312 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 48 treesize of output 44 [2018-04-11 17:26:05,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 17:26:05,314 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:05,319 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:05,329 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-11 17:26:05,329 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:82, output treesize:66 [2018-04-11 17:26:05,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 38 [2018-04-11 17:26:05,396 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:05,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2018-04-11 17:26:05,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:05,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 5 treesize of output 1 [2018-04-11 17:26:05,402 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:05,405 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:05,418 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 29 treesize of output 25 [2018-04-11 17:26:05,419 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:05,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-11 17:26:05,420 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:05,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 17:26:05,425 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:05,427 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:05,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:05,434 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:83, output treesize:12 [2018-04-11 17:26:05,459 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:26:05,460 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:26:05,460 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-11 17:26:05,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 17:26:05,460 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 17:26:05,460 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-04-11 17:26:05,460 INFO L87 Difference]: Start difference. First operand 145 states and 163 transitions. Second operand 14 states. [2018-04-11 17:26:06,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:06,338 INFO L93 Difference]: Finished difference Result 212 states and 233 transitions. [2018-04-11 17:26:06,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 17:26:06,338 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2018-04-11 17:26:06,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:06,339 INFO L225 Difference]: With dead ends: 212 [2018-04-11 17:26:06,339 INFO L226 Difference]: Without dead ends: 212 [2018-04-11 17:26:06,339 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=142, Invalid=553, Unknown=7, NotChecked=0, Total=702 [2018-04-11 17:26:06,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-04-11 17:26:06,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 153. [2018-04-11 17:26:06,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-04-11 17:26:06,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 172 transitions. [2018-04-11 17:26:06,341 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 172 transitions. Word has length 32 [2018-04-11 17:26:06,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:06,341 INFO L459 AbstractCegarLoop]: Abstraction has 153 states and 172 transitions. [2018-04-11 17:26:06,341 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 17:26:06,341 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 172 transitions. [2018-04-11 17:26:06,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 17:26:06,341 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:06,342 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:26:06,342 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-04-11 17:26:06,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1771456283, now seen corresponding path program 1 times [2018-04-11 17:26:06,342 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:06,342 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:06,342 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:06,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:06,343 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:06,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:06,348 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:06,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:26:06,435 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:26:06,435 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-11 17:26:06,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 17:26:06,435 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 17:26:06,435 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-04-11 17:26:06,436 INFO L87 Difference]: Start difference. First operand 153 states and 172 transitions. Second operand 11 states. [2018-04-11 17:26:06,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:06,662 INFO L93 Difference]: Finished difference Result 194 states and 212 transitions. [2018-04-11 17:26:06,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 17:26:06,663 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2018-04-11 17:26:06,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:06,663 INFO L225 Difference]: With dead ends: 194 [2018-04-11 17:26:06,663 INFO L226 Difference]: Without dead ends: 194 [2018-04-11 17:26:06,664 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2018-04-11 17:26:06,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-04-11 17:26:06,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 167. [2018-04-11 17:26:06,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-04-11 17:26:06,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 186 transitions. [2018-04-11 17:26:06,665 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 186 transitions. Word has length 33 [2018-04-11 17:26:06,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:06,666 INFO L459 AbstractCegarLoop]: Abstraction has 167 states and 186 transitions. [2018-04-11 17:26:06,666 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 17:26:06,666 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 186 transitions. [2018-04-11 17:26:06,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 17:26:06,666 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:06,666 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:26:06,666 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-04-11 17:26:06,666 INFO L82 PathProgramCache]: Analyzing trace with hash -776317895, now seen corresponding path program 1 times [2018-04-11 17:26:06,666 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:06,666 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:06,667 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:06,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:06,667 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:06,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:06,671 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:06,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:26:06,702 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:26:06,702 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 17:26:06,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 17:26:06,702 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 17:26:06,703 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-04-11 17:26:06,703 INFO L87 Difference]: Start difference. First operand 167 states and 186 transitions. Second operand 8 states. [2018-04-11 17:26:06,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:06,864 INFO L93 Difference]: Finished difference Result 205 states and 223 transitions. [2018-04-11 17:26:06,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 17:26:06,865 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-04-11 17:26:06,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:06,865 INFO L225 Difference]: With dead ends: 205 [2018-04-11 17:26:06,865 INFO L226 Difference]: Without dead ends: 205 [2018-04-11 17:26:06,865 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-04-11 17:26:06,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-04-11 17:26:06,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 176. [2018-04-11 17:26:06,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-04-11 17:26:06,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 198 transitions. [2018-04-11 17:26:06,868 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 198 transitions. Word has length 33 [2018-04-11 17:26:06,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:06,868 INFO L459 AbstractCegarLoop]: Abstraction has 176 states and 198 transitions. [2018-04-11 17:26:06,868 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 17:26:06,868 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 198 transitions. [2018-04-11 17:26:06,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-11 17:26:06,868 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:06,869 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] [2018-04-11 17:26:06,869 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-04-11 17:26:06,869 INFO L82 PathProgramCache]: Analyzing trace with hash -23783762, now seen corresponding path program 1 times [2018-04-11 17:26:06,869 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:06,869 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:06,870 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:06,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:06,870 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:06,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:06,878 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:06,881 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:26:06,881 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:26:06,882 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:26:06,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:06,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:06,905 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:26:06,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 17:26:06,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:26:06,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:06,919 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:06,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-11 17:26:06,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-11 17:26:06,929 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:06,931 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:06,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:06,936 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2018-04-11 17:26:06,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:26:06,947 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:06,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:06,955 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:29 [2018-04-11 17:26:06,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-04-11 17:26:07,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-04-11 17:26:07,000 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:07,020 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:07,021 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 17 treesize of output 14 [2018-04-11 17:26:07,022 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:07,031 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:26:07,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-04-11 17:26:07,055 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:07,056 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:07,056 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 17 treesize of output 17 [2018-04-11 17:26:07,056 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:07,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 17:26:07,066 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:07,071 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:07,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:26:07,083 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:54, output treesize:105 [2018-04-11 17:26:07,252 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:07,257 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 92 treesize of output 96 [2018-04-11 17:26:07,260 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:07,260 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 89 treesize of output 79 [2018-04-11 17:26:07,261 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:07,289 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:07,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 69 [2018-04-11 17:26:07,290 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:07,316 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:07,317 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:07,317 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:07,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 89 [2018-04-11 17:26:07,318 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:07,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:26:07,378 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 46 [2018-04-11 17:26:07,379 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:07,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 17:26:07,380 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:07,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 17:26:07,390 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:07,396 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:07,401 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 47 treesize of output 45 [2018-04-11 17:26:07,403 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:07,404 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 41 treesize of output 37 [2018-04-11 17:26:07,404 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:07,421 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 25 [2018-04-11 17:26:07,421 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:07,438 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 30 treesize of output 21 [2018-04-11 17:26:07,438 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:07,447 INFO L267 ElimStorePlain]: Start of recursive call 9: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:07,468 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:07,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 61 [2018-04-11 17:26:07,471 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:07,472 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:07,472 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 33 treesize of output 32 [2018-04-11 17:26:07,472 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:07,481 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:07,493 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 48 treesize of output 36 [2018-04-11 17:26:07,496 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 28 treesize of output 13 [2018-04-11 17:26:07,506 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:07,512 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:07,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:26:07,524 INFO L202 ElimStorePlain]: Needed 16 recursive calls to eliminate 10 variables, input treesize:162, output treesize:28 [2018-04-11 17:26:07,581 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:26:07,581 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:26:07,581 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-11 17:26:07,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 17:26:07,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 17:26:07,582 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=170, Unknown=5, NotChecked=0, Total=210 [2018-04-11 17:26:07,582 INFO L87 Difference]: Start difference. First operand 176 states and 198 transitions. Second operand 15 states. [2018-04-11 17:26:08,332 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 109 DAG size of output 106 [2018-04-11 17:26:08,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:08,683 INFO L93 Difference]: Finished difference Result 231 states and 251 transitions. [2018-04-11 17:26:08,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 17:26:08,683 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 35 [2018-04-11 17:26:08,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:08,684 INFO L225 Difference]: With dead ends: 231 [2018-04-11 17:26:08,684 INFO L226 Difference]: Without dead ends: 231 [2018-04-11 17:26:08,684 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=163, Invalid=639, Unknown=10, NotChecked=0, Total=812 [2018-04-11 17:26:08,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-04-11 17:26:08,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 196. [2018-04-11 17:26:08,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-04-11 17:26:08,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 220 transitions. [2018-04-11 17:26:08,686 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 220 transitions. Word has length 35 [2018-04-11 17:26:08,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:08,686 INFO L459 AbstractCegarLoop]: Abstraction has 196 states and 220 transitions. [2018-04-11 17:26:08,686 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 17:26:08,687 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 220 transitions. [2018-04-11 17:26:08,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-11 17:26:08,687 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:08,687 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] [2018-04-11 17:26:08,687 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-04-11 17:26:08,687 INFO L82 PathProgramCache]: Analyzing trace with hash -23783761, now seen corresponding path program 1 times [2018-04-11 17:26:08,687 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:08,687 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:08,688 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:08,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:08,688 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:08,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:08,692 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:08,694 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:26:08,694 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:26:08,694 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:26:08,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:08,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:08,707 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:26:08,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 17:26:08,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:26:08,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:08,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:08,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 17:26:08,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-11 17:26:08,734 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:08,735 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:08,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:08,740 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-04-11 17:26:08,748 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:08,749 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:08,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 17:26:08,749 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:08,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:08,759 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:38 [2018-04-11 17:26:08,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-04-11 17:26:08,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:26:08,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:08,809 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:08,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-04-11 17:26:08,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:26:08,824 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:08,827 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:08,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:08,838 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:63, output treesize:73 [2018-04-11 17:26:08,936 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:08,936 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 20 treesize of output 16 [2018-04-11 17:26:08,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:08,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:08,948 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:98, output treesize:76 [2018-04-11 17:26:08,972 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 61 treesize of output 48 [2018-04-11 17:26:08,974 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:08,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 17:26:08,974 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:08,980 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 29 treesize of output 23 [2018-04-11 17:26:08,981 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:08,992 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:09,005 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 33 treesize of output 27 [2018-04-11 17:26:09,007 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:09,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-04-11 17:26:09,007 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:09,012 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:09,013 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-11 17:26:09,013 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:09,015 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:09,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:09,022 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:94, output treesize:7 [2018-04-11 17:26:09,065 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:26:09,065 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:26:09,065 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-11 17:26:09,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 17:26:09,066 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 17:26:09,066 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=168, Unknown=7, NotChecked=0, Total=210 [2018-04-11 17:26:09,066 INFO L87 Difference]: Start difference. First operand 196 states and 220 transitions. Second operand 15 states. [2018-04-11 17:26:09,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:09,866 INFO L93 Difference]: Finished difference Result 216 states and 234 transitions. [2018-04-11 17:26:09,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 17:26:09,866 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 35 [2018-04-11 17:26:09,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:09,867 INFO L225 Difference]: With dead ends: 216 [2018-04-11 17:26:09,867 INFO L226 Difference]: Without dead ends: 216 [2018-04-11 17:26:09,867 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=168, Invalid=677, Unknown=25, NotChecked=0, Total=870 [2018-04-11 17:26:09,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-04-11 17:26:09,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 195. [2018-04-11 17:26:09,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-04-11 17:26:09,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 217 transitions. [2018-04-11 17:26:09,870 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 217 transitions. Word has length 35 [2018-04-11 17:26:09,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:09,871 INFO L459 AbstractCegarLoop]: Abstraction has 195 states and 217 transitions. [2018-04-11 17:26:09,871 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 17:26:09,871 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 217 transitions. [2018-04-11 17:26:09,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 17:26:09,871 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:09,871 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:26:09,872 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-04-11 17:26:09,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1777126719, now seen corresponding path program 2 times [2018-04-11 17:26:09,872 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:09,872 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:09,873 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:09,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:09,873 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:09,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:09,881 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:09,888 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:26:09,888 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:26:09,888 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:26:09,889 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 17:26:09,916 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 17:26:09,916 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 17:26:09,920 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:26:09,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:26:09,932 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:09,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:09,935 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 17:26:09,965 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:09,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 17:26:09,967 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:09,996 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:09,996 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:09,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 17:26:09,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:10,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:10,004 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-04-11 17:26:10,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 17:26:10,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:26:10,020 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:10,022 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:10,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 17:26:10,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:26:10,055 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:10,057 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:10,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:10,071 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:49, output treesize:42 [2018-04-11 17:26:10,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2018-04-11 17:26:10,128 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:10,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:10,139 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:53, output treesize:35 [2018-04-11 17:26:10,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2018-04-11 17:26:10,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 17:26:10,169 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:10,174 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:10,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-04-11 17:26:10,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 17:26:10,195 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:10,199 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:10,213 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-11 17:26:10,213 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:69, output treesize:53 [2018-04-11 17:26:10,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 17:26:10,261 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:10,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:10,275 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:58, output treesize:53 [2018-04-11 17:26:10,333 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:10,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 61 [2018-04-11 17:26:10,338 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:10,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 17:26:10,339 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:10,349 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:10,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 26 [2018-04-11 17:26:10,352 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:10,357 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:10,369 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 26 treesize of output 22 [2018-04-11 17:26:10,370 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:10,371 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 9 [2018-04-11 17:26:10,371 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:10,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 17:26:10,375 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:10,376 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:10,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:10,382 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:80, output treesize:7 [2018-04-11 17:26:10,402 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:26:10,402 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:26:10,402 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 17:26:10,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 17:26:10,403 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 17:26:10,403 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=203, Unknown=1, NotChecked=0, Total=240 [2018-04-11 17:26:10,403 INFO L87 Difference]: Start difference. First operand 195 states and 217 transitions. Second operand 16 states. [2018-04-11 17:26:11,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:11,452 INFO L93 Difference]: Finished difference Result 216 states and 233 transitions. [2018-04-11 17:26:11,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 17:26:11,452 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 38 [2018-04-11 17:26:11,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:11,453 INFO L225 Difference]: With dead ends: 216 [2018-04-11 17:26:11,453 INFO L226 Difference]: Without dead ends: 216 [2018-04-11 17:26:11,453 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=181, Invalid=680, Unknown=9, NotChecked=0, Total=870 [2018-04-11 17:26:11,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-04-11 17:26:11,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 194. [2018-04-11 17:26:11,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-04-11 17:26:11,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 214 transitions. [2018-04-11 17:26:11,455 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 214 transitions. Word has length 38 [2018-04-11 17:26:11,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:11,455 INFO L459 AbstractCegarLoop]: Abstraction has 194 states and 214 transitions. [2018-04-11 17:26:11,455 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 17:26:11,455 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 214 transitions. [2018-04-11 17:26:11,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-11 17:26:11,456 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:11,456 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] [2018-04-11 17:26:11,456 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-04-11 17:26:11,456 INFO L82 PathProgramCache]: Analyzing trace with hash -362550985, now seen corresponding path program 1 times [2018-04-11 17:26:11,456 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:11,456 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:11,456 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:11,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 17:26:11,457 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:11,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:11,461 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:11,478 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-11 17:26:11,478 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 17:26:11,478 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 17:26:11,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 17:26:11,479 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 17:26:11,479 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 17:26:11,479 INFO L87 Difference]: Start difference. First operand 194 states and 214 transitions. Second operand 5 states. [2018-04-11 17:26:11,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:11,555 INFO L93 Difference]: Finished difference Result 221 states and 237 transitions. [2018-04-11 17:26:11,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 17:26:11,557 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-04-11 17:26:11,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:11,557 INFO L225 Difference]: With dead ends: 221 [2018-04-11 17:26:11,557 INFO L226 Difference]: Without dead ends: 221 [2018-04-11 17:26:11,558 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-11 17:26:11,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-04-11 17:26:11,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 183. [2018-04-11 17:26:11,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-04-11 17:26:11,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 198 transitions. [2018-04-11 17:26:11,561 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 198 transitions. Word has length 39 [2018-04-11 17:26:11,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:11,561 INFO L459 AbstractCegarLoop]: Abstraction has 183 states and 198 transitions. [2018-04-11 17:26:11,561 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 17:26:11,561 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 198 transitions. [2018-04-11 17:26:11,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-11 17:26:11,562 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:11,562 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:26:11,562 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-04-11 17:26:11,562 INFO L82 PathProgramCache]: Analyzing trace with hash 825125319, now seen corresponding path program 3 times [2018-04-11 17:26:11,562 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:11,562 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:11,563 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:11,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:11,563 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:11,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:11,571 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:11,574 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:26:11,575 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:26:11,575 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:26:11,575 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 17:26:11,600 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-11 17:26:11,600 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 17:26:11,603 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:26:11,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:26:11,610 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:11,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:11,613 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 17:26:11,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 17:26:11,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:11,645 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:11,645 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:23 [2018-04-11 17:26:11,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 17:26:11,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:26:11,663 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:11,665 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:11,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 17:26:11,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 8 treesize of output 7 [2018-04-11 17:26:11,681 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:11,682 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:11,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:11,693 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:42, output treesize:31 [2018-04-11 17:26:11,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 17:26:11,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 17:26:11,729 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:11,730 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:11,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:11,734 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:21 [2018-04-11 17:26:11,762 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 21 treesize of output 33 [2018-04-11 17:26:11,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-11 17:26:11,765 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:11,776 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 19 treesize of output 19 [2018-04-11 17:26:11,776 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:11,783 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:26:11,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:26:11,805 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:32, output treesize:56 [2018-04-11 17:26:11,841 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:11,842 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:11,842 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:11,843 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 39 treesize of output 51 [2018-04-11 17:26:11,843 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:11,886 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:11,887 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:11,887 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 33 treesize of output 37 [2018-04-11 17:26:11,888 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:11,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:26:11,909 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:73, output treesize:77 [2018-04-11 17:26:11,963 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:11,973 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 56 treesize of output 71 [2018-04-11 17:26:11,978 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 64 treesize of output 57 [2018-04-11 17:26:11,979 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:12,021 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 50 treesize of output 43 [2018-04-11 17:26:12,022 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:12,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:26:12,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 42 treesize of output 37 [2018-04-11 17:26:12,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-11 17:26:12,116 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:12,125 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:12,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-11 17:26:12,161 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:99, output treesize:128 [2018-04-11 17:26:12,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2018-04-11 17:26:12,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 17:26:12,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:12,290 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:12,306 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:12,309 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:12,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 81 [2018-04-11 17:26:12,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 78 [2018-04-11 17:26:12,319 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:12,350 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 2 case distinctions, treesize of input 54 treesize of output 53 [2018-04-11 17:26:12,351 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-11 17:26:12,370 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:26:12,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-04-11 17:26:12,390 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:112, output treesize:138 [2018-04-11 17:26:12,591 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:12,609 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:12,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 71 [2018-04-11 17:26:12,621 INFO L477 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 66 [2018-04-11 17:26:12,622 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 17:26:12,666 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:12,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 58 [2018-04-11 17:26:12,672 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 17:26:12,673 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:12,674 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 52 treesize of output 46 [2018-04-11 17:26:12,674 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:12,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-04-11 17:26:12,718 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:12,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 35 [2018-04-11 17:26:12,720 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:12,751 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:12,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-04-11 17:26:12,752 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:12,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 39 [2018-04-11 17:26:12,786 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:26:12,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 5 dim-1 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2018-04-11 17:26:12,882 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 52 treesize of output 44 [2018-04-11 17:26:12,884 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:12,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-11 17:26:12,884 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:12,891 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:12,949 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 47 treesize of output 40 [2018-04-11 17:26:12,951 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:12,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-11 17:26:12,951 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:12,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 17:26:12,958 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:12,962 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:13,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 3 dim-2 vars, End of recursive call: 10 dim-0 vars, and 6 xjuncts. [2018-04-11 17:26:13,014 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 13 variables, input treesize:168, output treesize:136 [2018-04-11 17:26:13,068 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:26:13,068 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:26:13,068 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-11 17:26:13,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 17:26:13,068 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 17:26:13,068 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2018-04-11 17:26:13,068 INFO L87 Difference]: Start difference. First operand 183 states and 198 transitions. Second operand 19 states. [2018-04-11 17:26:14,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:14,489 INFO L93 Difference]: Finished difference Result 273 states and 296 transitions. [2018-04-11 17:26:14,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 17:26:14,489 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 41 [2018-04-11 17:26:14,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:14,490 INFO L225 Difference]: With dead ends: 273 [2018-04-11 17:26:14,490 INFO L226 Difference]: Without dead ends: 273 [2018-04-11 17:26:14,490 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=239, Invalid=1093, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 17:26:14,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-04-11 17:26:14,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 202. [2018-04-11 17:26:14,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-04-11 17:26:14,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 222 transitions. [2018-04-11 17:26:14,492 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 222 transitions. Word has length 41 [2018-04-11 17:26:14,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:14,492 INFO L459 AbstractCegarLoop]: Abstraction has 202 states and 222 transitions. [2018-04-11 17:26:14,492 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 17:26:14,492 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 222 transitions. [2018-04-11 17:26:14,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-11 17:26:14,493 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:14,493 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 17:26:14,493 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-04-11 17:26:14,493 INFO L82 PathProgramCache]: Analyzing trace with hash 825125320, now seen corresponding path program 2 times [2018-04-11 17:26:14,493 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:14,493 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:14,494 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:14,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 17:26:14,494 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:14,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:14,500 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:14,503 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:26:14,503 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:26:14,503 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:26:14,504 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 17:26:14,520 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 17:26:14,520 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 17:26:14,522 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:26:14,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:26:14,555 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:14,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:14,558 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 17:26:14,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 17:26:14,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:26:14,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:14,585 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:14,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:14,588 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-11 17:26:14,619 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:14,620 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:14,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 17:26:14,621 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:14,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:26:14,628 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:14,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:14,633 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:29 [2018-04-11 17:26:14,645 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:14,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-04-11 17:26:14,648 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 19 treesize of output 14 [2018-04-11 17:26:14,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:14,651 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:14,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 17:26:14,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:26:14,665 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:14,666 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:14,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:14,675 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:53, output treesize:39 [2018-04-11 17:26:14,735 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:14,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2018-04-11 17:26:14,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 17:26:14,739 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:14,742 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:14,752 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:14,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2018-04-11 17:26:14,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:26:14,755 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:14,761 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:14,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:14,769 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:67, output treesize:59 [2018-04-11 17:26:14,789 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:14,789 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:14,790 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:14,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 17:26:14,791 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:14,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 17:26:14,802 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:14,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:14,811 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:70, output treesize:62 [2018-04-11 17:26:14,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2018-04-11 17:26:14,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-04-11 17:26:14,835 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:14,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:14,855 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 30 treesize of output 36 [2018-04-11 17:26:14,857 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 18 treesize of output 11 [2018-04-11 17:26:14,858 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:14,861 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:14,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:14,871 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:84, output treesize:56 [2018-04-11 17:26:14,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 88 [2018-04-11 17:26:14,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 17:26:14,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:14,948 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:14,960 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 35 treesize of output 36 [2018-04-11 17:26:14,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 16 treesize of output 15 [2018-04-11 17:26:14,962 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:14,965 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:14,975 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-11 17:26:14,975 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:123, output treesize:99 [2018-04-11 17:26:15,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 64 [2018-04-11 17:26:15,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 17:26:15,069 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:15,076 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:15,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2018-04-11 17:26:15,077 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:15,083 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 29 treesize of output 21 [2018-04-11 17:26:15,084 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:15,089 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:15,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-04-11 17:26:15,100 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:15,101 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-11 17:26:15,101 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:15,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 17:26:15,105 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:15,106 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:15,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:15,127 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:116, output treesize:21 [2018-04-11 17:26:15,172 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:26:15,172 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:26:15,172 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-11 17:26:15,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 17:26:15,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 17:26:15,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2018-04-11 17:26:15,172 INFO L87 Difference]: Start difference. First operand 202 states and 222 transitions. Second operand 21 states. [2018-04-11 17:26:16,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:16,427 INFO L93 Difference]: Finished difference Result 312 states and 342 transitions. [2018-04-11 17:26:16,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 17:26:16,427 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 41 [2018-04-11 17:26:16,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:16,428 INFO L225 Difference]: With dead ends: 312 [2018-04-11 17:26:16,428 INFO L226 Difference]: Without dead ends: 312 [2018-04-11 17:26:16,428 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=269, Invalid=1368, Unknown=3, NotChecked=0, Total=1640 [2018-04-11 17:26:16,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-04-11 17:26:16,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 204. [2018-04-11 17:26:16,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-04-11 17:26:16,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 225 transitions. [2018-04-11 17:26:16,430 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 225 transitions. Word has length 41 [2018-04-11 17:26:16,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:16,430 INFO L459 AbstractCegarLoop]: Abstraction has 204 states and 225 transitions. [2018-04-11 17:26:16,430 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 17:26:16,430 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 225 transitions. [2018-04-11 17:26:16,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 17:26:16,431 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:16,431 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] [2018-04-11 17:26:16,431 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-04-11 17:26:16,431 INFO L82 PathProgramCache]: Analyzing trace with hash 309460647, now seen corresponding path program 1 times [2018-04-11 17:26:16,431 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:16,431 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:16,432 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:16,432 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 17:26:16,432 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:16,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:16,437 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:16,486 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:26:16,486 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:26:16,487 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:26:16,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:16,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:16,504 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:26:16,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:26:16,511 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:16,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:26:16,514 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:16,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:16,517 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:11 [2018-04-11 17:26:16,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 17:26:16,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:26:16,536 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:16,537 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:16,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:16,541 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-04-11 17:26:16,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-04-11 17:26:16,647 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 11 treesize of output 8 [2018-04-11 17:26:16,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 17:26:16,660 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:26:16,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 17:26:16,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 17:26:16,680 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:16,681 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:16,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:26:16,694 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:48, output treesize:54 [2018-04-11 17:26:16,766 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:16,766 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 38 treesize of output 41 [2018-04-11 17:26:16,767 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:16,787 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:16,788 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:16,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2018-04-11 17:26:16,789 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:16,808 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:16,808 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:16,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 38 [2018-04-11 17:26:16,809 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:16,826 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 31 treesize of output 30 [2018-04-11 17:26:16,826 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:16,843 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-11 17:26:16,843 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:76, output treesize:62 [2018-04-11 17:26:16,922 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 50 treesize of output 47 [2018-04-11 17:26:16,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:26:16,923 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:16,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:16,956 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 54 treesize of output 51 [2018-04-11 17:26:16,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:26:16,959 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:16,970 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:17,017 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 50 treesize of output 47 [2018-04-11 17:26:17,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:26:17,020 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:17,034 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:17,057 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 46 treesize of output 43 [2018-04-11 17:26:17,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:26:17,059 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:17,066 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:17,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-11 17:26:17,083 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 9 variables, input treesize:105, output treesize:82 [2018-04-11 17:26:17,172 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 49 treesize of output 31 [2018-04-11 17:26:17,172 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:17,204 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 28 [2018-04-11 17:26:17,204 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:17,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 17:26:17,218 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:96, output treesize:52 [2018-04-11 17:26:17,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2018-04-11 17:26:17,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 17:26:17,368 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:17,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:17,388 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 41 treesize of output 37 [2018-04-11 17:26:17,392 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 11 treesize of output 8 [2018-04-11 17:26:17,392 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 17:26:17,406 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:26:17,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-04-11 17:26:17,432 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:17,433 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-11 17:26:17,433 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:17,437 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:17,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2018-04-11 17:26:17,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 17:26:17,461 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-04-11 17:26:17,466 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:26:17,467 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 31 treesize of output 27 [2018-04-11 17:26:17,469 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-11 17:26:17,469 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:17,473 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:17,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-11 17:26:17,489 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 10 variables, input treesize:81, output treesize:21 [2018-04-11 17:26:17,547 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:26:17,547 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 17:26:17,547 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 21] total 27 [2018-04-11 17:26:17,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-11 17:26:17,547 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-11 17:26:17,548 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=634, Unknown=0, NotChecked=0, Total=702 [2018-04-11 17:26:17,548 INFO L87 Difference]: Start difference. First operand 204 states and 225 transitions. Second operand 27 states. [2018-04-11 17:26:19,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:19,842 INFO L93 Difference]: Finished difference Result 278 states and 299 transitions. [2018-04-11 17:26:19,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-11 17:26:19,843 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 43 [2018-04-11 17:26:19,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:19,843 INFO L225 Difference]: With dead ends: 278 [2018-04-11 17:26:19,843 INFO L226 Difference]: Without dead ends: 278 [2018-04-11 17:26:19,844 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=534, Invalid=2888, Unknown=0, NotChecked=0, Total=3422 [2018-04-11 17:26:19,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-04-11 17:26:19,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 219. [2018-04-11 17:26:19,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-04-11 17:26:19,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 241 transitions. [2018-04-11 17:26:19,846 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 241 transitions. Word has length 43 [2018-04-11 17:26:19,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:19,846 INFO L459 AbstractCegarLoop]: Abstraction has 219 states and 241 transitions. [2018-04-11 17:26:19,846 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-11 17:26:19,846 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 241 transitions. [2018-04-11 17:26:19,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 17:26:19,847 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:19,847 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] [2018-04-11 17:26:19,847 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-04-11 17:26:19,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1398575738, now seen corresponding path program 1 times [2018-04-11 17:26:19,847 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:19,847 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:19,848 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:19,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:19,848 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:19,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:19,853 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:19,856 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:26:19,856 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:26:19,856 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:26:19,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:19,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:19,882 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:26:19,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:26:19,884 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:19,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:19,891 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 17:26:19,906 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:19,907 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:19,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 17:26:19,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:19,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:19,914 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2018-04-11 17:26:19,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 17:26:19,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:26:19,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:19,928 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:19,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:19,936 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:35 [2018-04-11 17:26:19,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-04-11 17:26:19,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 12 treesize of output 11 [2018-04-11 17:26:19,993 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:19,997 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:20,005 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:20,005 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:43 [2018-04-11 17:26:20,099 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:20,099 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:20,100 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:20,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 46 [2018-04-11 17:26:20,101 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:20,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:20,129 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:64, output treesize:70 [2018-04-11 17:26:20,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 54 [2018-04-11 17:26:20,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 51 [2018-04-11 17:26:20,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-04-11 17:26:20,193 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 17:26:20,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 17:26:20,216 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:81, output treesize:135 [2018-04-11 17:26:20,272 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:20,273 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 62 [2018-04-11 17:26:20,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 21 [2018-04-11 17:26:20,283 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:20,296 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:20,345 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 83 treesize of output 69 [2018-04-11 17:26:20,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2018-04-11 17:26:20,349 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:20,363 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:20,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-04-11 17:26:20,391 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:151, output treesize:121 [2018-04-11 17:26:20,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2018-04-11 17:26:20,462 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:20,463 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 25 treesize of output 17 [2018-04-11 17:26:20,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:20,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 17:26:20,468 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:20,471 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:20,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:20,479 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:70, output treesize:28 [2018-04-11 17:26:20,520 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:26:20,520 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:26:20,520 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-11 17:26:20,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 17:26:20,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 17:26:20,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2018-04-11 17:26:20,521 INFO L87 Difference]: Start difference. First operand 219 states and 241 transitions. Second operand 19 states. [2018-04-11 17:26:22,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:22,144 INFO L93 Difference]: Finished difference Result 315 states and 341 transitions. [2018-04-11 17:26:22,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 17:26:22,144 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 43 [2018-04-11 17:26:22,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:22,145 INFO L225 Difference]: With dead ends: 315 [2018-04-11 17:26:22,145 INFO L226 Difference]: Without dead ends: 315 [2018-04-11 17:26:22,145 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=334, Invalid=1387, Unknown=1, NotChecked=0, Total=1722 [2018-04-11 17:26:22,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-04-11 17:26:22,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 234. [2018-04-11 17:26:22,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-04-11 17:26:22,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 258 transitions. [2018-04-11 17:26:22,151 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 258 transitions. Word has length 43 [2018-04-11 17:26:22,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:22,152 INFO L459 AbstractCegarLoop]: Abstraction has 234 states and 258 transitions. [2018-04-11 17:26:22,152 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 17:26:22,152 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 258 transitions. [2018-04-11 17:26:22,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 17:26:22,152 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:22,153 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] [2018-04-11 17:26:22,153 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-04-11 17:26:22,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1398575739, now seen corresponding path program 1 times [2018-04-11 17:26:22,153 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:22,153 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:22,154 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:22,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:22,154 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:22,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:22,163 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 17:26:22,168 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 17:26:22,168 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 17:26:22,168 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 17:26:22,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:22,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 17:26:22,202 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 17:26:22,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 17:26:22,231 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:22,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-11 17:26:22,245 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:22,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:22,252 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:23 [2018-04-11 17:26:22,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 17:26:22,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:26:22,266 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:22,268 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:22,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 17:26: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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:26:22,283 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:22,284 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:22,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:22,294 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2018-04-11 17:26:22,341 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 26 treesize of output 36 [2018-04-11 17:26:22,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-04-11 17:26:22,344 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:22,359 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:22,381 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 30 treesize of output 40 [2018-04-11 17:26:22,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2018-04-11 17:26:22,383 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:22,398 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:22,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2018-04-11 17:26:22,400 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:22,410 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:26:22,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-04-11 17:26:22,428 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:67, output treesize:111 [2018-04-11 17:26:22,635 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:22,637 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 29 treesize of output 28 [2018-04-11 17:26:22,638 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:22,639 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-11 17:26:22,639 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:22,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 17:26:22,645 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:22,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:22,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:22,662 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:90, output treesize:68 [2018-04-11 17:26:22,733 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:22,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-04-11 17:26:22,734 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:22,754 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:22,754 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:22,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 16 [2018-04-11 17:26:22,755 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:22,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:22,771 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:79, output treesize:72 [2018-04-11 17:26:22,812 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:22,813 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:22,814 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:22,821 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 51 treesize of output 59 [2018-04-11 17:26:22,824 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:22,837 INFO L477 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 51 [2018-04-11 17:26:22,837 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-04-11 17:26:22,857 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:22,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:22,877 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:83, output treesize:62 [2018-04-11 17:26:22,925 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:22,926 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:22,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 42 [2018-04-11 17:26:22,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-04-11 17:26:22,928 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:22,934 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:22,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 17:26:22,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 17:26:22,951 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:22,953 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:22,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:22,966 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:78, output treesize:64 [2018-04-11 17:26:23,038 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:23,039 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 17:26:23,040 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 40 treesize of output 38 [2018-04-11 17:26:23,042 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:23,047 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 31 [2018-04-11 17:26:23,047 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 17:26:23,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 17:26:23,058 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:23,062 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:23,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-04-11 17:26:23,076 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 17:26:23,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-04-11 17:26:23,077 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 17:26:23,080 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 17:26:23,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 17:26:23,091 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:81, output treesize:25 [2018-04-11 17:26:23,143 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 17:26:23,143 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 17:26:23,143 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-11 17:26:23,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 17:26:23,144 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 17:26:23,144 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=335, Unknown=16, NotChecked=0, Total=420 [2018-04-11 17:26:23,144 INFO L87 Difference]: Start difference. First operand 234 states and 258 transitions. Second operand 21 states. [2018-04-11 17:26:25,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 17:26:25,008 INFO L93 Difference]: Finished difference Result 330 states and 357 transitions. [2018-04-11 17:26:25,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 17:26:25,009 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 43 [2018-04-11 17:26:25,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 17:26:25,009 INFO L225 Difference]: With dead ends: 330 [2018-04-11 17:26:25,010 INFO L226 Difference]: Without dead ends: 330 [2018-04-11 17:26:25,010 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=270, Invalid=1240, Unknown=50, NotChecked=0, Total=1560 [2018-04-11 17:26:25,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-04-11 17:26:25,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 225. [2018-04-11 17:26:25,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-04-11 17:26:25,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 247 transitions. [2018-04-11 17:26:25,012 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 247 transitions. Word has length 43 [2018-04-11 17:26:25,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 17:26:25,012 INFO L459 AbstractCegarLoop]: Abstraction has 225 states and 247 transitions. [2018-04-11 17:26:25,012 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 17:26:25,012 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 247 transitions. [2018-04-11 17:26:25,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-11 17:26:25,013 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 17:26:25,013 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] [2018-04-11 17:26:25,013 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr36RequiresViolation, mainErr42EnsuresViolationMEMORY_LEAK, mainErr28RequiresViolation, mainErr33RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr38RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr31RequiresViolation, mainErr29RequiresViolation, mainErr3RequiresViolation, mainErr39RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr40AssertViolationMEMORY_FREE, mainErr41AssertViolationMEMORY_FREE, mainErr6RequiresViolation, mainErr35RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr32RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr30RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr34RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, mainErr37RequiresViolation]=== [2018-04-11 17:26:25,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1003344041, now seen corresponding path program 1 times [2018-04-11 17:26:25,013 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 17:26:25,013 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 17:26:25,014 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:25,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 17:26:25,014 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 17:26:25,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-11 17:26:25,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-04-11 17:26:25,037 INFO L421 BasicCegarLoop]: Counterexample might be feasible [2018-04-11 17:26:25,049 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-04-11 17:26:25,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 05:26:25 BoogieIcfgContainer [2018-04-11 17:26:25,064 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 17:26:25,065 INFO L168 Benchmark]: Toolchain (without parser) took 26342.90 ms. Allocated memory was 390.1 MB in the beginning and 955.3 MB in the end (delta: 565.2 MB). Free memory was 323.8 MB in the beginning and 715.8 MB in the end (delta: -392.0 MB). Peak memory consumption was 173.2 MB. Max. memory is 5.3 GB. [2018-04-11 17:26:25,066 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 390.1 MB. Free memory is still 349.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 17:26:25,066 INFO L168 Benchmark]: CACSL2BoogieTranslator took 255.72 ms. Allocated memory is still 390.1 MB. Free memory was 322.5 MB in the beginning and 296.1 MB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 5.3 GB. [2018-04-11 17:26:25,066 INFO L168 Benchmark]: Boogie Preprocessor took 44.53 ms. Allocated memory is still 390.1 MB. Free memory was 296.1 MB in the beginning and 292.1 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 5.3 GB. [2018-04-11 17:26:25,067 INFO L168 Benchmark]: RCFGBuilder took 490.35 ms. Allocated memory was 390.1 MB in the beginning and 590.9 MB in the end (delta: 200.8 MB). Free memory was 292.1 MB in the beginning and 513.0 MB in the end (delta: -220.9 MB). Peak memory consumption was 24.2 MB. Max. memory is 5.3 GB. [2018-04-11 17:26:25,067 INFO L168 Benchmark]: TraceAbstraction took 25549.60 ms. Allocated memory was 590.9 MB in the beginning and 955.3 MB in the end (delta: 364.4 MB). Free memory was 513.0 MB in the beginning and 715.8 MB in the end (delta: -202.8 MB). Peak memory consumption was 161.6 MB. Max. memory is 5.3 GB. [2018-04-11 17:26:25,068 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.24 ms. Allocated memory is still 390.1 MB. Free memory is still 349.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 255.72 ms. Allocated memory is still 390.1 MB. Free memory was 322.5 MB in the beginning and 296.1 MB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 44.53 ms. Allocated memory is still 390.1 MB. Free memory was 296.1 MB in the beginning and 292.1 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 490.35 ms. Allocated memory was 390.1 MB in the beginning and 590.9 MB in the end (delta: 200.8 MB). Free memory was 292.1 MB in the beginning and 513.0 MB in the end (delta: -220.9 MB). Peak memory consumption was 24.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 25549.60 ms. Allocated memory was 590.9 MB in the beginning and 955.3 MB in the end (delta: 364.4 MB). Free memory was 513.0 MB in the beginning and 715.8 MB in the end (delta: -202.8 MB). Peak memory consumption was 161.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 985]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L988] EXPR, FCALL malloc(sizeof(SLL)) VAL [malloc(sizeof(SLL))={11:0}] [L988] SLL* head = malloc(sizeof(SLL)); VAL [head={11:0}, malloc(sizeof(SLL))={11:0}] [L989] FCALL head->next = ((void*)0) VAL [head={11:0}, malloc(sizeof(SLL))={11:0}] [L990] FCALL head->data = 0 VAL [head={11:0}, malloc(sizeof(SLL))={11:0}] [L992] SLL* x = head; VAL [head={11:0}, malloc(sizeof(SLL))={11:0}, x={11:0}] [L995] COND FALSE !(__VERIFIER_nondet_int()) [L1005] COND FALSE !(__VERIFIER_nondet_int()) [L1014] x = head VAL [head={11:0}, malloc(sizeof(SLL))={11:0}, x={11:0}] [L1015] FCALL x->next VAL [head={11:0}, malloc(sizeof(SLL))={11:0}, x={11:0}, x->next={0:0}] [L1015] COND FALSE !(x->next) [L1022] EXPR, FCALL x->next VAL [head={11:0}, malloc(sizeof(SLL))={11:0}, x={11:0}, x->next={0:0}] [L1022] SLL* y = x->next; [L1023] EXPR, FCALL malloc(sizeof(SLL)) VAL [head={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}, x={11:0}, y={0:0}] [L1023] FCALL x->next = malloc(sizeof(SLL)) VAL [head={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}, x={11:0}, y={0:0}] [L1024] FCALL x->data = 1 VAL [head={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}, x={11:0}, y={0:0}] [L1025] FCALL x->next = y VAL [head={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}, x={11:0}, y={0:0}] [L1029] x = head VAL [head={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}, x={11:0}, y={0:0}] [L1032] EXPR, FCALL x->data VAL [head={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}, x={11:0}, x->data=1, y={0:0}] [L1032] COND FALSE !(x->data != 1) [L1038] EXPR, FCALL x->next VAL [head={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}, x={11:0}, x->next={0:0}, y={0:0}] [L1038] x = x->next [L1039] COND FALSE !(\read(*x)) VAL [head={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}, x={0:0}, y={0:0}] [L1047] x = head VAL [head={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}, x={11:0}, y={0:0}] [L1048] COND TRUE x != ((void*)0) [L1050] head = x VAL [head={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}, x={11:0}, y={0:0}] [L1051] EXPR, FCALL x->next VAL [head={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}, x={11:0}, x->next={0:0}, y={0:0}] [L1051] x = x->next [L1052] free(head) VAL [head={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}, x={0:0}, y={0:0}] [L1052] free(head) VAL [head={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}, x={0:0}, y={0:0}] [L1052] FCALL free(head) VAL [head={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}, x={0:0}, y={0:0}] [L1048] COND FALSE !(x != ((void*)0)) VAL [head={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}, x={0:0}, y={0:0}] [L1055] return 0; VAL [\result=0, head={11:0}, malloc(sizeof(SLL))={10:0}, malloc(sizeof(SLL))={11:0}, x={0:0}, y={0:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 111 locations, 43 error locations. UNSAFE Result, 25.5s OverallTime, 28 OverallIterations, 3 TraceHistogramMax, 16.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1945 SDtfs, 6794 SDslu, 7991 SDs, 0 SdLazy, 13526 SolverSat, 1181 SolverUnsat, 169 SolverUnknown, 0 SolverNotchecked, 7.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 834 GetRequests, 323 SyntacticMatches, 7 SemanticMatches, 504 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2622 ImplicationChecksByTransitivity, 10.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=234occurred in iteration=26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 27 MinimizatonAttempts, 1347 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 1313 NumberOfCodeBlocks, 1313 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 785 ConstructedInterpolants, 183 QuantifiedInterpolants, 661135 SizeOfPredicates, 213 NumberOfNonLiveVariables, 2125 ConjunctsInSsa, 524 ConjunctsInUnsatCore, 28 InterpolantComputations, 17 PerfectInterpolantSequences, 18/83 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_17-26-25-073.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/sll-simple-white-blue_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_17-26-25-073.csv Received shutdown request...