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/array-memsafety/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 15:13:06,651 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 15:13:06,653 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 15:13:06,665 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 15:13:06,666 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 15:13:06,666 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 15:13:06,667 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 15:13:06,669 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 15:13:06,670 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 15:13:06,671 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 15:13:06,672 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 15:13:06,672 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 15:13:06,672 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 15:13:06,673 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 15:13:06,674 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 15:13:06,675 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 15:13:06,677 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 15:13:06,678 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 15:13:06,679 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 15:13:06,680 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 15:13:06,681 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 15:13:06,682 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 15:13:06,682 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 15:13:06,683 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 15:13:06,683 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 15:13:06,684 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 15:13:06,684 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 15:13:06,685 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 15:13:06,685 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 15:13:06,685 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 15:13:06,686 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 15:13:06,686 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 15:13:06,706 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 15:13:06,707 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 15:13:06,707 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 15:13:06,708 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 15:13:06,708 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 15:13:06,708 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 15:13:06,708 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 15:13:06,708 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 15:13:06,708 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 15:13:06,708 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 15:13:06,709 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 15:13:06,709 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 15:13:06,709 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 15:13:06,709 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 15:13:06,709 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 15:13:06,709 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 15:13:06,709 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 15:13:06,710 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 15:13:06,710 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 15:13:06,710 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 15:13:06,710 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 15:13:06,710 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 15:13:06,710 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 15:13:06,710 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 15:13:06,741 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 15:13:06,749 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 15:13:06,753 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 15:13:06,754 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 15:13:06,754 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 15:13:06,755 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,041 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG90cf60913 [2018-04-11 15:13:07,185 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 15:13:07,185 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 15:13:07,185 INFO L168 CDTParser]: Scanning openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,193 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 15:13:07,193 INFO L215 ultiparseSymbolTable]: [2018-04-11 15:13:07,193 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 15:13:07,194 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____bswap_32 ('__bswap_32') in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,194 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpy ('cstpncpy') in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,194 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,194 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____bswap_64 ('__bswap_64') in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,194 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 15:13:07,194 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____quad_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,194 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____off_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,194 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____fsid_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,195 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____uint16_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,195 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____gid_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,195 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__daddr_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,195 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____ino64_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,195 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__clock_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,195 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____syscall_slong_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,195 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____pid_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,195 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____ino_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,195 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____WAIT_STATUS in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,196 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____int16_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,196 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____loff_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,196 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____u_long in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,196 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__pthread_cond_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,196 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____blkcnt_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,196 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__fsid_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,196 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__sigset_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,196 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__clockid_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,196 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__pthread_spinlock_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,196 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__u_int32_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,197 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____sigset_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,197 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__suseconds_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,197 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__fd_mask in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,197 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____caddr_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,197 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__uint in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,197 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__u_long in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,197 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__ulong in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,197 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__pthread_rwlockattr_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,197 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__nlink_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,198 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____qaddr_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,198 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____blksize_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,198 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__fd_set in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,198 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__pthread_rwlock_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,198 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__pthread_key_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,198 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____rlim64_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,198 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____dev_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,198 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____fsblkcnt_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,198 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__dev_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,199 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__id_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,199 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__pthread_condattr_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,199 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____u_int in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,199 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__time_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,199 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____clock_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,199 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__pthread_barrierattr_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,199 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__register_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,199 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__int64_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,199 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____daddr_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,199 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____fsfilcnt_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,199 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__u_quad_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,200 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__ushort in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,200 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__ldiv_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,200 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____useconds_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,200 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__loff_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,200 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__pthread_mutex_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,200 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____time_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,200 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____fsfilcnt64_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,200 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____uint8_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,200 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____key_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,200 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__ino_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,200 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____int64_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,201 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____ssize_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,201 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____mode_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,201 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__fsfilcnt_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,201 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__int8_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,201 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__u_int64_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,201 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__int32_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,201 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____socklen_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,201 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__pthread_mutexattr_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,201 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__size_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,202 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__off_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,202 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____timer_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,202 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____intptr_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,202 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__timer_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,202 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__caddr_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,202 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__mode_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,202 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____int8_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,202 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____u_short in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,202 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____nlink_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,202 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__key_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,203 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__gid_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,203 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____blkcnt64_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,203 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__u_short in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,203 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____uint64_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,203 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__pid_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,203 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____uid_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,203 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__ssize_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,203 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____fsword_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,203 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____fd_mask in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,203 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__blksize_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,204 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____u_char in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,204 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__wchar_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,204 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__uid_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,204 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__pthread_attr_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,204 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__lldiv_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,204 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____sig_atomic_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,204 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__int16_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,204 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__u_int8_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,204 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__fsblkcnt_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,204 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__div_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,204 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____uint32_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,205 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____id_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,205 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__pthread_once_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,205 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____int32_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,205 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__pthread_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,205 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____syscall_ulong_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,205 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__u_int in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,205 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__u_int16_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,205 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__u_char in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,205 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____rlim_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,205 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__quad_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,206 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__blkcnt_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,206 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____fsblkcnt64_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,206 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____clockid_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,206 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____pthread_list_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,206 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____off64_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,206 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____suseconds_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,206 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__pthread_barrier_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,206 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____u_quad_t in openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,219 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG90cf60913 [2018-04-11 15:13:07,222 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 15:13:07,223 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 15:13:07,224 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 15:13:07,224 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 15:13:07,228 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 15:13:07,228 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 03:13:07" (1/1) ... [2018-04-11 15:13:07,230 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@418af2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:13:07, skipping insertion in model container [2018-04-11 15:13:07,230 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 03:13:07" (1/1) ... [2018-04-11 15:13:07,241 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 15:13:07,263 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 15:13:07,392 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 15:13:07,426 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 15:13:07,432 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 114 non ball SCCs. Number of states in SCCs 114. [2018-04-11 15:13:07,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:13:07 WrapperNode [2018-04-11 15:13:07,472 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 15:13:07,473 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 15:13:07,473 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 15:13:07,473 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 15:13:07,485 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:13:07" (1/1) ... [2018-04-11 15:13:07,485 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:13:07" (1/1) ... [2018-04-11 15:13:07,498 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:13:07" (1/1) ... [2018-04-11 15:13:07,498 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:13:07" (1/1) ... [2018-04-11 15:13:07,506 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:13:07" (1/1) ... [2018-04-11 15:13:07,510 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:13:07" (1/1) ... [2018-04-11 15:13:07,512 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:13:07" (1/1) ... [2018-04-11 15:13:07,514 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 15:13:07,515 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 15:13:07,515 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 15:13:07,515 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 15:13:07,515 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:13:07" (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 15:13:07,597 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 15:13:07,597 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 15:13:07,597 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-11 15:13:07,597 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-11 15:13:07,597 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpy [2018-04-11 15:13:07,597 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 15:13:07,597 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-11 15:13:07,598 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-11 15:13:07,598 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 15:13:07,598 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 15:13:07,598 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 15:13:07,598 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 15:13:07,598 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 15:13:07,598 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 15:13:07,598 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 15:13:07,598 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 15:13:07,598 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 15:13:07,599 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 15:13:07,599 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 15:13:07,599 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 15:13:07,599 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 15:13:07,599 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 15:13:07,599 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 15:13:07,599 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 15:13:07,599 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 15:13:07,599 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 15:13:07,600 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 15:13:07,600 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 15:13:07,600 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 15:13:07,600 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 15:13:07,600 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 15:13:07,600 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 15:13:07,600 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 15:13:07,600 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 15:13:07,600 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 15:13:07,601 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 15:13:07,601 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 15:13:07,601 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 15:13:07,601 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 15:13:07,601 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 15:13:07,601 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 15:13:07,601 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 15:13:07,601 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 15:13:07,601 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 15:13:07,602 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 15:13:07,602 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 15:13:07,602 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 15:13:07,602 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 15:13:07,602 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 15:13:07,602 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 15:13:07,602 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 15:13:07,602 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 15:13:07,602 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 15:13:07,603 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 15:13:07,603 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 15:13:07,603 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 15:13:07,603 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 15:13:07,603 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 15:13:07,603 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 15:13:07,603 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 15:13:07,603 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 15:13:07,603 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 15:13:07,603 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 15:13:07,604 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 15:13:07,604 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 15:13:07,604 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 15:13:07,604 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 15:13:07,604 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 15:13:07,604 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 15:13:07,604 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 15:13:07,604 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 15:13:07,604 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 15:13:07,604 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 15:13:07,604 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 15:13:07,605 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 15:13:07,605 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 15:13:07,605 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 15:13:07,605 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 15:13:07,605 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 15:13:07,605 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 15:13:07,605 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 15:13:07,605 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 15:13:07,605 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 15:13:07,605 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 15:13:07,606 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 15:13:07,606 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 15:13:07,606 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 15:13:07,606 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 15:13:07,606 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 15:13:07,606 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 15:13:07,606 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 15:13:07,606 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 15:13:07,606 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 15:13:07,606 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 15:13:07,607 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 15:13:07,607 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 15:13:07,607 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 15:13:07,607 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 15:13:07,607 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 15:13:07,607 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 15:13:07,607 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 15:13:07,607 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 15:13:07,607 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 15:13:07,607 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 15:13:07,607 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 15:13:07,608 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 15:13:07,608 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 15:13:07,608 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 15:13:07,608 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 15:13:07,608 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpy [2018-04-11 15:13:07,608 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 15:13:07,608 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-04-11 15:13:07,608 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-04-11 15:13:07,608 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 15:13:07,609 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 15:13:07,609 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 15:13:07,609 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 15:13:07,609 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 15:13:07,609 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 15:13:07,609 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 15:13:07,905 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 15:13:07,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 03:13:07 BoogieIcfgContainer [2018-04-11 15:13:07,906 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 15:13:07,907 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 15:13:07,907 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 15:13:07,909 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 15:13:07,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 03:13:07" (1/3) ... [2018-04-11 15:13:07,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fb0edc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 03:13:07, skipping insertion in model container [2018-04-11 15:13:07,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:13:07" (2/3) ... [2018-04-11 15:13:07,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fb0edc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 03:13:07, skipping insertion in model container [2018-04-11 15:13:07,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 03:13:07" (3/3) ... [2018-04-11 15:13:07,912 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:13:07,918 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 15:13:07,923 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 21 error locations. [2018-04-11 15:13:07,954 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 15:13:07,954 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 15:13:07,955 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 15:13:07,955 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 15:13:07,955 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 15:13:07,955 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 15:13:07,955 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 15:13:07,955 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 15:13:07,955 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 15:13:07,956 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 15:13:07,966 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states. [2018-04-11 15:13:07,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-11 15:13:07,972 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:07,973 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:13:07,973 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr12RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr17RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr13RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr8RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr9RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr10RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr15RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr11RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr16RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr14RequiresViolation]=== [2018-04-11 15:13:07,976 INFO L82 PathProgramCache]: Analyzing trace with hash -79722019, now seen corresponding path program 1 times [2018-04-11 15:13:07,977 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:07,977 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:08,009 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:08,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:13:08,009 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:08,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:08,048 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:08,098 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 15:13:08,101 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:13:08,101 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:13:08,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 15:13:08,115 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 15:13:08,115 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:13:08,117 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 4 states. [2018-04-11 15:13:08,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:08,229 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2018-04-11 15:13:08,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 15:13:08,230 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-04-11 15:13:08,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:08,238 INFO L225 Difference]: With dead ends: 70 [2018-04-11 15:13:08,238 INFO L226 Difference]: Without dead ends: 67 [2018-04-11 15:13:08,240 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 15:13:08,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-04-11 15:13:08,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-04-11 15:13:08,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-04-11 15:13:08,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2018-04-11 15:13:08,265 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 13 [2018-04-11 15:13:08,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:08,265 INFO L459 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2018-04-11 15:13:08,265 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 15:13:08,265 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2018-04-11 15:13:08,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-11 15:13:08,266 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:08,266 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:13:08,266 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr12RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr17RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr13RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr8RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr9RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr10RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr15RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr11RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr16RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr14RequiresViolation]=== [2018-04-11 15:13:08,266 INFO L82 PathProgramCache]: Analyzing trace with hash -79722018, now seen corresponding path program 1 times [2018-04-11 15:13:08,266 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:08,266 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:08,267 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:08,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:13:08,267 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:08,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:08,282 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:08,342 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 15:13:08,343 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:13:08,343 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 15:13:08,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:13:08,344 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:13:08,344 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:13:08,344 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand 5 states. [2018-04-11 15:13:08,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:08,374 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2018-04-11 15:13:08,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 15:13:08,375 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-04-11 15:13:08,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:08,376 INFO L225 Difference]: With dead ends: 66 [2018-04-11 15:13:08,376 INFO L226 Difference]: Without dead ends: 66 [2018-04-11 15:13:08,377 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:13:08,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-04-11 15:13:08,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-04-11 15:13:08,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-04-11 15:13:08,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2018-04-11 15:13:08,382 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 13 [2018-04-11 15:13:08,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:08,382 INFO L459 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2018-04-11 15:13:08,382 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:13:08,382 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2018-04-11 15:13:08,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-11 15:13:08,383 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:08,383 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:13:08,383 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr12RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr17RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr13RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr8RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr9RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr10RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr15RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr11RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr16RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr14RequiresViolation]=== [2018-04-11 15:13:08,383 INFO L82 PathProgramCache]: Analyzing trace with hash 118325590, now seen corresponding path program 1 times [2018-04-11 15:13:08,383 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:08,383 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:08,384 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:08,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:13:08,384 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:08,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:08,398 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:08,428 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 15:13:08,428 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:13:08,429 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-11 15:13:08,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 15:13:08,429 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 15:13:08,429 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 15:13:08,429 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand 3 states. [2018-04-11 15:13:08,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:08,455 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2018-04-11 15:13:08,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 15:13:08,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-04-11 15:13:08,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:08,456 INFO L225 Difference]: With dead ends: 60 [2018-04-11 15:13:08,456 INFO L226 Difference]: Without dead ends: 60 [2018-04-11 15:13:08,456 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 15:13:08,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-04-11 15:13:08,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-04-11 15:13:08,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-04-11 15:13:08,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2018-04-11 15:13:08,460 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 16 [2018-04-11 15:13:08,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:08,460 INFO L459 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2018-04-11 15:13:08,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 15:13:08,460 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-04-11 15:13:08,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-11 15:13:08,460 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:08,460 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:13:08,460 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr12RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr17RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr13RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr8RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr9RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr10RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr15RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr11RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr16RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr14RequiresViolation]=== [2018-04-11 15:13:08,461 INFO L82 PathProgramCache]: Analyzing trace with hash 118325591, now seen corresponding path program 1 times [2018-04-11 15:13:08,461 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:08,461 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:08,462 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:08,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:13:08,462 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:08,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:08,471 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:08,498 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 15:13:08,499 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:13:08,499 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-11 15:13:08,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 15:13:08,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 15:13:08,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 15:13:08,500 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand 3 states. [2018-04-11 15:13:08,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:08,522 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-04-11 15:13:08,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 15:13:08,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-04-11 15:13:08,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:08,522 INFO L225 Difference]: With dead ends: 54 [2018-04-11 15:13:08,522 INFO L226 Difference]: Without dead ends: 54 [2018-04-11 15:13:08,523 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 15:13:08,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-04-11 15:13:08,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-04-11 15:13:08,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-04-11 15:13:08,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-04-11 15:13:08,525 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 16 [2018-04-11 15:13:08,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:08,525 INFO L459 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-04-11 15:13:08,525 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 15:13:08,526 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-04-11 15:13:08,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-11 15:13:08,526 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:08,526 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:13:08,526 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr12RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr17RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr13RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr8RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr9RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr10RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr15RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr11RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr16RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr14RequiresViolation]=== [2018-04-11 15:13:08,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1482550872, now seen corresponding path program 1 times [2018-04-11 15:13:08,526 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:08,526 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:08,527 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:08,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:13:08,527 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:08,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:08,543 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:08,547 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:13:08,547 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:13:08,547 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:13:08,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:13:08,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:08,602 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:13:08,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:08,627 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:08,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:08,629 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 15:13:08,664 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:08,665 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:08,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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 15:13:08,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:08,671 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 15:13:08,671 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-04-11 15:13:08,747 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 15:13:08,748 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:13:08,748 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 15:13:08,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 15:13:08,748 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 15:13:08,749 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-04-11 15:13:08,749 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 9 states. [2018-04-11 15:13:08,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:08,951 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2018-04-11 15:13:08,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 15:13:08,951 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-04-11 15:13:08,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:08,952 INFO L225 Difference]: With dead ends: 56 [2018-04-11 15:13:08,952 INFO L226 Difference]: Without dead ends: 56 [2018-04-11 15:13:08,952 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-04-11 15:13:08,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-04-11 15:13:08,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2018-04-11 15:13:08,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-04-11 15:13:08,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2018-04-11 15:13:08,954 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 25 [2018-04-11 15:13:08,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:08,955 INFO L459 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-04-11 15:13:08,955 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 15:13:08,955 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2018-04-11 15:13:08,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-11 15:13:08,955 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:08,955 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:13:08,955 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr12RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr17RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr13RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr8RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr9RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr10RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr15RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr11RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr16RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr14RequiresViolation]=== [2018-04-11 15:13:08,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1482550873, now seen corresponding path program 1 times [2018-04-11 15:13:08,955 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:08,955 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:08,956 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:08,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:13:08,956 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:08,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:08,973 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:08,978 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:13:08,978 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:13:08,978 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:13:08,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:13:09,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:09,023 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:13:09,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:13:09,032 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:09,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:13:09,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:09,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:09,044 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:13:09,096 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:09,096 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:09,097 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 19 treesize of output 28 [2018-04-11 15:13:09,098 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:09,107 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:09,107 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:09,108 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 15:13:09,108 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:09,113 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 15:13:09,113 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2018-04-11 15:13:09,182 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 15:13:09,182 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:13:09,182 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-11 15:13:09,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 15:13:09,183 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 15:13:09,183 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-04-11 15:13:09,183 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 11 states. [2018-04-11 15:13:09,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:09,500 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2018-04-11 15:13:09,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 15:13:09,500 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2018-04-11 15:13:09,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:09,501 INFO L225 Difference]: With dead ends: 105 [2018-04-11 15:13:09,501 INFO L226 Difference]: Without dead ends: 105 [2018-04-11 15:13:09,501 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2018-04-11 15:13:09,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-04-11 15:13:09,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 89. [2018-04-11 15:13:09,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-04-11 15:13:09,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 104 transitions. [2018-04-11 15:13:09,505 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 104 transitions. Word has length 25 [2018-04-11 15:13:09,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:09,505 INFO L459 AbstractCegarLoop]: Abstraction has 89 states and 104 transitions. [2018-04-11 15:13:09,505 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 15:13:09,505 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 104 transitions. [2018-04-11 15:13:09,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-11 15:13:09,505 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:09,505 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:13:09,506 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr12RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr17RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr13RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr8RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr9RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr10RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr15RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr11RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr16RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr14RequiresViolation]=== [2018-04-11 15:13:09,506 INFO L82 PathProgramCache]: Analyzing trace with hash -206392869, now seen corresponding path program 1 times [2018-04-11 15:13:09,506 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:09,506 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:09,507 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:09,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:13:09,507 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:09,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:09,518 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:09,523 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:13:09,523 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:13:09,523 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:13:09,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:13:09,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:09,558 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:13:09,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:09,564 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:09,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:09,569 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:09,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:09,573 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:13:09,601 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:09,601 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:09,602 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 15:13:09,602 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:09,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-04-11 15:13:09,609 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:09,614 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 15:13:09,614 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:20 [2018-04-11 15:13:09,672 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 15:13:09,673 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:13:09,673 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-11 15:13:09,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 15:13:09,673 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 15:13:09,673 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-04-11 15:13:09,674 INFO L87 Difference]: Start difference. First operand 89 states and 104 transitions. Second operand 10 states. [2018-04-11 15:13:09,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:09,914 INFO L93 Difference]: Finished difference Result 97 states and 116 transitions. [2018-04-11 15:13:09,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 15:13:09,915 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-04-11 15:13:09,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:09,917 INFO L225 Difference]: With dead ends: 97 [2018-04-11 15:13:09,917 INFO L226 Difference]: Without dead ends: 97 [2018-04-11 15:13:09,917 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-04-11 15:13:09,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-04-11 15:13:09,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 55. [2018-04-11 15:13:09,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-04-11 15:13:09,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2018-04-11 15:13:09,919 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 25 [2018-04-11 15:13:09,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:09,920 INFO L459 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2018-04-11 15:13:09,920 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 15:13:09,920 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2018-04-11 15:13:09,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-11 15:13:09,920 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:09,920 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:13:09,920 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr12RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr17RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr13RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr8RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr9RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr10RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr15RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr11RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr16RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr14RequiresViolation]=== [2018-04-11 15:13:09,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1285563194, now seen corresponding path program 1 times [2018-04-11 15:13:09,920 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:09,920 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:09,921 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:09,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:13:09,921 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:09,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:09,931 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:09,937 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:13:09,937 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:13:09,937 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:13:09,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:13:09,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:09,972 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:13:09,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:09,980 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:09,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:09,984 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 15:13:09,999 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:10,000 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:10,001 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 15:13:10,001 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:10,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:10,006 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2018-04-11 15:13:10,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-04-11 15:13:10,056 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:10,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:10,064 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:23 [2018-04-11 15:13:10,079 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 15:13:10,081 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 15:13:10,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:10,083 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:10,089 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 15:13:10,089 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:31 [2018-04-11 15:13:10,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-04-11 15:13:10,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-11 15:13:10,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:10,132 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:10,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:13:10,137 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:23 [2018-04-11 15:13:10,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 15:13:10,205 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:13:10,205 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-04-11 15:13:10,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 15:13:10,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 15:13:10,206 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-04-11 15:13:10,206 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand 16 states. [2018-04-11 15:13:10,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:10,538 INFO L93 Difference]: Finished difference Result 106 states and 117 transitions. [2018-04-11 15:13:10,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 15:13:10,538 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2018-04-11 15:13:10,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:10,539 INFO L225 Difference]: With dead ends: 106 [2018-04-11 15:13:10,539 INFO L226 Difference]: Without dead ends: 106 [2018-04-11 15:13:10,539 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=585, Unknown=0, NotChecked=0, Total=702 [2018-04-11 15:13:10,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-04-11 15:13:10,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 74. [2018-04-11 15:13:10,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-04-11 15:13:10,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2018-04-11 15:13:10,544 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 26 [2018-04-11 15:13:10,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:10,544 INFO L459 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2018-04-11 15:13:10,544 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 15:13:10,544 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2018-04-11 15:13:10,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-11 15:13:10,545 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:10,545 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:13:10,546 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr12RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr17RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr13RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr8RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr9RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr10RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr15RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr11RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr16RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr14RequiresViolation]=== [2018-04-11 15:13:10,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1285563193, now seen corresponding path program 1 times [2018-04-11 15:13:10,546 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:10,546 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:10,546 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:10,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:13:10,547 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:10,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:10,559 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:10,562 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:13:10,563 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:13:10,563 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:13:10,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:13:10,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:10,592 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:13:10,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:10,604 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:10,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:13:10,611 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:10,619 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:10,619 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:20 [2018-04-11 15:13:10,642 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:10,645 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:10,645 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 15:13:10,646 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:10,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 15:13:10,655 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:10,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:10,661 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-04-11 15:13:10,704 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:13:10,705 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:10,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 28 [2018-04-11 15:13:10,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-11 15:13:10,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 15:13:10,737 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:75 [2018-04-11 15:13:10,785 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 45 treesize of output 42 [2018-04-11 15:13:10,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:10,788 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:10,796 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:10,860 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 41 treesize of output 38 [2018-04-11 15:13:10,872 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 15:13:10,872 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:10,882 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:10,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 36 [2018-04-11 15:13:10,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 8 treesize of output 7 [2018-04-11 15:13:10,933 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:10,942 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:10,970 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 35 treesize of output 32 [2018-04-11 15:13:10,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:10,972 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:10,977 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:11,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 33 [2018-04-11 15:13:11,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:11,003 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:11,008 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:11,030 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 32 treesize of output 29 [2018-04-11 15:13:11,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:13:11,031 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:11,036 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:11,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 6 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-11 15:13:11,056 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:121, output treesize:95 [2018-04-11 15:13:11,133 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 42 treesize of output 38 [2018-04-11 15:13:11,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 15:13:11,135 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:11,145 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:11,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2018-04-11 15:13:11,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 15:13:11,173 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:11,178 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:11,201 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 52 treesize of output 48 [2018-04-11 15:13:11,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 15:13:11,203 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:11,209 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:11,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-04-11 15:13:11,229 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:137, output treesize:104 [2018-04-11 15:13:11,304 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 15:13:11,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 15:13:11,306 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:11,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:11,330 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 28 treesize of output 24 [2018-04-11 15:13:11,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-11 15:13:11,331 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:11,337 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:11,355 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 35 [2018-04-11 15:13:11,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-11 15:13:11,356 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:11,362 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:11,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-04-11 15:13:11,376 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:101, output treesize:61 [2018-04-11 15:13:11,483 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 15:13:11,483 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:13:11,484 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-04-11 15:13:11,484 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 15:13:11,484 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 15:13:11,484 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-04-11 15:13:11,484 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand 18 states. [2018-04-11 15:13:11,979 WARN L151 SmtUtils]: Spent 157ms on a formula simplification. DAG size of input: 77 DAG size of output 59 [2018-04-11 15:13:12,216 WARN L151 SmtUtils]: Spent 184ms on a formula simplification. DAG size of input: 89 DAG size of output 77 [2018-04-11 15:13:12,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:12,475 INFO L93 Difference]: Finished difference Result 132 states and 145 transitions. [2018-04-11 15:13:12,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 15:13:12,475 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 26 [2018-04-11 15:13:12,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:12,476 INFO L225 Difference]: With dead ends: 132 [2018-04-11 15:13:12,476 INFO L226 Difference]: Without dead ends: 132 [2018-04-11 15:13:12,476 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=117, Invalid=639, Unknown=0, NotChecked=0, Total=756 [2018-04-11 15:13:12,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-04-11 15:13:12,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 92. [2018-04-11 15:13:12,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-04-11 15:13:12,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2018-04-11 15:13:12,481 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 26 [2018-04-11 15:13:12,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:12,481 INFO L459 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2018-04-11 15:13:12,481 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 15:13:12,481 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2018-04-11 15:13:12,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-11 15:13:12,481 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:12,481 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:13:12,482 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr12RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr17RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr13RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr8RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr9RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr10RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr15RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr11RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr16RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr14RequiresViolation]=== [2018-04-11 15:13:12,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1320460361, now seen corresponding path program 1 times [2018-04-11 15:13:12,482 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:12,482 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:12,482 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:12,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:13:12,482 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:12,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:12,493 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:12,496 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:13:12,496 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:13:12,496 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:13:12,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:13:12,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:12,526 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:13:12,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:13:12,542 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:12,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:12,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:12,553 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:12,553 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:17 [2018-04-11 15:13:12,568 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:12,569 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 15:13:12,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:12,576 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:12,576 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:12,576 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 15:13:12,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:12,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:12,584 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2018-04-11 15:13:12,622 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:12,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 41 [2018-04-11 15:13:12,630 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2018-04-11 15:13:12,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:13:12,648 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:56 [2018-04-11 15:13:12,672 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 50 treesize of output 47 [2018-04-11 15:13:12,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:13:12,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:12,686 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:12,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 43 [2018-04-11 15:13:12,720 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 15:13:12,720 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:12,729 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:12,754 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 43 treesize of output 40 [2018-04-11 15:13:12,764 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 15:13:12,764 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:12,771 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:12,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 36 [2018-04-11 15:13:12,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:12,792 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:12,798 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:12,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:13:12,814 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:94, output treesize:80 [2018-04-11 15:13:12,864 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 57 treesize of output 53 [2018-04-11 15:13:12,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 15:13:12,866 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:12,874 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:12,893 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 50 treesize of output 46 [2018-04-11 15:13:12,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 15:13:12,895 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:12,901 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:12,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:13:12,926 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:108, output treesize:86 [2018-04-11 15:13:12,987 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 36 treesize of output 30 [2018-04-11 15:13:12,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-11 15:13:12,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:12,994 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:13,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-04-11 15:13:13,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-11 15:13:13,010 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:13,020 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:13,033 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 2 xjuncts. [2018-04-11 15:13:13,033 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:83, output treesize:53 [2018-04-11 15:13:13,155 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 15:13:13,156 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:13:13,156 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-04-11 15:13:13,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 15:13:13,156 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 15:13:13,156 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-04-11 15:13:13,157 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand 18 states. [2018-04-11 15:13:13,773 WARN L151 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 92 DAG size of output 83 [2018-04-11 15:13:14,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:14,096 INFO L93 Difference]: Finished difference Result 125 states and 138 transitions. [2018-04-11 15:13:14,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 15:13:14,096 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 26 [2018-04-11 15:13:14,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:14,097 INFO L225 Difference]: With dead ends: 125 [2018-04-11 15:13:14,097 INFO L226 Difference]: Without dead ends: 125 [2018-04-11 15:13:14,097 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=122, Invalid=690, Unknown=0, NotChecked=0, Total=812 [2018-04-11 15:13:14,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-04-11 15:13:14,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 74. [2018-04-11 15:13:14,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-04-11 15:13:14,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2018-04-11 15:13:14,102 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 26 [2018-04-11 15:13:14,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:14,102 INFO L459 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2018-04-11 15:13:14,102 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 15:13:14,102 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2018-04-11 15:13:14,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-11 15:13:14,103 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:14,103 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:13:14,103 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr12RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr17RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr13RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr8RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr9RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr10RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr15RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr11RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr16RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr14RequiresViolation]=== [2018-04-11 15:13:14,103 INFO L82 PathProgramCache]: Analyzing trace with hash -2103211644, now seen corresponding path program 1 times [2018-04-11 15:13:14,103 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:14,103 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:14,104 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:14,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:13:14,104 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:14,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:14,113 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:14,118 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:13:14,119 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:13:14,119 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:13:14,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:13:14,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:14,144 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:13:14,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:13:14,148 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:14,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:14,149 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 15:13:14,156 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:14,159 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:14,160 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 15:13:14,160 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:14,166 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 15:13:14,166 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-04-11 15:13:14,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-04-11 15:13:14,192 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:14,198 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 15:13:14,199 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:20 [2018-04-11 15:13:14,209 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 15:13:14,210 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 15:13:14,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:14,212 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:14,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:13:14,220 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:28 [2018-04-11 15:13:14,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-04-11 15:13:14,240 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-11 15:13:14,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:14,243 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:14,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 15:13:14,249 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:35, output treesize:20 [2018-04-11 15:13:14,298 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 15:13:14,299 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:13:14,299 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-11 15:13:14,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 15:13:14,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 15:13:14,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-04-11 15:13:14,300 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand 11 states. [2018-04-11 15:13:14,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:14,503 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2018-04-11 15:13:14,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 15:13:14,541 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-04-11 15:13:14,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:14,541 INFO L225 Difference]: With dead ends: 79 [2018-04-11 15:13:14,541 INFO L226 Difference]: Without dead ends: 79 [2018-04-11 15:13:14,542 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2018-04-11 15:13:14,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-04-11 15:13:14,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 73. [2018-04-11 15:13:14,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-04-11 15:13:14,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2018-04-11 15:13:14,545 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 26 [2018-04-11 15:13:14,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:14,545 INFO L459 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2018-04-11 15:13:14,545 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 15:13:14,546 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2018-04-11 15:13:14,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-11 15:13:14,546 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:14,546 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:13:14,546 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr12RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr17RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr13RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr8RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr9RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr10RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr15RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr11RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr16RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr14RequiresViolation]=== [2018-04-11 15:13:14,547 INFO L82 PathProgramCache]: Analyzing trace with hash -2103211643, now seen corresponding path program 1 times [2018-04-11 15:13:14,547 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:14,547 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:14,547 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:14,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:13:14,548 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:14,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:14,557 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:14,560 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:13:14,561 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:13:14,561 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:13:14,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:13:14,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:14,592 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:13:14,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:14,603 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:14,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 15:13:14,610 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:14,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:14,615 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:13:14,630 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:14,631 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 15:13:14,632 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:14,639 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:14,640 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:14,640 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 15:13:14,640 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:14,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:14,645 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:13:14,659 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:14,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:13:14,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:13:14,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:13:14,671 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:27 [2018-04-11 15:13:14,686 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 28 treesize of output 25 [2018-04-11 15:13:14,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:13:14,688 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:14,695 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:14,714 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 33 treesize of output 30 [2018-04-11 15:13:14,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:14,716 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:14,723 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:14,737 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 29 treesize of output 26 [2018-04-11 15:13: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 8 treesize of output 7 [2018-04-11 15:13:14,739 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:14,743 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:14,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 21 [2018-04-11 15:13: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 15:13:14,756 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:14,759 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:14,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:13:14,773 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:62, output treesize:43 [2018-04-11 15:13:14,797 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 36 treesize of output 32 [2018-04-11 15:13:14,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-11 15:13:14,799 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:14,802 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:14,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-04-11 15:13:14,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 15:13:14,814 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:14,816 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:14,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2018-04-11 15:13:14,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 15:13:14,827 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:14,831 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:14,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-11 15:13:14,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 15:13:14,840 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:14,842 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:14,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 15:13:14,849 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:71, output treesize:24 [2018-04-11 15:13:14,901 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 15:13:14,901 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:13:14,901 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-11 15:13:14,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 15:13:14,901 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 15:13:14,901 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-04-11 15:13:14,902 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand 12 states. [2018-04-11 15:13:15,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:15,221 INFO L93 Difference]: Finished difference Result 141 states and 156 transitions. [2018-04-11 15:13:15,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 15:13:15,221 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-04-11 15:13:15,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:15,222 INFO L225 Difference]: With dead ends: 141 [2018-04-11 15:13:15,222 INFO L226 Difference]: Without dead ends: 141 [2018-04-11 15:13:15,223 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2018-04-11 15:13:15,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-04-11 15:13:15,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 73. [2018-04-11 15:13:15,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-04-11 15:13:15,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2018-04-11 15:13:15,226 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 26 [2018-04-11 15:13:15,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:15,226 INFO L459 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2018-04-11 15:13:15,226 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 15:13:15,226 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2018-04-11 15:13:15,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-11 15:13:15,227 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:15,227 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:13:15,227 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr12RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr17RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr13RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr8RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr9RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr10RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr15RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr11RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr16RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr14RequiresViolation]=== [2018-04-11 15:13:15,227 INFO L82 PathProgramCache]: Analyzing trace with hash 502811911, now seen corresponding path program 1 times [2018-04-11 15:13:15,227 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:15,227 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:15,228 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:15,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:13:15,228 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:15,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:15,237 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:15,239 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:13:15,239 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:13:15,240 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:13:15,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:13:15,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:15,262 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:13:15,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:15,267 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:15,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:15,274 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:15,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:15,280 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:13:15,296 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:15,298 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 15:13:15,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:15,308 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:15,309 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:15,309 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 15:13:15,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:15,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:15,315 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:13:15,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 18 [2018-04-11 15:13:15,339 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:13:15,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:15,348 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-04-11 15:13:15,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:13:15,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:13:15,363 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:15,365 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:15,374 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 15:13:15,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:15,377 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:15,379 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:15,385 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 15:13:15,385 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:33, output treesize:22 [2018-04-11 15:13:15,399 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 15:13:15,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-11 15:13:15,401 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:15,402 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:15,409 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 15:13:15,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 15:13:15,411 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:15,412 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:15,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:13:15,417 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:36, output treesize:14 [2018-04-11 15:13:15,463 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 15:13:15,463 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:13:15,463 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-11 15:13:15,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 15:13:15,464 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 15:13:15,464 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-04-11 15:13:15,464 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand 12 states. [2018-04-11 15:13:15,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:15,757 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2018-04-11 15:13:15,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 15:13:15,757 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2018-04-11 15:13:15,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:15,758 INFO L225 Difference]: With dead ends: 79 [2018-04-11 15:13:15,758 INFO L226 Difference]: Without dead ends: 79 [2018-04-11 15:13:15,759 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2018-04-11 15:13:15,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-04-11 15:13:15,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 55. [2018-04-11 15:13:15,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-04-11 15:13:15,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2018-04-11 15:13:15,761 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 26 [2018-04-11 15:13:15,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:15,761 INFO L459 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2018-04-11 15:13:15,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 15:13:15,761 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2018-04-11 15:13:15,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 15:13:15,762 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:15,762 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:13:15,762 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr12RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr17RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr13RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr8RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr9RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr10RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr15RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr11RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr16RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr14RequiresViolation]=== [2018-04-11 15:13:15,762 INFO L82 PathProgramCache]: Analyzing trace with hash -551009024, now seen corresponding path program 1 times [2018-04-11 15:13:15,762 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:15,762 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:15,763 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:15,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:13:15,763 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:15,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:15,769 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:15,798 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 15:13:15,798 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:13:15,798 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 15:13:15,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:13:15,799 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:13:15,799 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:13:15,799 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand 5 states. [2018-04-11 15:13:15,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:15,835 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2018-04-11 15:13:15,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 15:13:15,835 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-04-11 15:13:15,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:15,837 INFO L225 Difference]: With dead ends: 79 [2018-04-11 15:13:15,837 INFO L226 Difference]: Without dead ends: 79 [2018-04-11 15:13:15,837 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:13:15,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-04-11 15:13:15,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 67. [2018-04-11 15:13:15,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-04-11 15:13:15,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2018-04-11 15:13:15,841 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 30 [2018-04-11 15:13:15,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:15,841 INFO L459 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2018-04-11 15:13:15,841 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:13:15,841 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2018-04-11 15:13:15,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 15:13:15,842 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:15,842 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:13:15,842 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr12RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr17RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr13RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr8RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr9RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr10RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr15RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr11RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr16RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr14RequiresViolation]=== [2018-04-11 15:13:15,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1938519938, now seen corresponding path program 1 times [2018-04-11 15:13:15,842 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:15,842 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:15,843 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:15,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:13:15,843 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:15,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:15,852 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:15,894 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 15:13:15,894 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:13:15,894 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 15:13:15,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 15:13:15,894 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 15:13:15,894 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:13:15,894 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand 6 states. [2018-04-11 15:13:15,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:15,917 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2018-04-11 15:13:15,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:13:15,917 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-04-11 15:13:15,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:15,918 INFO L225 Difference]: With dead ends: 72 [2018-04-11 15:13:15,918 INFO L226 Difference]: Without dead ends: 66 [2018-04-11 15:13:15,918 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-04-11 15:13:15,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-04-11 15:13:15,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 55. [2018-04-11 15:13:15,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-04-11 15:13:15,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-04-11 15:13:15,921 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 30 [2018-04-11 15:13:15,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:15,921 INFO L459 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-04-11 15:13:15,921 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 15:13:15,921 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-04-11 15:13:15,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-11 15:13:15,922 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:15,922 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] [2018-04-11 15:13:15,922 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr12RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr17RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr13RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr8RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr9RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr10RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr15RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr11RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr16RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr14RequiresViolation]=== [2018-04-11 15:13:15,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1331085243, now seen corresponding path program 1 times [2018-04-11 15:13:15,922 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:15,922 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:15,923 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:15,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:13:15,923 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:15,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:15,929 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:15,962 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 15:13:15,962 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:13:15,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 15:13:15,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 15:13:15,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 15:13:15,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:13:15,963 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 6 states. [2018-04-11 15:13:16,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:16,046 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2018-04-11 15:13:16,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:13:16,047 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-04-11 15:13:16,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:16,047 INFO L225 Difference]: With dead ends: 99 [2018-04-11 15:13:16,047 INFO L226 Difference]: Without dead ends: 99 [2018-04-11 15:13:16,047 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-04-11 15:13:16,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-04-11 15:13:16,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 88. [2018-04-11 15:13:16,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-04-11 15:13:16,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2018-04-11 15:13:16,049 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 31 [2018-04-11 15:13:16,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:16,050 INFO L459 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2018-04-11 15:13:16,050 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 15:13:16,050 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2018-04-11 15:13:16,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-11 15:13:16,050 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:16,050 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] [2018-04-11 15:13:16,050 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr12RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr17RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr13RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr8RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr9RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr10RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr15RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr11RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr16RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr14RequiresViolation]=== [2018-04-11 15:13:16,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1197071737, now seen corresponding path program 1 times [2018-04-11 15:13:16,051 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:16,051 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:16,051 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:16,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:13:16,052 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:16,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:16,062 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:16,156 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 15:13:16,157 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:13:16,157 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-11 15:13:16,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 15:13:16,157 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 15:13:16,158 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-04-11 15:13:16,158 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand 11 states. [2018-04-11 15:13:16,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:16,285 INFO L93 Difference]: Finished difference Result 160 states and 172 transitions. [2018-04-11 15:13:16,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 15:13:16,285 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 31 [2018-04-11 15:13:16,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:16,286 INFO L225 Difference]: With dead ends: 160 [2018-04-11 15:13:16,286 INFO L226 Difference]: Without dead ends: 160 [2018-04-11 15:13:16,286 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2018-04-11 15:13:16,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-04-11 15:13:16,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 120. [2018-04-11 15:13:16,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-04-11 15:13:16,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 132 transitions. [2018-04-11 15:13:16,289 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 132 transitions. Word has length 31 [2018-04-11 15:13:16,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:16,290 INFO L459 AbstractCegarLoop]: Abstraction has 120 states and 132 transitions. [2018-04-11 15:13:16,290 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 15:13:16,290 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 132 transitions. [2018-04-11 15:13:16,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-11 15:13:16,290 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:16,291 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] [2018-04-11 15:13:16,291 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr12RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr17RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr13RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr8RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr9RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr10RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr15RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr11RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr16RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr14RequiresViolation]=== [2018-04-11 15:13:16,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1337620347, now seen corresponding path program 1 times [2018-04-11 15:13:16,291 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:16,291 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:16,292 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:16,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:13:16,292 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:16,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:16,306 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:16,315 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:13:16,315 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:13:16,316 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:13:16,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:13:16,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:16,349 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:13:16,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:16,353 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:16,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:16,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:16,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:16,364 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:13:16,379 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 16 treesize of output 13 [2018-04-11 15:13:16,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:13:16,381 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:16,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:16,385 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:16,385 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-04-11 15:13:16,402 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:16,402 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:16,403 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 15:13:16,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:16,410 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 26 treesize of output 29 [2018-04-11 15:13:16,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:16,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 15:13:16,416 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:35 [2018-04-11 15:13:16,492 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 18 [2018-04-11 15:13:16,500 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 18 treesize of output 15 [2018-04-11 15:13:16,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:13:16,504 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:13:16,518 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 2 xjuncts. [2018-04-11 15:13:16,519 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:64 [2018-04-11 15:13:16,637 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:13:16,637 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:13:16,637 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-11 15:13:16,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 15:13:16,638 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 15:13:16,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-04-11 15:13:16,638 INFO L87 Difference]: Start difference. First operand 120 states and 132 transitions. Second operand 13 states. [2018-04-11 15:13:17,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:17,190 INFO L93 Difference]: Finished difference Result 140 states and 155 transitions. [2018-04-11 15:13:17,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 15:13:17,190 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2018-04-11 15:13:17,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:17,191 INFO L225 Difference]: With dead ends: 140 [2018-04-11 15:13:17,191 INFO L226 Difference]: Without dead ends: 140 [2018-04-11 15:13:17,192 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2018-04-11 15:13:17,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-04-11 15:13:17,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 125. [2018-04-11 15:13:17,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-04-11 15:13:17,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 139 transitions. [2018-04-11 15:13:17,196 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 139 transitions. Word has length 31 [2018-04-11 15:13:17,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:17,196 INFO L459 AbstractCegarLoop]: Abstraction has 125 states and 139 transitions. [2018-04-11 15:13:17,196 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 15:13:17,196 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 139 transitions. [2018-04-11 15:13:17,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 15:13:17,197 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:17,197 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:13:17,197 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr12RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr17RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr13RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr8RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr9RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr10RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr15RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr11RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr16RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr14RequiresViolation]=== [2018-04-11 15:13:17,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1927634698, now seen corresponding path program 1 times [2018-04-11 15:13:17,197 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:17,197 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:17,198 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:17,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:13:17,198 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:17,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:17,206 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:17,238 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 15:13:17,238 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:13:17,238 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 15:13:17,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:13:17,238 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:13:17,239 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:13:17,239 INFO L87 Difference]: Start difference. First operand 125 states and 139 transitions. Second operand 5 states. [2018-04-11 15:13:17,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:17,289 INFO L93 Difference]: Finished difference Result 124 states and 136 transitions. [2018-04-11 15:13:17,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:13:17,289 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-04-11 15:13:17,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:17,290 INFO L225 Difference]: With dead ends: 124 [2018-04-11 15:13:17,290 INFO L226 Difference]: Without dead ends: 124 [2018-04-11 15:13:17,291 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-11 15:13:17,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-04-11 15:13:17,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-04-11 15:13:17,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-04-11 15:13:17,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 136 transitions. [2018-04-11 15:13:17,294 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 136 transitions. Word has length 32 [2018-04-11 15:13:17,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:17,294 INFO L459 AbstractCegarLoop]: Abstraction has 124 states and 136 transitions. [2018-04-11 15:13:17,294 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:13:17,295 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 136 transitions. [2018-04-11 15:13:17,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 15:13:17,295 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:17,295 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:13:17,295 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr12RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr17RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr13RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr8RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr9RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr10RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr15RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr11RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr16RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr14RequiresViolation]=== [2018-04-11 15:13:17,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1927634699, now seen corresponding path program 1 times [2018-04-11 15:13:17,295 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:17,296 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:17,296 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:17,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:13:17,296 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:17,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:17,304 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:17,351 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 15:13:17,352 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:13:17,352 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 15:13:17,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 15:13:17,352 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 15:13:17,352 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:13:17,353 INFO L87 Difference]: Start difference. First operand 124 states and 136 transitions. Second operand 6 states. [2018-04-11 15:13:17,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:17,392 INFO L93 Difference]: Finished difference Result 158 states and 167 transitions. [2018-04-11 15:13:17,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:13:17,393 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-04-11 15:13:17,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:17,394 INFO L225 Difference]: With dead ends: 158 [2018-04-11 15:13:17,394 INFO L226 Difference]: Without dead ends: 158 [2018-04-11 15:13:17,394 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-04-11 15:13:17,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-04-11 15:13:17,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 151. [2018-04-11 15:13:17,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-04-11 15:13:17,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 161 transitions. [2018-04-11 15:13:17,397 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 161 transitions. Word has length 32 [2018-04-11 15:13:17,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:17,397 INFO L459 AbstractCegarLoop]: Abstraction has 151 states and 161 transitions. [2018-04-11 15:13:17,397 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 15:13:17,398 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 161 transitions. [2018-04-11 15:13:17,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 15:13:17,398 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:17,398 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:13:17,398 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr12RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr17RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr13RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr8RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr9RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr10RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr15RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr11RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr16RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr14RequiresViolation]=== [2018-04-11 15:13:17,398 INFO L82 PathProgramCache]: Analyzing trace with hash 2068183309, now seen corresponding path program 1 times [2018-04-11 15:13:17,398 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:17,399 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:17,399 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:17,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:13:17,399 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:17,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:17,409 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:17,412 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:13:17,412 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:13:17,413 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:13:17,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:13:17,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:17,460 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:13:17,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:17,466 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:17,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 15:13:17,473 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:17,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:17,478 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:13:17,497 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:17,499 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 15:13:17,499 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:17,510 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:17,510 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:17,511 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 15:13:17,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:17,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:17,518 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:13:17,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:13:17,539 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:13:17,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:13:17,547 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:33 [2018-04-11 15:13:17,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 36 [2018-04-11 15:13:17,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:17,565 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:17,570 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:17,587 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 34 treesize of output 31 [2018-04-11 15:13:17,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:13:17,588 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:17,594 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:17,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2018-04-11 15:13:17,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:13:17,614 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:17,618 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:17,638 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 35 treesize of output 32 [2018-04-11 15:13:17,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:13:17,640 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:17,646 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:17,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:13:17,657 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:74, output treesize:49 [2018-04-11 15:13:17,686 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 35 [2018-04-11 15:13:17,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-11 15:13:17,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:17,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:17,704 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 28 treesize of output 24 [2018-04-11 15:13:17,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 15:13:17,705 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:17,708 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:17,718 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 37 treesize of output 33 [2018-04-11 15:13:17,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 15:13:17,720 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:17,724 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:17,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-04-11 15:13:17,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 15:13:17,735 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:17,738 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:17,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 15:13:17,745 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:77, output treesize:30 [2018-04-11 15:13:17,903 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 15:13:17,904 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:13:17,904 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-04-11 15:13:17,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 15:13:17,904 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 15:13:17,904 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-04-11 15:13:17,904 INFO L87 Difference]: Start difference. First operand 151 states and 161 transitions. Second operand 16 states. [2018-04-11 15:13:18,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:18,694 INFO L93 Difference]: Finished difference Result 162 states and 174 transitions. [2018-04-11 15:13:18,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 15:13:18,694 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 32 [2018-04-11 15:13:18,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:18,695 INFO L225 Difference]: With dead ends: 162 [2018-04-11 15:13:18,695 INFO L226 Difference]: Without dead ends: 162 [2018-04-11 15:13:18,696 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=93, Invalid=609, Unknown=0, NotChecked=0, Total=702 [2018-04-11 15:13:18,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-04-11 15:13:18,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2018-04-11 15:13:18,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-04-11 15:13:18,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 172 transitions. [2018-04-11 15:13:18,699 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 172 transitions. Word has length 32 [2018-04-11 15:13:18,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:18,699 INFO L459 AbstractCegarLoop]: Abstraction has 160 states and 172 transitions. [2018-04-11 15:13:18,699 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 15:13:18,699 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 172 transitions. [2018-04-11 15:13:18,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 15:13:18,699 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:18,699 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] [2018-04-11 15:13:18,699 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr12RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr17RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr13RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr8RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr9RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr10RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr15RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr11RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr16RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr14RequiresViolation]=== [2018-04-11 15:13:18,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1483442203, now seen corresponding path program 1 times [2018-04-11 15:13:18,700 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:18,700 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:18,700 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:18,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:13:18,700 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:18,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:18,709 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:18,717 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:13:18,717 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:13:18,717 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:13:18,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:13:18,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:18,738 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:13:18,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:18,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:18,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:18,807 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:18,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:18,810 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:13:18,825 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:18,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 12 treesize of output 15 [2018-04-11 15:13:18,826 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:18,837 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:18,838 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:18,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 15:13:18,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:18,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:18,845 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:13:18,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:13:18,869 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:13:18,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:13:18,877 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:33 [2018-04-11 15:13:18,894 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 31 treesize of output 28 [2018-04-11 15:13:18,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:18,895 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:18,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:18,918 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 36 treesize of output 33 [2018-04-11 15:13:18,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:18,920 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:18,926 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:18,941 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 27 treesize of output 24 [2018-04-11 15:13:18,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:18,943 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:18,948 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:18,984 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 32 treesize of output 29 [2018-04-11 15:13:18,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:18,986 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:18,992 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:19,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:13:19,004 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:68, output treesize:49 [2018-04-11 15:13:19,068 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 37 treesize of output 33 [2018-04-11 15:13:19,070 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 15:13:19,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:19,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:19,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-04-11 15:13:19,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 15:13:19,096 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:19,101 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:19,117 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 35 [2018-04-11 15:13:19,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 15:13:19,119 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:19,125 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:19,141 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 28 treesize of output 24 [2018-04-11 15:13:19,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-11 15:13:19,143 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:19,148 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:19,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 15:13:19,158 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:77, output treesize:30 [2018-04-11 15:13:19,355 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 15:13:19,356 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:13:19,356 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 15:13:19,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 15:13:19,356 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 15:13:19,356 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-04-11 15:13:19,356 INFO L87 Difference]: Start difference. First operand 160 states and 172 transitions. Second operand 17 states. [2018-04-11 15:13:20,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:20,125 INFO L93 Difference]: Finished difference Result 162 states and 175 transitions. [2018-04-11 15:13:20,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 15:13:20,127 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-04-11 15:13:20,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:20,128 INFO L225 Difference]: With dead ends: 162 [2018-04-11 15:13:20,128 INFO L226 Difference]: Without dead ends: 162 [2018-04-11 15:13:20,128 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=95, Invalid=661, Unknown=0, NotChecked=0, Total=756 [2018-04-11 15:13:20,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-04-11 15:13:20,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2018-04-11 15:13:20,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-04-11 15:13:20,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 173 transitions. [2018-04-11 15:13:20,130 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 173 transitions. Word has length 32 [2018-04-11 15:13:20,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:20,130 INFO L459 AbstractCegarLoop]: Abstraction has 161 states and 173 transitions. [2018-04-11 15:13:20,130 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 15:13:20,130 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 173 transitions. [2018-04-11 15:13:20,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-11 15:13:20,131 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:20,131 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:13:20,131 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr12RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr17RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr13RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr8RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr9RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr10RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr15RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr11RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr16RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr14RequiresViolation]=== [2018-04-11 15:13:20,131 INFO L82 PathProgramCache]: Analyzing trace with hash -972656883, now seen corresponding path program 1 times [2018-04-11 15:13:20,131 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:20,131 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:20,132 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:20,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:13:20,132 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:20,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:20,142 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:20,146 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:13:20,146 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:13:20,146 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:13:20,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:13:20,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:20,171 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:13:20,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:20,176 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:20,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 15:13:20,180 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:20,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:20,184 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:13:20,197 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:20,198 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:20,198 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 15:13:20,199 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:20,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:13:20,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:20,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:20,210 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:13:20,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 18 [2018-04-11 15:13:20,246 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:13:20,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:13:20,259 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:33 [2018-04-11 15:13:20,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 36 [2018-04-11 15:13:20,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 8 treesize of output 7 [2018-04-11 15:13:20,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:20,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:20,325 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 34 treesize of output 31 [2018-04-11 15:13:20,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:13:20,327 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:20,335 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:20,359 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 35 treesize of output 32 [2018-04-11 15:13:20,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:20,360 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:20,366 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:20,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2018-04-11 15:13:20,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:20,385 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:20,390 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:20,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:13:20,419 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:74, output treesize:49 [2018-04-11 15:13:20,468 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 35 [2018-04-11 15:13:20,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-11 15:13:20,469 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:20,474 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:20,488 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 28 treesize of output 24 [2018-04-11 15:13:20,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 15:13:20,498 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:20,511 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:20,527 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 37 treesize of output 33 [2018-04-11 15:13:20,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 15:13:20,529 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:20,536 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:20,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-04-11 15:13:20,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 15:13:20,553 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:20,557 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:20,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 15:13:20,570 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:77, output treesize:30 [2018-04-11 15:13:20,858 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:13:20,858 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:13:20,858 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-11 15:13:20,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 15:13:20,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 15:13:20,859 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2018-04-11 15:13:20,859 INFO L87 Difference]: Start difference. First operand 161 states and 173 transitions. Second operand 18 states. [2018-04-11 15:13:21,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:21,864 INFO L93 Difference]: Finished difference Result 173 states and 187 transitions. [2018-04-11 15:13:21,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-11 15:13:21,864 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 37 [2018-04-11 15:13:21,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:21,864 INFO L225 Difference]: With dead ends: 173 [2018-04-11 15:13:21,864 INFO L226 Difference]: Without dead ends: 173 [2018-04-11 15:13:21,865 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=105, Invalid=825, Unknown=0, NotChecked=0, Total=930 [2018-04-11 15:13:21,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-04-11 15:13:21,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2018-04-11 15:13:21,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-04-11 15:13:21,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 185 transitions. [2018-04-11 15:13:21,868 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 185 transitions. Word has length 37 [2018-04-11 15:13:21,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:21,868 INFO L459 AbstractCegarLoop]: Abstraction has 171 states and 185 transitions. [2018-04-11 15:13:21,868 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 15:13:21,868 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 185 transitions. [2018-04-11 15:13:21,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-11 15:13:21,869 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:21,869 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:13:21,869 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr12RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr17RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr13RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr8RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr9RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr10RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr15RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr11RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr16RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr14RequiresViolation]=== [2018-04-11 15:13:21,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1912838307, now seen corresponding path program 2 times [2018-04-11 15:13:21,870 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:21,870 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:21,870 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:21,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:13:21,870 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:21,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:21,883 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:21,888 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:13:21,888 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:13:21,888 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:13:21,888 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:13:21,938 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:13:21,938 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:13:21,942 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:13:21,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:21,945 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:21,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:21,947 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 15:13:21,953 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:21,954 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:21,955 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 15:13:21,955 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:21,963 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 15:13:21,963 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:21,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:21,969 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-04-11 15:13:21,991 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 16 treesize of output 13 [2018-04-11 15:13:21,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:13:21,993 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:21,994 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:22,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:22,002 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2018-04-11 15:13:22,036 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:22,037 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 26 treesize of output 29 [2018-04-11 15:13:22,037 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:22,053 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:22,054 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:22,055 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:22,055 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 15:13:22,056 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:22,065 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 15:13:22,065 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:43 [2018-04-11 15:13:22,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:13:22,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:13:22,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:22,086 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:22,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:13:22,097 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:51 [2018-04-11 15:13:22,180 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 24 treesize of output 18 [2018-04-11 15:13:22,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-04-11 15:13:22,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:22,185 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:22,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 15:13:22,193 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:58, output treesize:43 [2018-04-11 15:13:22,275 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 33 treesize of output 34 [2018-04-11 15:13:22,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:22,277 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:22,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:22,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-11 15:13:22,297 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:68, output treesize:64 [2018-04-11 15:13:22,429 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 45 treesize of output 39 [2018-04-11 15:13:22,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-04-11 15:13:22,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:22,451 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:22,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 39 [2018-04-11 15:13:22,457 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 15:13:22,464 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:13:22,480 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 2 xjuncts. [2018-04-11 15:13:22,480 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:83, output treesize:109 [2018-04-11 15:13:22,641 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:13:22,642 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:13:22,642 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-11 15:13:22,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 15:13:22,642 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 15:13:22,642 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=415, Unknown=0, NotChecked=0, Total=462 [2018-04-11 15:13:22,642 INFO L87 Difference]: Start difference. First operand 171 states and 185 transitions. Second operand 22 states. [2018-04-11 15:13:23,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:23,524 INFO L93 Difference]: Finished difference Result 197 states and 214 transitions. [2018-04-11 15:13:23,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 15:13:23,524 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 37 [2018-04-11 15:13:23,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:23,524 INFO L225 Difference]: With dead ends: 197 [2018-04-11 15:13:23,524 INFO L226 Difference]: Without dead ends: 197 [2018-04-11 15:13:23,525 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=144, Invalid=1116, Unknown=0, NotChecked=0, Total=1260 [2018-04-11 15:13:23,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-04-11 15:13:23,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 176. [2018-04-11 15:13:23,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-04-11 15:13:23,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 192 transitions. [2018-04-11 15:13:23,529 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 192 transitions. Word has length 37 [2018-04-11 15:13:23,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:23,529 INFO L459 AbstractCegarLoop]: Abstraction has 176 states and 192 transitions. [2018-04-11 15:13:23,529 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 15:13:23,530 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 192 transitions. [2018-04-11 15:13:23,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 15:13:23,530 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:23,530 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:13:23,530 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr12RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr17RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr13RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr8RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr9RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr10RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr15RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr11RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr16RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr14RequiresViolation]=== [2018-04-11 15:13:23,530 INFO L82 PathProgramCache]: Analyzing trace with hash 150252457, now seen corresponding path program 1 times [2018-04-11 15:13:23,531 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:23,531 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:23,531 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:23,531 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:13:23,531 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:23,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:23,542 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:23,545 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:13:23,545 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:13:23,545 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:13:23,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:13:23,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:23,588 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:13:23,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:23,593 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:23,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:13:23,599 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:23,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:23,605 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:13:23,623 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:23,624 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 15:13:23,625 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:23,635 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:23,635 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:23,636 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 15:13:23,636 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:23,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:23,643 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:13:23,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 18 [2018-04-11 15:13:23,665 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:13:23,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:13:23,677 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:33 [2018-04-11 15:13:23,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 36 [2018-04-11 15:13:23,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 15:13:23,701 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:23,709 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:23,737 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 34 treesize of output 31 [2018-04-11 15:13:23,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:23,739 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:23,746 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:23,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2018-04-11 15:13:23,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:23,772 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:23,778 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:23,799 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 35 treesize of output 32 [2018-04-11 15:13:23,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:23,816 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:23,824 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:23,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:13:23,843 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:74, output treesize:49 [2018-04-11 15:13:23,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-04-11 15:13:23,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 15:13:23,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:23,895 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:23,911 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 35 [2018-04-11 15:13:23,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-11 15:13:23,912 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:23,917 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:23,930 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 28 treesize of output 24 [2018-04-11 15:13:23,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 15:13:23,932 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:23,937 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:23,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-04-11 15:13:23,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 15:13:23,951 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:23,954 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:23,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 15:13:23,964 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:77, output treesize:30 [2018-04-11 15:13:24,268 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:13:24,268 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:13:24,268 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-11 15:13:24,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 15:13:24,269 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 15:13:24,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2018-04-11 15:13:24,269 INFO L87 Difference]: Start difference. First operand 176 states and 192 transitions. Second operand 19 states. [2018-04-11 15:13:25,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:25,501 INFO L93 Difference]: Finished difference Result 182 states and 199 transitions. [2018-04-11 15:13:25,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 15:13:25,501 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 38 [2018-04-11 15:13:25,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:25,502 INFO L225 Difference]: With dead ends: 182 [2018-04-11 15:13:25,502 INFO L226 Difference]: Without dead ends: 182 [2018-04-11 15:13:25,503 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=111, Invalid=945, Unknown=0, NotChecked=0, Total=1056 [2018-04-11 15:13:25,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-04-11 15:13:25,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 177. [2018-04-11 15:13:25,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-04-11 15:13:25,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 193 transitions. [2018-04-11 15:13:25,506 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 193 transitions. Word has length 38 [2018-04-11 15:13:25,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:25,506 INFO L459 AbstractCegarLoop]: Abstraction has 177 states and 193 transitions. [2018-04-11 15:13:25,506 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 15:13:25,506 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 193 transitions. [2018-04-11 15:13:25,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 15:13:25,507 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:25,507 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:13:25,507 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr12RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr17RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr13RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr8RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr9RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr10RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr15RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr11RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr16RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr14RequiresViolation]=== [2018-04-11 15:13:25,507 INFO L82 PathProgramCache]: Analyzing trace with hash 831554627, now seen corresponding path program 2 times [2018-04-11 15:13:25,507 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:25,507 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:25,507 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:25,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:13:25,508 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:25,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:25,517 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:25,520 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:13:25,520 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:13:25,521 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:13:25,521 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:13:25,558 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:13:25,558 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:13:25,561 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:13:25,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:25,566 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:25,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:25,572 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:25,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:25,577 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:13:25,595 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:25,596 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 15:13:25,596 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:25,606 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:25,607 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:25,607 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 15:13:25,608 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:25,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:25,613 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:13:25,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 18 [2018-04-11 15:13:25,636 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:13:25,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 15:13:25,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:25,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:13:25,663 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:33 [2018-04-11 15:13:25,687 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 34 treesize of output 31 [2018-04-11 15:13:25,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:25,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:25,697 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:25,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 30 treesize of output 27 [2018-04-11 15:13:25,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:25,727 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:25,733 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:25,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 36 [2018-04-11 15:13:25,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:13:25,757 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:25,764 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:25,779 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 35 treesize of output 32 [2018-04-11 15:13:25,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:13:25,781 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:25,787 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:25,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:13:25,799 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:74, output treesize:49 [2018-04-11 15:13:25,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-04-11 15:13:25,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 15:13:25,842 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:25,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:25,861 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 35 [2018-04-11 15:13:25,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-11 15:13:25,862 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:25,867 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:25,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-04-11 15:13:25,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 15:13:25,882 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:25,886 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:25,898 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 28 treesize of output 24 [2018-04-11 15:13:25,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 15:13:25,900 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:25,903 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:25,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 15:13:25,913 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:77, output treesize:30 [2018-04-11 15:13:26,282 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:13:26,282 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:13:26,282 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-11 15:13:26,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 15:13:26,283 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 15:13:26,283 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2018-04-11 15:13:26,283 INFO L87 Difference]: Start difference. First operand 177 states and 193 transitions. Second operand 20 states. [2018-04-11 15:13:27,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:27,531 INFO L93 Difference]: Finished difference Result 181 states and 198 transitions. [2018-04-11 15:13:27,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 15:13:27,532 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2018-04-11 15:13:27,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:27,532 INFO L225 Difference]: With dead ends: 181 [2018-04-11 15:13:27,532 INFO L226 Difference]: Without dead ends: 181 [2018-04-11 15:13:27,533 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=122, Invalid=1068, Unknown=0, NotChecked=0, Total=1190 [2018-04-11 15:13:27,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-04-11 15:13:27,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 178. [2018-04-11 15:13:27,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-04-11 15:13:27,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 194 transitions. [2018-04-11 15:13:27,535 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 194 transitions. Word has length 38 [2018-04-11 15:13:27,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:27,535 INFO L459 AbstractCegarLoop]: Abstraction has 178 states and 194 transitions. [2018-04-11 15:13:27,535 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 15:13:27,535 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 194 transitions. [2018-04-11 15:13:27,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-11 15:13:27,536 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:27,536 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:13:27,536 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr12RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr17RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr13RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr8RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr9RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr10RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr15RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr11RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr16RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr14RequiresViolation]=== [2018-04-11 15:13:27,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1950848603, now seen corresponding path program 1 times [2018-04-11 15:13:27,536 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:27,536 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:27,536 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:27,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:13:27,537 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:27,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:27,543 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:27,547 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:13:27,547 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:13:27,547 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:13:27,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:13:27,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:27,561 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:13:27,581 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpy_~#dst.base| Int)) (and (= (store |c_old(#valid)| |__U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpy_~#dst.base| 0) |c_#valid|) (= 0 (select |c_old(#valid)| |__U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpy_~#dst.base|)))) is different from true [2018-04-11 15:13:27,596 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpy_~#dst.base| Int) (|main_#t~malloc13.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc13.base| 1))) (let ((.cse1 (store .cse0 |c_main_#t~malloc14.base| 1))) (and (= (select .cse0 |c_main_#t~malloc14.base|) 0) (= 0 (select |c_old(#valid)| |main_#t~malloc13.base|)) (= (store (store .cse1 |__U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpy_~#dst.base| 0) |main_#t~malloc13.base| 0) |c_#valid|) (= (select .cse1 |__U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpy_~#dst.base|) 0))))) is different from true [2018-04-11 15:13:27,613 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|__U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpy_~#dst.base| Int) (|main_#t~malloc13.base| Int) (|main_#t~malloc14.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc13.base| 1))) (let ((.cse1 (store .cse0 |main_#t~malloc14.base| 1))) (and (= (select .cse0 |main_#t~malloc14.base|) 0) (= |c_#valid| (store (store (store .cse1 |__U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpy_~#dst.base| 0) |main_#t~malloc13.base| 0) |main_#t~malloc14.base| 0)) (= 0 (select |c_old(#valid)| |main_#t~malloc13.base|)) (= (select .cse1 |__U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpy_~#dst.base|) 0))))) is different from true [2018-04-11 15:13:27,617 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 15:13:27,617 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:13:27,617 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-11 15:13:27,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 15:13:27,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 15:13:27,617 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=33, Unknown=3, NotChecked=36, Total=90 [2018-04-11 15:13:27,617 INFO L87 Difference]: Start difference. First operand 178 states and 194 transitions. Second operand 10 states. [2018-04-11 15:13:27,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:27,716 INFO L93 Difference]: Finished difference Result 177 states and 193 transitions. [2018-04-11 15:13:27,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 15:13:27,716 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2018-04-11 15:13:27,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:27,717 INFO L225 Difference]: With dead ends: 177 [2018-04-11 15:13:27,717 INFO L226 Difference]: Without dead ends: 99 [2018-04-11 15:13:27,717 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=43, Unknown=4, NotChecked=42, Total=110 [2018-04-11 15:13:27,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-04-11 15:13:27,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 84. [2018-04-11 15:13:27,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-04-11 15:13:27,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2018-04-11 15:13:27,719 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 41 [2018-04-11 15:13:27,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:27,720 INFO L459 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2018-04-11 15:13:27,720 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 15:13:27,720 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2018-04-11 15:13:27,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-11 15:13:27,720 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:27,720 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:13:27,720 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr12RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr17RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr13RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr8RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr9RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr10RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr15RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr11RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr16RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr14RequiresViolation]=== [2018-04-11 15:13:27,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1893746419, now seen corresponding path program 2 times [2018-04-11 15:13:27,721 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:27,721 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:27,721 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:27,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:13:27,721 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:27,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:27,736 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:27,740 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:13:27,740 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:13:27,740 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:13:27,741 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:13:27,786 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:13:27,787 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:13:27,790 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:13:27,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:13:27,794 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:27,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:13:27,800 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:27,805 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:27,805 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:13:27,822 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:27,823 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 15:13:27,823 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:27,833 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:27,834 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:27,834 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 15:13:27,835 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:27,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:27,841 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:13:27,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:13:27,863 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:13:27,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:13:27,874 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:33 [2018-04-11 15:13:27,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 36 [2018-04-11 15:13:27,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:27,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:27,906 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:27,933 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 34 treesize of output 31 [2018-04-11 15:13:27,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:27,936 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:27,944 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:27,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2018-04-11 15:13:27,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:13:27,966 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:27,970 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:27,985 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 35 treesize of output 32 [2018-04-11 15:13:27,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:27,986 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:27,992 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:28,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:13:28,004 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:74, output treesize:49 [2018-04-11 15:13:28,042 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 35 [2018-04-11 15:13:28,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 13 treesize of output 5 [2018-04-11 15:13:28,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:28,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:28,064 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 28 treesize of output 24 [2018-04-11 15:13:28,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 15:13:28,065 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:28,069 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:28,082 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 37 treesize of output 33 [2018-04-11 15:13:28,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 15:13:28,084 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:28,089 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:28,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-04-11 15:13:28,101 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 15:13:28,102 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:28,105 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:28,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 15:13:28,115 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:77, output treesize:30 [2018-04-11 15:13:28,501 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:13:28,502 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:13:28,502 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-11 15:13:28,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 15:13:28,502 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 15:13:28,502 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2018-04-11 15:13:28,502 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand 20 states. [2018-04-11 15:13:29,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:29,845 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2018-04-11 15:13:29,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 15:13:29,845 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 42 [2018-04-11 15:13:29,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:29,846 INFO L225 Difference]: With dead ends: 94 [2018-04-11 15:13:29,846 INFO L226 Difference]: Without dead ends: 94 [2018-04-11 15:13:29,846 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=122, Invalid=1068, Unknown=0, NotChecked=0, Total=1190 [2018-04-11 15:13:29,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-04-11 15:13:29,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 89. [2018-04-11 15:13:29,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-04-11 15:13:29,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2018-04-11 15:13:29,848 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 42 [2018-04-11 15:13:29,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:29,848 INFO L459 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2018-04-11 15:13:29,848 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 15:13:29,848 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2018-04-11 15:13:29,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 15:13:29,848 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:29,848 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:13:29,849 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr12RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr17RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr13RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr8RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr9RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr10RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr15RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr11RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr16RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr14RequiresViolation]=== [2018-04-11 15:13:29,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1575681521, now seen corresponding path program 1 times [2018-04-11 15:13:29,849 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:29,849 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:29,849 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:29,849 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:13:29,849 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:29,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:29,858 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:29,860 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:13:29,861 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:13:29,861 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:13:29,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:13:29,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:29,887 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:13:29,913 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:29,914 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:29,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:29,920 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:29,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:29,924 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:13:29,941 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:29,943 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 15:13:29,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:29,954 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:29,955 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:29,955 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 15:13:29,956 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:29,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:13:29,965 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:26 [2018-04-11 15:13:29,993 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:29,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:13:29,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:30,007 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:30,008 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:30,009 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:30,010 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 15:13:30,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:30,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:30,018 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:21 [2018-04-11 15:13:30,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:13:30,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:30,035 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:30,037 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:30,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:13:30,051 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 15:13:30,051 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:30,053 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:30,070 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 15:13:30,070 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:43, output treesize:33 [2018-04-11 15:13:30,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-04-11 15:13:30,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-11 15:13:30,102 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:30,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:30,114 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 15 treesize of output 11 [2018-04-11 15:13:30,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 15:13:30,116 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:30,117 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:30,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:13:30,123 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:21 [2018-04-11 15:13:30,480 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:13:30,481 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:13:30,481 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-11 15:13:30,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 15:13:30,481 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 15:13:30,481 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2018-04-11 15:13:30,481 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 21 states. [2018-04-11 15:13:31,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:31,431 INFO L93 Difference]: Finished difference Result 99 states and 103 transitions. [2018-04-11 15:13:31,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 15:13:31,431 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 43 [2018-04-11 15:13:31,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:31,432 INFO L225 Difference]: With dead ends: 99 [2018-04-11 15:13:31,432 INFO L226 Difference]: Without dead ends: 99 [2018-04-11 15:13:31,432 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=171, Invalid=1311, Unknown=0, NotChecked=0, Total=1482 [2018-04-11 15:13:31,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-04-11 15:13:31,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 89. [2018-04-11 15:13:31,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-04-11 15:13:31,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2018-04-11 15:13:31,433 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 43 [2018-04-11 15:13:31,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:31,433 INFO L459 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2018-04-11 15:13:31,434 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 15:13:31,434 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2018-04-11 15:13:31,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 15:13:31,434 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:31,434 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 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 15:13:31,434 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr12RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr17RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr13RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr8RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr9RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr10RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr15RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr11RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr16RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr14RequiresViolation]=== [2018-04-11 15:13:31,434 INFO L82 PathProgramCache]: Analyzing trace with hash -66099777, now seen corresponding path program 3 times [2018-04-11 15:13:31,435 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:31,435 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:31,435 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:31,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:13:31,435 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:31,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:31,451 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:31,455 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:13:31,455 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:13:31,455 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:13:31,456 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:13:31,521 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-11 15:13:31,522 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:13:31,528 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:13:31,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:13:31,542 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:31,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:31,546 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 15:13:31,556 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:31,557 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:31,557 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 15:13:31,558 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:31,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 15:13:31,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:31,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:31,575 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2018-04-11 15:13:31,599 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 16 treesize of output 13 [2018-04-11 15:13:31,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:13:31,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:31,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:31,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:31,611 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2018-04-11 15:13:31,640 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:31,641 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:31,642 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:31,642 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 15:13:31,643 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:31,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-04-11 15:13:31,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:31,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:31,662 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2018-04-11 15:13:31,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:13:31,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:13:31,684 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:31,685 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:31,695 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 15:13:31,696 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:40 [2018-04-11 15:13:31,737 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 7 treesize of output 5 [2018-04-11 15:13:31,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 15:13:31,739 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:31,741 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:31,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:31,751 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:54, output treesize:47 [2018-04-11 15:13:31,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-04-11 15:13:31,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-04-11 15:13:31,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:31,808 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:31,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:13:31,817 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:32 [2018-04-11 15:13:31,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-04-11 15:13:31,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-04-11 15:13:31,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:31,869 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:31,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:13:31,877 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:32 [2018-04-11 15:13:31,934 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 23 treesize of output 24 [2018-04-11 15:13:31,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:31,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:31,942 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:31,949 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 15:13:31,950 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:43, output treesize:24 [2018-04-11 15:13:31,998 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 19 treesize of output 15 [2018-04-11 15:13:32,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 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-11 15:13:32,007 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:13:32,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:13:32,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 15:13:32,016 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:48 [2018-04-11 15:13:32,117 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:13:32,117 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:13:32,117 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-11 15:13:32,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 15:13:32,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 15:13:32,118 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2018-04-11 15:13:32,118 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand 22 states. [2018-04-11 15:13:32,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:32,704 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2018-04-11 15:13:32,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 15:13:32,704 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 43 [2018-04-11 15:13:32,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:32,705 INFO L225 Difference]: With dead ends: 118 [2018-04-11 15:13:32,705 INFO L226 Difference]: Without dead ends: 118 [2018-04-11 15:13:32,705 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=134, Invalid=988, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 15:13:32,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-04-11 15:13:32,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 94. [2018-04-11 15:13:32,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-04-11 15:13:32,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2018-04-11 15:13:32,708 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 43 [2018-04-11 15:13:32,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:32,708 INFO L459 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2018-04-11 15:13:32,708 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 15:13:32,708 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2018-04-11 15:13:32,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-11 15:13:32,709 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:32,709 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:13:32,709 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr12RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr17RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr13RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr8RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr9RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr10RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr15RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr11RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr16RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr14RequiresViolation]=== [2018-04-11 15:13:32,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1564572039, now seen corresponding path program 2 times [2018-04-11 15:13:32,709 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:32,709 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:32,710 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:32,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:13:32,710 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:32,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:32,722 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:32,725 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:13:32,725 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:13:32,726 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:13:32,726 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:13:32,766 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:13:32,766 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:13:32,771 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:13:32,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:32,782 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:32,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:13:32,788 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:32,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:32,794 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:13:32,811 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:32,812 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 15:13:32,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:32,826 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:32,826 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:32,827 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 15:13:32,827 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:32,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:13:32,838 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:26 [2018-04-11 15:13:32,868 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:32,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:13:32,870 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:32,883 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:32,884 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:32,885 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:32,886 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 15:13:32,886 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:32,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:32,895 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:21 [2018-04-11 15:13:32,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:13:32,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:13:32,914 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:32,916 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:32,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:13:32,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 15:13:32,932 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:32,933 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:32,943 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 15:13:32,943 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:43, output treesize:33 [2018-04-11 15:13:32,977 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 15:13:32,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 15:13:32,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:32,982 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:32,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:32,991 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:36 [2018-04-11 15:13:33,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-04-11 15:13:33,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-11 15:13:33,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:33,041 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:33,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:13:33,048 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2018-04-11 15:13:33,548 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:13:33,549 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:13:33,549 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 15:13:33,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 15:13:33,549 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 15:13:33,549 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2018-04-11 15:13:33,550 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand 23 states. [2018-04-11 15:13:34,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:34,595 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2018-04-11 15:13:34,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 15:13:34,595 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2018-04-11 15:13:34,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:34,596 INFO L225 Difference]: With dead ends: 102 [2018-04-11 15:13:34,596 INFO L226 Difference]: Without dead ends: 102 [2018-04-11 15:13:34,596 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=184, Invalid=1538, Unknown=0, NotChecked=0, Total=1722 [2018-04-11 15:13:34,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-04-11 15:13:34,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 95. [2018-04-11 15:13:34,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-04-11 15:13:34,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2018-04-11 15:13:34,598 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 44 [2018-04-11 15:13:34,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:34,598 INFO L459 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2018-04-11 15:13:34,598 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 15:13:34,598 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2018-04-11 15:13:34,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-11 15:13:34,599 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:34,599 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 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 15:13:34,599 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr12RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr17RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr13RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr8RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr9RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr10RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr15RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr11RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr16RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr14RequiresViolation]=== [2018-04-11 15:13:34,599 INFO L82 PathProgramCache]: Analyzing trace with hash -2049093087, now seen corresponding path program 3 times [2018-04-11 15:13:34,599 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:34,600 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:34,600 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:34,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:13:34,600 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:34,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:34,614 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:34,617 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:13:34,617 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:13:34,617 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:13:34,618 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:13:34,659 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-11 15:13:34,660 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:13:34,664 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:13:34,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:34,668 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:34,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:13:34,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:34,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:34,679 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:13:34,696 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:34,698 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 15:13:34,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:34,707 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:34,708 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:34,709 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 15:13:34,709 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:34,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:34,715 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:13:34,737 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 18 [2018-04-11 15:13:34,738 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:13:34,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:13:34,749 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:33 [2018-04-11 15:13:34,771 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 34 treesize of output 31 [2018-04-11 15:13:34,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 15:13:34,773 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:34,780 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:34,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 36 [2018-04-11 15:13:34,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:34,809 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:34,817 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:34,840 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 35 treesize of output 32 [2018-04-11 15:13:34,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:34,842 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:34,850 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:34,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2018-04-11 15:13:34,873 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:34,873 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:34,880 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:34,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:13:34,898 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:74, output treesize:49 [2018-04-11 15:13:34,947 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 37 treesize of output 33 [2018-04-11 15:13:34,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 15:13:34,949 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:34,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:34,974 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 35 [2018-04-11 15:13:34,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-11 15:13:34,976 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:34,983 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:34,999 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 28 treesize of output 24 [2018-04-11 15:13:35,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 15:13:35,001 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:35,006 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:35,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 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 22 [2018-04-11 15:13:35,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 15:13:35,022 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:35,026 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:35,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 15:13:35,038 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:77, output treesize:30 [2018-04-11 15:13:35,749 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:13:35,750 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:13:35,750 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 15:13:35,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 15:13:35,750 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 15:13:35,750 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=457, Unknown=0, NotChecked=0, Total=506 [2018-04-11 15:13:35,750 INFO L87 Difference]: Start difference. First operand 95 states and 100 transitions. Second operand 23 states. [2018-04-11 15:13:38,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:38,096 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2018-04-11 15:13:38,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 15:13:38,097 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2018-04-11 15:13:38,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:38,097 INFO L225 Difference]: With dead ends: 101 [2018-04-11 15:13:38,097 INFO L226 Difference]: Without dead ends: 101 [2018-04-11 15:13:38,098 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=143, Invalid=1497, Unknown=0, NotChecked=0, Total=1640 [2018-04-11 15:13:38,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-04-11 15:13:38,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 96. [2018-04-11 15:13:38,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-04-11 15:13:38,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2018-04-11 15:13:38,100 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 44 [2018-04-11 15:13:38,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:38,100 INFO L459 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2018-04-11 15:13:38,100 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 15:13:38,100 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2018-04-11 15:13:38,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-11 15:13:38,101 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:38,101 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 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 15:13:38,101 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr12RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr17RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr13RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr8RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr9RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr10RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr15RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr11RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr16RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr14RequiresViolation]=== [2018-04-11 15:13:38,101 INFO L82 PathProgramCache]: Analyzing trace with hash -733696243, now seen corresponding path program 3 times [2018-04-11 15:13:38,101 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:38,101 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:38,102 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:38,102 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:13:38,102 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:38,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:38,115 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:38,149 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:13:38,149 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:13:38,149 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:13:38,150 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:13:38,177 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-11 15:13:38,177 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:13:38,180 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:13:38,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:13:38,184 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:38,188 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:38,189 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:38,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:38,192 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:13:38,205 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:38,206 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 15:13:38,207 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:38,216 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:38,216 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:38,217 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 15:13:38,217 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:38,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:13:38,245 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:26 [2018-04-11 15:13:38,275 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:38,276 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 17 treesize of output 20 [2018-04-11 15:13:38,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:38,292 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:38,293 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:38,293 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:38,294 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 15:13:38,294 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:38,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:38,306 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:23 [2018-04-11 15:13:38,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:13:38,326 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 15:13:38,326 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:38,335 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:38,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:13:38,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:38,360 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:38,362 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:38,372 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 15:13:38,373 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:45, output treesize:39 [2018-04-11 15:13:38,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2018-04-11 15:13:38,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2018-04-11 15:13:38,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:38,406 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:38,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 15:13:38,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 15:13:38,413 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:38,414 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:38,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:13:38,419 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:23 [2018-04-11 15:13:38,869 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:13:38,869 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:13:38,869 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-11 15:13:38,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 15:13:38,869 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 15:13:38,870 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2018-04-11 15:13:38,870 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand 22 states. [2018-04-11 15:13:39,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:39,969 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2018-04-11 15:13:39,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 15:13:39,970 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 47 [2018-04-11 15:13:39,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:39,970 INFO L225 Difference]: With dead ends: 111 [2018-04-11 15:13:39,970 INFO L226 Difference]: Without dead ends: 111 [2018-04-11 15:13:39,971 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=176, Invalid=1464, Unknown=0, NotChecked=0, Total=1640 [2018-04-11 15:13:39,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-04-11 15:13:39,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 101. [2018-04-11 15:13:39,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-04-11 15:13:39,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2018-04-11 15:13:39,973 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 47 [2018-04-11 15:13:39,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:39,973 INFO L459 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2018-04-11 15:13:39,973 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 15:13:39,973 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2018-04-11 15:13:39,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-11 15:13:39,973 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:39,974 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:13:39,974 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr12RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr17RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr13RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr8RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr9RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr10RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr15RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr11RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr16RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr14RequiresViolation]=== [2018-04-11 15:13:39,974 INFO L82 PathProgramCache]: Analyzing trace with hash 452253865, now seen corresponding path program 2 times [2018-04-11 15:13:39,974 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:39,974 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:39,975 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:39,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:13:39,975 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:39,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:39,988 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:39,992 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:13:39,992 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:13:39,992 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:13:39,992 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:13:40,031 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:13:40,031 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:13:40,035 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:13:40,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:40,059 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:40,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 6 treesize of output 5 [2018-04-11 15:13:40,066 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:40,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:40,071 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:13:40,088 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:40,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:13:40,090 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:40,102 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:40,102 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:40,103 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 15:13:40,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:40,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:13:40,113 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:26 [2018-04-11 15:13:40,142 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:40,144 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 17 treesize of output 20 [2018-04-11 15:13:40,144 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:40,158 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:40,159 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:40,160 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:40,160 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 15:13:40,160 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:40,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:40,170 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:23 [2018-04-11 15:13:40,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:13:40,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 15:13:40,212 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:40,214 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:40,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:13:40,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:13:40,229 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:40,231 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:40,241 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 15:13:40,241 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:45, output treesize:39 [2018-04-11 15:13:40,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2018-04-11 15:13:40,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2018-04-11 15:13:40,278 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:40,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:40,293 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 15 treesize of output 11 [2018-04-11 15:13:40,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 15:13:40,295 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:40,297 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:40,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:13:40,304 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:23 [2018-04-11 15:13:40,939 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 15:13:40,940 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:13:40,940 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 15:13:40,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 15:13:40,940 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 15:13:40,940 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=457, Unknown=0, NotChecked=0, Total=506 [2018-04-11 15:13:40,940 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand 23 states. [2018-04-11 15:13:42,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:42,192 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2018-04-11 15:13:42,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 15:13:42,193 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 48 [2018-04-11 15:13:42,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:42,193 INFO L225 Difference]: With dead ends: 116 [2018-04-11 15:13:42,193 INFO L226 Difference]: Without dead ends: 116 [2018-04-11 15:13:42,193 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=187, Invalid=1619, Unknown=0, NotChecked=0, Total=1806 [2018-04-11 15:13:42,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-04-11 15:13:42,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 101. [2018-04-11 15:13:42,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-04-11 15:13:42,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2018-04-11 15:13:42,195 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 48 [2018-04-11 15:13:42,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:42,195 INFO L459 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2018-04-11 15:13:42,195 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 15:13:42,195 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2018-04-11 15:13:42,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-11 15:13:42,195 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:42,195 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:13:42,195 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr12RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr17RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr13RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr8RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr9RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr10RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr15RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr11RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr16RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr14RequiresViolation]=== [2018-04-11 15:13:42,195 INFO L82 PathProgramCache]: Analyzing trace with hash 627714771, now seen corresponding path program 3 times [2018-04-11 15:13:42,195 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:42,195 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:42,196 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:42,196 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:13:42,196 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:42,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:42,208 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:42,211 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:13:42,212 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:13:42,212 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:13:42,212 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:13:42,261 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-11 15:13:42,261 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:13:42,265 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:13:42,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:42,274 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:42,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:13:42,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:42,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:42,286 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:13:42,304 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:42,305 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 15:13:42,305 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:42,318 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:42,319 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:42,319 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 15:13:42,320 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:42,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:13:42,330 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:26 [2018-04-11 15:13:42,360 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:42,361 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:42,362 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:42,362 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 15:13:42,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:42,374 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-04-11 15:13:42,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:42,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:42,384 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:23 [2018-04-11 15:13:42,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:13:42,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 15:13:42,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:42,405 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:42,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:13:42,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:42,422 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:42,424 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:42,448 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 15:13:42,448 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:45, output treesize:39 [2018-04-11 15:13:42,472 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 15:13:42,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 15:13:42,473 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:42,475 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:42,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:42,481 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:53, output treesize:42 [2018-04-11 15:13:42,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2018-04-11 15:13:42,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2018-04-11 15:13:42,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:42,539 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:42,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:13:42,546 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:23 [2018-04-11 15:13:43,131 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:13:43,131 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:13:43,131 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-11 15:13:43,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 15:13:43,131 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 15:13:43,131 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=544, Unknown=0, NotChecked=0, Total=600 [2018-04-11 15:13:43,131 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand 25 states. [2018-04-11 15:13:44,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:44,579 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2018-04-11 15:13:44,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 15:13:44,579 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 49 [2018-04-11 15:13:44,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:44,579 INFO L225 Difference]: With dead ends: 113 [2018-04-11 15:13:44,580 INFO L226 Difference]: Without dead ends: 113 [2018-04-11 15:13:44,580 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 334 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=203, Invalid=1867, Unknown=0, NotChecked=0, Total=2070 [2018-04-11 15:13:44,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-04-11 15:13:44,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 101. [2018-04-11 15:13:44,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-04-11 15:13:44,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2018-04-11 15:13:44,581 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 49 [2018-04-11 15:13:44,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:44,581 INFO L459 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2018-04-11 15:13:44,581 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 15:13:44,581 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2018-04-11 15:13:44,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-11 15:13:44,582 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:44,582 INFO L355 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 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 15:13:44,582 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr12RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr17RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr13RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr8RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr9RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr10RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr15RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr11RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr16RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr14RequiresViolation]=== [2018-04-11 15:13:44,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1014066527, now seen corresponding path program 4 times [2018-04-11 15:13:44,582 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:44,582 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:44,583 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:44,583 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:13:44,583 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:44,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:44,599 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:44,605 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:13:44,606 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:13:44,606 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:13:44,606 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:13:44,652 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:13:44,652 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:13:44,657 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:13:44,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 6 treesize of output 5 [2018-04-11 15:13:44,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:44,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:44,665 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 15:13:44,672 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:44,672 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:44,673 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 15:13:44,673 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:44,689 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 15:13:44,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:44,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:44,696 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2018-04-11 15:13:44,718 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 16 treesize of output 13 [2018-04-11 15:13:44,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:13:44,720 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:44,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:44,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:44,729 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2018-04-11 15:13:44,762 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:44,763 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:44,764 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:44,764 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 15:13:44,764 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:44,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-04-11 15:13:44,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:44,782 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 15:13:44,782 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:36 [2018-04-11 15:13:44,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:13:44,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:13:44,798 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:44,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:44,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:13:44,806 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:44 [2018-04-11 15:13:44,836 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 24 treesize of output 18 [2018-04-11 15:13:44,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-04-11 15:13:44,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:44,839 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:44,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 15:13:44,846 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:36 [2018-04-11 15:13:44,934 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 24 treesize of output 25 [2018-04-11 15:13:44,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:44,935 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:44,938 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:44,946 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 15:13:44,947 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:41 [2018-04-11 15:13:45,020 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 24 treesize of output 25 [2018-04-11 15:13:45,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:45,022 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:45,026 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:45,036 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 15:13:45,036 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:52, output treesize:41 [2018-04-11 15:13:45,130 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 24 treesize of output 25 [2018-04-11 15:13:45,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:45,133 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:45,138 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:45,150 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 15:13:45,150 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:52, output treesize:33 [2018-04-11 15:13:45,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, 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 18 [2018-04-11 15:13:45,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 1 case distinctions, treesize of input 18 treesize of output 15 [2018-04-11 15:13:45,231 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:13:45,233 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:13:45,241 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 2 xjuncts. [2018-04-11 15:13:45,241 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:64 [2018-04-11 15:13:45,358 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:13:45,358 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:13:45,358 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-11 15:13:45,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 15:13:45,359 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 15:13:45,359 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=500, Unknown=0, NotChecked=0, Total=552 [2018-04-11 15:13:45,359 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand 24 states. [2018-04-11 15:13:46,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:46,333 INFO L93 Difference]: Finished difference Result 150 states and 157 transitions. [2018-04-11 15:13:46,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-11 15:13:46,333 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 49 [2018-04-11 15:13:46,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:46,333 INFO L225 Difference]: With dead ends: 150 [2018-04-11 15:13:46,333 INFO L226 Difference]: Without dead ends: 150 [2018-04-11 15:13:46,334 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=150, Invalid=1256, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 15:13:46,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-04-11 15:13:46,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 106. [2018-04-11 15:13:46,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-04-11 15:13:46,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 112 transitions. [2018-04-11 15:13:46,335 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 112 transitions. Word has length 49 [2018-04-11 15:13:46,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:46,335 INFO L459 AbstractCegarLoop]: Abstraction has 106 states and 112 transitions. [2018-04-11 15:13:46,335 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 15:13:46,335 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 112 transitions. [2018-04-11 15:13:46,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 15:13:46,336 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:46,336 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 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 15:13:46,336 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr12RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr17RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr13RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr8RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr9RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr10RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr15RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr11RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr16RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr14RequiresViolation]=== [2018-04-11 15:13:46,336 INFO L82 PathProgramCache]: Analyzing trace with hash -2052593435, now seen corresponding path program 3 times [2018-04-11 15:13:46,336 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:46,336 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:46,336 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:46,336 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:13:46,336 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:46,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:46,345 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:46,367 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:13:46,367 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:13:46,367 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:13:46,367 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:13:46,403 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-11 15:13:46,403 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:13:46,406 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:13:46,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:46,410 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:46,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:46,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:46,418 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:46,418 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:13:46,447 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:46,448 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 15:13:46,448 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:46,460 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:46,460 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:46,461 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 15:13:46,461 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:46,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:13:46,470 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:23 [2018-04-11 15:13:46,496 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:46,498 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:13:46,498 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:46,510 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:46,511 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:46,512 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:46,512 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 15:13:46,512 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:46,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:46,525 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:18 [2018-04-11 15:13:46,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:13:46,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 15:13:46,542 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:46,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:46,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:13:46,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:46,556 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:46,558 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:46,565 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 15:13:46,565 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-04-11 15:13:46,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-04-11 15:13:46,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-11 15:13:46,596 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:46,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:46,604 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 15 treesize of output 11 [2018-04-11 15:13:46,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 15:13:46,605 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:46,606 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:46,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:13:46,610 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-04-11 15:13:46,822 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:13:46,823 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:13:46,823 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-11 15:13:46,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 15:13:46,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 15:13:46,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=380, Unknown=0, NotChecked=0, Total=420 [2018-04-11 15:13:46,824 INFO L87 Difference]: Start difference. First operand 106 states and 112 transitions. Second operand 21 states. [2018-04-11 15:13:47,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:47,667 INFO L93 Difference]: Finished difference Result 112 states and 118 transitions. [2018-04-11 15:13:47,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 15:13:47,668 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 50 [2018-04-11 15:13:47,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:47,668 INFO L225 Difference]: With dead ends: 112 [2018-04-11 15:13:47,668 INFO L226 Difference]: Without dead ends: 112 [2018-04-11 15:13:47,669 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=164, Invalid=1396, Unknown=0, NotChecked=0, Total=1560 [2018-04-11 15:13:47,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-04-11 15:13:47,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 107. [2018-04-11 15:13:47,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-04-11 15:13:47,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2018-04-11 15:13:47,670 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 50 [2018-04-11 15:13:47,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:47,670 INFO L459 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2018-04-11 15:13:47,670 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 15:13:47,670 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2018-04-11 15:13:47,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 15:13:47,670 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:47,670 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 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 15:13:47,670 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr12RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr17RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr13RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr8RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr9RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr10RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr15RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr11RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr16RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr14RequiresViolation]=== [2018-04-11 15:13:47,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1371291265, now seen corresponding path program 4 times [2018-04-11 15:13:47,670 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:47,671 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:47,671 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:47,671 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:13:47,671 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:47,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:47,679 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:47,682 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:13:47,682 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:13:47,682 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:13:47,682 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:13:47,703 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:13:47,703 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:13:47,706 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:13:47,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:13:47,707 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:47,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:13:47,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:47,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:47,714 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:13:47,724 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:47,725 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 15:13:47,725 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:47,733 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:47,734 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:47,734 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 15:13:47,734 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:47,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:13:47,741 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:23 [2018-04-11 15:13:47,783 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:47,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:13:47,784 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:47,795 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:47,796 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:47,796 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:47,797 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 15:13:47,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:47,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:47,803 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:18 [2018-04-11 15:13:47,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:13:47,815 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 15:13:47,815 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:47,816 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:47,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:13:47,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:47,826 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:47,827 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:47,834 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 15:13:47,834 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2018-04-11 15:13:47,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-04-11 15:13:47,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-11 15:13:47,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:47,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:47,866 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 15 treesize of output 11 [2018-04-11 15:13:47,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 15:13:47,868 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:47,869 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:47,873 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:13:47,873 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-04-11 15:13:48,176 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:13:48,176 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:13:48,176 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 15:13:48,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 15:13:48,177 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 15:13:48,177 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506 [2018-04-11 15:13:48,177 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand 23 states. [2018-04-11 15:13:49,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:49,377 INFO L93 Difference]: Finished difference Result 111 states and 118 transitions. [2018-04-11 15:13:49,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 15:13:49,377 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 50 [2018-04-11 15:13:49,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:49,378 INFO L225 Difference]: With dead ends: 111 [2018-04-11 15:13:49,378 INFO L226 Difference]: Without dead ends: 111 [2018-04-11 15:13:49,378 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=189, Invalid=1791, Unknown=0, NotChecked=0, Total=1980 [2018-04-11 15:13:49,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-04-11 15:13:49,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 108. [2018-04-11 15:13:49,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-04-11 15:13:49,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 114 transitions. [2018-04-11 15:13:49,379 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 114 transitions. Word has length 50 [2018-04-11 15:13:49,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:49,380 INFO L459 AbstractCegarLoop]: Abstraction has 108 states and 114 transitions. [2018-04-11 15:13:49,380 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 15:13:49,380 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 114 transitions. [2018-04-11 15:13:49,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-11 15:13:49,380 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:49,380 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 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 15:13:49,380 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr12RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr17RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr13RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr8RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr9RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr10RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr15RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr11RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr16RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr14RequiresViolation]=== [2018-04-11 15:13:49,380 INFO L82 PathProgramCache]: Analyzing trace with hash -305563379, now seen corresponding path program 4 times [2018-04-11 15:13:49,380 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:49,380 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:49,381 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:49,381 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:13:49,381 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:49,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:49,388 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:49,407 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:13:49,407 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:13:49,407 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:13:49,408 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:13:49,431 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:13:49,431 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:13:49,434 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:13:49,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:49,436 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:49,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:49,448 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:49,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:49,451 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:13:49,461 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:49,462 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:49,462 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 15:13:49,462 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:49,470 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 15:13:49,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:49,476 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:13:49,476 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:23 [2018-04-11 15:13:49,494 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:49,495 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:49,509 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:49,509 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 15:13:49,510 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:49,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:13:49,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:49,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:49,527 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:18 [2018-04-11 15:13:49,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:13:49,543 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 15:13:49,543 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:49,545 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:49,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:13:49,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:49,556 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:49,557 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:49,564 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 15:13:49,565 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-04-11 15:13:49,595 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-04-11 15:13:49,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-11 15:13:49,597 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:49,601 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:49,609 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 15 treesize of output 11 [2018-04-11 15:13:49,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 15:13:49,611 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:49,613 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:49,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:13:49,618 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-04-11 15:13:50,118 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:13:50,119 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:13:50,119 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-11 15:13:50,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 15:13:50,120 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 15:13:50,120 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552 [2018-04-11 15:13:50,120 INFO L87 Difference]: Start difference. First operand 108 states and 114 transitions. Second operand 24 states. [2018-04-11 15:13:51,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:51,461 INFO L93 Difference]: Finished difference Result 123 states and 129 transitions. [2018-04-11 15:13:51,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-11 15:13:51,462 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 52 [2018-04-11 15:13:51,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:51,462 INFO L225 Difference]: With dead ends: 123 [2018-04-11 15:13:51,462 INFO L226 Difference]: Without dead ends: 123 [2018-04-11 15:13:51,463 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=197, Invalid=1965, Unknown=0, NotChecked=0, Total=2162 [2018-04-11 15:13:51,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-04-11 15:13:51,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 113. [2018-04-11 15:13:51,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-04-11 15:13:51,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions. [2018-04-11 15:13:51,464 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 52 [2018-04-11 15:13:51,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:51,464 INFO L459 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions. [2018-04-11 15:13:51,464 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 15:13:51,464 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2018-04-11 15:13:51,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-11 15:13:51,464 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:51,465 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:13:51,465 INFO L408 AbstractCegarLoop]: === Iteration 40 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr12RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr17RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr13RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr8RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr9RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr10RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr15RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr11RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr16RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr14RequiresViolation]=== [2018-04-11 15:13:51,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1044879097, now seen corresponding path program 4 times [2018-04-11 15:13:51,465 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:51,465 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:51,465 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:51,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:13:51,465 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:51,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:51,474 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:51,477 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:13:51,477 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:13:51,477 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:13:51,478 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:13:51,512 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:13:51,512 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:13:51,515 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:13:51,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:51,519 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:51,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:13:51,534 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:51,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:51,538 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:13:51,559 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:51,561 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 15:13:51,561 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:51,574 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:51,575 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:51,575 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 15:13:51,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:51,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:13:51,586 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:26 [2018-04-11 15:13:51,616 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:51,617 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 17 treesize of output 20 [2018-04-11 15:13:51,618 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:51,632 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:51,632 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:51,633 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:51,634 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 15:13:51,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:51,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:51,643 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:23 [2018-04-11 15:13:51,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:13:51,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:13:51,662 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:51,664 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:51,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:13:51,679 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 15:13:51,679 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:51,681 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:51,691 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 15:13:51,691 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:45, output treesize:39 [2018-04-11 15:13:51,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2018-04-11 15:13:51,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2018-04-11 15:13:51,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:51,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:51,741 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 15 treesize of output 11 [2018-04-11 15:13:51,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 15:13:51,743 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:51,744 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:51,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:13:51,751 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:23 [2018-04-11 15:13:52,748 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:13:52,749 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:13:52,749 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-11 15:13:52,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-11 15:13:52,749 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-11 15:13:52,749 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=594, Unknown=0, NotChecked=0, Total=650 [2018-04-11 15:13:52,749 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand 26 states. [2018-04-11 15:13:54,702 WARN L151 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 61 DAG size of output 57 [2018-04-11 15:13:54,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:54,862 INFO L93 Difference]: Finished difference Result 130 states and 136 transitions. [2018-04-11 15:13:54,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-11 15:13:54,862 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 54 [2018-04-11 15:13:54,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:54,863 INFO L225 Difference]: With dead ends: 130 [2018-04-11 15:13:54,863 INFO L226 Difference]: Without dead ends: 130 [2018-04-11 15:13:54,863 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=214, Invalid=2138, Unknown=0, NotChecked=0, Total=2352 [2018-04-11 15:13:54,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-04-11 15:13:54,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 113. [2018-04-11 15:13:54,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-04-11 15:13:54,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions. [2018-04-11 15:13:54,865 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 54 [2018-04-11 15:13:54,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:54,865 INFO L459 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions. [2018-04-11 15:13:54,865 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-11 15:13:54,865 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2018-04-11 15:13:54,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-11 15:13:54,865 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:54,865 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:13:54,866 INFO L408 AbstractCegarLoop]: === Iteration 41 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr12RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr17RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr13RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr8RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr9RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr10RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr15RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr11RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr16RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr14RequiresViolation]=== [2018-04-11 15:13:54,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1461233205, now seen corresponding path program 5 times [2018-04-11 15:13:54,866 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:54,866 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:54,866 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:54,866 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:13:54,867 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:54,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:54,875 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:54,879 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:13:54,879 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:13:54,879 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:13:54,879 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:13:54,909 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-04-11 15:13:54,909 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:13:54,913 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:13:54,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:54,915 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:54,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:54,919 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:54,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:54,922 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:13:54,932 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:54,933 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 15:13:54,934 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:54,940 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:54,941 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:54,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-11 15:13:54,942 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:54,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:54,946 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:13:54,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:13:54,961 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:13:54,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:13:54,968 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:27 [2018-04-11 15:13:54,989 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 33 treesize of output 30 [2018-04-11 15:13:54,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:54,990 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:54,995 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:55,026 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 29 treesize of output 26 [2018-04-11 15:13:55,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:55,058 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:55,064 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:55,081 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 28 treesize of output 25 [2018-04-11 15:13:55,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:55,083 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:55,088 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:55,104 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 24 treesize of output 21 [2018-04-11 15:13:55,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:55,106 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:55,110 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:55,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:13:55,122 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:62, output treesize:43 [2018-04-11 15:13:55,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2018-04-11 15:13:55,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 15:13:55,172 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:55,177 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:55,195 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 36 treesize of output 32 [2018-04-11 15:13:55,197 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-11 15:13:55,197 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:55,203 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:55,218 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-04-11 15:13:55,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 15:13:55,220 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:55,235 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:55,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-11 15:13:55,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 15:13:55,248 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:55,252 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:55,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 15:13:55,262 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:71, output treesize:24 [2018-04-11 15:13:55,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2018-04-11 15:13:55,333 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:55,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-04-11 15:13:55,342 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:55,348 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 2 xjuncts. [2018-04-11 15:13:55,348 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2018-04-11 15:13:55,674 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:13:55,675 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:13:55,675 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-11 15:13:55,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 15:13:55,675 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 15:13:55,675 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2018-04-11 15:13:55,675 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand 24 states. [2018-04-11 15:13:57,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:57,176 INFO L93 Difference]: Finished difference Result 123 states and 129 transitions. [2018-04-11 15:13:57,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 15:13:57,177 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 55 [2018-04-11 15:13:57,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:57,177 INFO L225 Difference]: With dead ends: 123 [2018-04-11 15:13:57,177 INFO L226 Difference]: Without dead ends: 123 [2018-04-11 15:13:57,178 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=144, Invalid=1748, Unknown=0, NotChecked=0, Total=1892 [2018-04-11 15:13:57,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-04-11 15:13:57,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 113. [2018-04-11 15:13:57,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-04-11 15:13:57,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 119 transitions. [2018-04-11 15:13:57,179 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 119 transitions. Word has length 55 [2018-04-11 15:13:57,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:57,179 INFO L459 AbstractCegarLoop]: Abstraction has 113 states and 119 transitions. [2018-04-11 15:13:57,179 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 15:13:57,179 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 119 transitions. [2018-04-11 15:13:57,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-11 15:13:57,179 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:57,179 INFO L355 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 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 15:13:57,179 INFO L408 AbstractCegarLoop]: === Iteration 42 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr12RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr17RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr13RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr8RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr9RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr10RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr15RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr11RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr16RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr14RequiresViolation]=== [2018-04-11 15:13:57,180 INFO L82 PathProgramCache]: Analyzing trace with hash -180548093, now seen corresponding path program 5 times [2018-04-11 15:13:57,180 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:57,180 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:57,180 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:57,180 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:13:57,180 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:57,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:57,192 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:57,201 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:13:57,202 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:13:57,202 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:13:57,202 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:13:57,252 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-04-11 15:13:57,252 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:13:57,257 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:13:57,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:57,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:57,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:57,261 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 15:13:57,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:57,268 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:57,276 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:57,276 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:57,277 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 15:13:57,277 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:57,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:57,290 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2018-04-11 15:13:57,309 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 16 treesize of output 13 [2018-04-11 15:13:57,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:13:57,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:57,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:57,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:57,317 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2018-04-11 15:13:57,359 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:57,360 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:57,360 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:57,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 15:13:57,361 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:57,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2018-04-11 15:13:57,372 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:57,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:57,381 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:35 [2018-04-11 15:13:57,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:13:57,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:13:57,402 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:57,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:57,418 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:13:57,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:13:57,419 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:57,420 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:57,428 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 15:13:57,428 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:54, output treesize:47 [2018-04-11 15:13:57,459 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 24 treesize of output 18 [2018-04-11 15:13:57,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-04-11 15:13:57,461 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:57,463 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:57,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2018-04-11 15:13:57,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 15:13:57,473 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:57,474 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:57,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:13:57,480 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:61, output treesize:35 [2018-04-11 15:13:57,555 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 23 treesize of output 24 [2018-04-11 15:13:57,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:57,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:57,559 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:57,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:13:57,565 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:32 [2018-04-11 15:13:57,605 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 23 treesize of output 24 [2018-04-11 15:13:57,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:57,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:57,609 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:57,615 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 15:13:57,615 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:32 [2018-04-11 15:13:57,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-04-11 15:13:57,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:57,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:57,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:57,668 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 15:13:57,668 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:32 [2018-04-11 15:13:57,711 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 23 treesize of output 24 [2018-04-11 15:13:57,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:57,713 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:57,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:57,722 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 15:13:57,722 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:43, output treesize:24 [2018-04-11 15:13:57,777 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 19 treesize of output 15 [2018-04-11 15:13:57,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-11 15:13:57,780 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:13:57,782 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:13:57,788 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 15:13:57,788 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:40 [2018-04-11 15:13:57,873 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:13:57,874 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:13:57,874 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-11 15:13:57,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 15:13:57,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 15:13:57,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=545, Unknown=0, NotChecked=0, Total=600 [2018-04-11 15:13:57,874 INFO L87 Difference]: Start difference. First operand 113 states and 119 transitions. Second operand 25 states. [2018-04-11 15:13:58,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:58,693 INFO L93 Difference]: Finished difference Result 187 states and 195 transitions. [2018-04-11 15:13:58,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-11 15:13:58,693 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 55 [2018-04-11 15:13:58,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:58,694 INFO L225 Difference]: With dead ends: 187 [2018-04-11 15:13:58,694 INFO L226 Difference]: Without dead ends: 187 [2018-04-11 15:13:58,694 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=139, Invalid=1193, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 15:13:58,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-04-11 15:13:58,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 118. [2018-04-11 15:13:58,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-11 15:13:58,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 125 transitions. [2018-04-11 15:13:58,696 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 125 transitions. Word has length 55 [2018-04-11 15:13:58,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:58,697 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 125 transitions. [2018-04-11 15:13:58,697 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 15:13:58,697 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2018-04-11 15:13:58,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-11 15:13:58,697 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:58,697 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 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 15:13:58,698 INFO L408 AbstractCegarLoop]: === Iteration 43 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr12RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr17RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr13RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr8RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr9RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr10RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr15RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr11RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr16RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr14RequiresViolation]=== [2018-04-11 15:13:58,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1983325757, now seen corresponding path program 4 times [2018-04-11 15:13:58,698 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:58,698 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:58,698 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:58,699 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:13:58,699 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:58,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:58,714 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:58,724 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:13:58,724 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:13:58,724 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:13:58,725 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:13:58,830 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:13:58,830 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:13:58,835 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:13:58,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:13:58,838 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:58,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:13:58,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:58,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:58,848 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:13:58,861 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:58,862 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:58,863 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 15:13:58,863 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:58,875 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 15:13:58,875 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:58,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:13:58,882 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:23 [2018-04-11 15:13:58,901 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:58,902 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:58,903 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:58,903 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 15:13:58,903 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:58,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:13:58,911 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:58,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:58,917 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:18 [2018-04-11 15:13:58,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:13:58,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 15:13:58,930 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:58,931 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:58,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:13:58,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 15:13:58,962 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:58,963 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:58,970 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 15:13:58,970 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-04-11 15:13:59,000 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-04-11 15:13:59,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-11 15:13:59,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:59,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:59,014 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 15 treesize of output 11 [2018-04-11 15:13:59,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 15:13:59,016 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:59,017 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:59,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:13:59,022 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-04-11 15:13:59,378 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:13:59,378 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:13:59,378 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-11 15:13:59,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 15:13:59,379 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 15:13:59,379 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2018-04-11 15:13:59,379 INFO L87 Difference]: Start difference. First operand 118 states and 125 transitions. Second operand 24 states. [2018-04-11 15:14:00,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:14:00,483 INFO L93 Difference]: Finished difference Result 124 states and 131 transitions. [2018-04-11 15:14:00,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 15:14:00,483 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 56 [2018-04-11 15:14:00,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:14:00,483 INFO L225 Difference]: With dead ends: 124 [2018-04-11 15:14:00,483 INFO L226 Difference]: Without dead ends: 124 [2018-04-11 15:14:00,484 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=191, Invalid=1879, Unknown=0, NotChecked=0, Total=2070 [2018-04-11 15:14:00,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-04-11 15:14:00,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 119. [2018-04-11 15:14:00,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-04-11 15:14:00,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 126 transitions. [2018-04-11 15:14:00,485 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 126 transitions. Word has length 56 [2018-04-11 15:14:00,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:14:00,485 INFO L459 AbstractCegarLoop]: Abstraction has 119 states and 126 transitions. [2018-04-11 15:14:00,485 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 15:14:00,485 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 126 transitions. [2018-04-11 15:14:00,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-11 15:14:00,486 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:14:00,486 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 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 15:14:00,486 INFO L408 AbstractCegarLoop]: === Iteration 44 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr12RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr17RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr13RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr8RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr9RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr10RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr15RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr11RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr16RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr14RequiresViolation]=== [2018-04-11 15:14:00,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1302023587, now seen corresponding path program 5 times [2018-04-11 15:14:00,486 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:14:00,486 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:14:00,486 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:14:00,486 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:14:00,486 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:14:00,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:14:00,502 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:14:00,507 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:14:00,507 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:14:00,507 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:14:00,508 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:14:00,575 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-04-11 15:14:00,575 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:14:00,581 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:14:00,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:14:00,597 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:00,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:14:00,602 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:00,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:00,606 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:14:00,619 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:00,620 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 15:14:00,620 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:00,629 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:00,630 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:00,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-11 15:14:00,631 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:00,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:00,636 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:14:00,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:14:00,656 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:14:00,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:14:00,666 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:27 [2018-04-11 15:14:00,686 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 33 treesize of output 30 [2018-04-11 15:14:00,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:14:00,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:00,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:00,706 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 28 treesize of output 25 [2018-04-11 15:14:00,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:14:00,707 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:00,711 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:00,724 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 24 treesize of output 21 [2018-04-11 15:14:00,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 15:14:00,726 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:00,731 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:00,747 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 29 treesize of output 26 [2018-04-11 15:14:00,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:14:00,749 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:00,755 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:00,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:14:00,768 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:62, output treesize:43 [2018-04-11 15:14:00,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2018-04-11 15:14:00,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 15:14:00,799 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:00,803 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:00,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-11 15:14:00,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 15:14:00,816 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:00,818 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:00,829 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 36 treesize of output 32 [2018-04-11 15:14:00,830 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-11 15:14:00,830 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:00,834 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:00,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-04-11 15:14:00,844 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 15:14:00,844 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:00,847 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:00,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 15:14:00,854 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:71, output treesize:24 [2018-04-11 15:14:01,377 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:14:01,377 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:14:01,377 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-11 15:14:01,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 15:14:01,378 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 15:14:01,378 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2018-04-11 15:14:01,378 INFO L87 Difference]: Start difference. First operand 119 states and 126 transitions. Second operand 25 states. [2018-04-11 15:14:03,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:14:03,138 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2018-04-11 15:14:03,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 15:14:03,138 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 56 [2018-04-11 15:14:03,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:14:03,139 INFO L225 Difference]: With dead ends: 123 [2018-04-11 15:14:03,139 INFO L226 Difference]: Without dead ends: 123 [2018-04-11 15:14:03,140 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=150, Invalid=1920, Unknown=0, NotChecked=0, Total=2070 [2018-04-11 15:14:03,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-04-11 15:14:03,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 120. [2018-04-11 15:14:03,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-04-11 15:14:03,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 127 transitions. [2018-04-11 15:14:03,142 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 127 transitions. Word has length 56 [2018-04-11 15:14:03,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:14:03,142 INFO L459 AbstractCegarLoop]: Abstraction has 120 states and 127 transitions. [2018-04-11 15:14:03,142 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 15:14:03,142 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 127 transitions. [2018-04-11 15:14:03,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-11 15:14:03,142 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:14:03,143 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 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 15:14:03,143 INFO L408 AbstractCegarLoop]: === Iteration 45 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr12RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr17RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr13RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr8RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr9RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr10RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr15RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr11RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr16RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr14RequiresViolation]=== [2018-04-11 15:14:03,143 INFO L82 PathProgramCache]: Analyzing trace with hash -642584819, now seen corresponding path program 5 times [2018-04-11 15:14:03,143 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:14:03,143 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:14:03,143 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:14:03,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:14:03,144 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:14:03,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:14:03,156 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:14:03,160 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:14:03,160 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:14:03,160 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:14:03,160 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:14:03,198 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-04-11 15:14:03,198 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:14:03,203 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:14:03,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:14:03,208 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:03,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:14:03,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:03,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:03,219 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:14:03,236 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:03,237 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 15:14:03,238 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:03,247 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:03,248 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:03,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-11 15:14:03,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:03,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:03,255 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:14:03,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:14:03,276 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:14:03,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:14:03,287 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:33 [2018-04-11 15:14:03,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 33 [2018-04-11 15:14:03,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:14:03,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:03,317 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:03,342 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 31 treesize of output 28 [2018-04-11 15:14:03,344 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:14:03,344 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:03,350 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:03,371 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 27 treesize of output 24 [2018-04-11 15:14:03,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 15:14:03,373 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:03,378 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:03,396 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 32 treesize of output 29 [2018-04-11 15:14:03,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:14:03,398 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:03,404 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:03,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:14:03,420 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:68, output treesize:49 [2018-04-11 15:14:03,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 33 [2018-04-11 15:14:03,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 15:14:03,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:03,467 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:03,481 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 35 [2018-04-11 15:14:03,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-11 15:14:03,482 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:03,487 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:03,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-04-11 15:14:03,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 15:14:03,501 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:03,505 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:03,516 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 28 treesize of output 24 [2018-04-11 15:14:03,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 15:14:03,517 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:03,521 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:03,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 15:14:03,530 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:77, output treesize:30 [2018-04-11 15:14:06,369 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:14:06,369 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:14:06,369 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-11 15:14:06,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-11 15:14:06,370 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-11 15:14:06,370 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=647, Unknown=0, NotChecked=0, Total=702 [2018-04-11 15:14:06,370 INFO L87 Difference]: Start difference. First operand 120 states and 127 transitions. Second operand 27 states. [2018-04-11 15:14:07,893 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 47 DAG size of output 46 [2018-04-11 15:14:08,130 WARN L151 SmtUtils]: Spent 142ms on a formula simplification. DAG size of input: 50 DAG size of output 49 [2018-04-11 15:14:08,407 WARN L151 SmtUtils]: Spent 170ms on a formula simplification. DAG size of input: 56 DAG size of output 55 [2018-04-11 15:14:09,101 WARN L151 SmtUtils]: Spent 177ms on a formula simplification. DAG size of input: 55 DAG size of output 54 [2018-04-11 15:14:09,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:14:09,343 INFO L93 Difference]: Finished difference Result 145 states and 152 transitions. [2018-04-11 15:14:09,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 15:14:09,344 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 57 [2018-04-11 15:14:09,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:14:09,344 INFO L225 Difference]: With dead ends: 145 [2018-04-11 15:14:09,344 INFO L226 Difference]: Without dead ends: 145 [2018-04-11 15:14:09,345 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=166, Invalid=2284, Unknown=0, NotChecked=0, Total=2450 [2018-04-11 15:14:09,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-04-11 15:14:09,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 125. [2018-04-11 15:14:09,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-04-11 15:14:09,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 132 transitions. [2018-04-11 15:14:09,346 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 132 transitions. Word has length 57 [2018-04-11 15:14:09,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:14:09,346 INFO L459 AbstractCegarLoop]: Abstraction has 125 states and 132 transitions. [2018-04-11 15:14:09,347 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-11 15:14:09,347 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 132 transitions. [2018-04-11 15:14:09,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-11 15:14:09,347 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:14:09,347 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:14:09,347 INFO L408 AbstractCegarLoop]: === Iteration 46 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr12RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr17RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr13RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr8RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr9RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr10RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr15RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr11RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr16RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr14RequiresViolation]=== [2018-04-11 15:14:09,347 INFO L82 PathProgramCache]: Analyzing trace with hash -530528855, now seen corresponding path program 6 times [2018-04-11 15:14:09,347 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:14:09,347 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:14:09,348 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:14:09,348 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:14:09,348 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:14:09,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:14:09,357 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:14:09,363 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:14:09,363 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:14:09,363 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:14:09,364 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:14:09,411 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-04-11 15:14:09,411 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:14:09,417 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:14:09,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:14:09,431 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:09,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:14:09,436 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:09,440 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:09,440 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:14:09,452 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:09,454 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 15:14:09,454 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:09,464 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:09,464 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:09,465 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 15:14:09,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:09,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:14:09,473 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:23 [2018-04-11 15:14:09,496 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:09,497 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:09,498 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:09,498 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 15:14:09,499 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:09,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:14:09,508 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:09,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:09,523 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:18 [2018-04-11 15:14:09,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:14:09,537 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 15:14:09,537 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:09,539 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:09,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:14:09,549 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:14:09,549 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:09,551 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:09,558 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 15:14:09,558 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-04-11 15:14:09,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-04-11 15:14:09,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-11 15:14:09,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:09,591 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:09,599 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 15 treesize of output 11 [2018-04-11 15:14:09,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 15:14:09,608 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:09,610 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:09,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:14:09,615 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:44, output treesize:18 [2018-04-11 15:14:10,209 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:14:10,210 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:14:10,210 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-11 15:14:10,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-11 15:14:10,210 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-11 15:14:10,210 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2018-04-11 15:14:10,210 INFO L87 Difference]: Start difference. First operand 125 states and 132 transitions. Second operand 26 states. [2018-04-11 15:14:11,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:14:11,646 INFO L93 Difference]: Finished difference Result 159 states and 166 transitions. [2018-04-11 15:14:11,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 15:14:11,647 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 58 [2018-04-11 15:14:11,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:14:11,647 INFO L225 Difference]: With dead ends: 159 [2018-04-11 15:14:11,647 INFO L226 Difference]: Without dead ends: 159 [2018-04-11 15:14:11,648 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=213, Invalid=2337, Unknown=0, NotChecked=0, Total=2550 [2018-04-11 15:14:11,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-04-11 15:14:11,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 125. [2018-04-11 15:14:11,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-04-11 15:14:11,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 132 transitions. [2018-04-11 15:14:11,650 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 132 transitions. Word has length 58 [2018-04-11 15:14:11,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:14:11,650 INFO L459 AbstractCegarLoop]: Abstraction has 125 states and 132 transitions. [2018-04-11 15:14:11,650 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-11 15:14:11,651 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 132 transitions. [2018-04-11 15:14:11,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-11 15:14:11,651 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:14:11,651 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 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 15:14:11,651 INFO L408 AbstractCegarLoop]: === Iteration 47 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr12RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr17RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr13RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr8RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr9RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr10RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr15RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr11RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr16RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr14RequiresViolation]=== [2018-04-11 15:14:11,651 INFO L82 PathProgramCache]: Analyzing trace with hash -132531483, now seen corresponding path program 7 times [2018-04-11 15:14:11,652 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:14:11,652 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:14:11,652 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:14:11,652 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:14:11,652 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:14:11,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:14:11,667 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:14:11,670 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:14:11,671 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:14:11,671 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:14:11,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:14:11,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:14:11,721 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:14:11,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:14:11,730 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:11,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:14:11,736 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:11,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:11,741 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:14:11,761 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:11,762 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:11,762 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 15:14:11,763 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:11,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:14:11,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:11,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:14:11,783 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:26 [2018-04-11 15:14:11,810 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:11,811 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:11,811 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:11,812 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 15:14:11,812 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:11,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-04-11 15:14:11,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:11,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:11,828 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:23 [2018-04-11 15:14:11,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:14:11,842 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 15:14:11,842 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:11,843 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:11,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:14:11,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:14:11,857 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:11,862 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:11,870 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 15:14:11,870 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:45, output treesize:39 [2018-04-11 15:14:11,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2018-04-11 15:14:11,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2018-04-11 15:14:11,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:11,939 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:11,946 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 15 treesize of output 11 [2018-04-11 15:14:11,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 15:14:11,948 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:11,949 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:11,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:14:11,954 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:23 [2018-04-11 15:14:13,232 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:14:13,232 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:14:13,233 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-04-11 15:14:13,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-11 15:14:13,233 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-11 15:14:13,233 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=749, Unknown=0, NotChecked=0, Total=812 [2018-04-11 15:14:13,233 INFO L87 Difference]: Start difference. First operand 125 states and 132 transitions. Second operand 29 states. [2018-04-11 15:14:15,474 WARN L151 SmtUtils]: Spent 156ms on a formula simplification. DAG size of input: 63 DAG size of output 59 [2018-04-11 15:14:19,191 WARN L151 SmtUtils]: Spent 3494ms on a formula simplification. DAG size of input: 65 DAG size of output 61 [2018-04-11 15:14:19,506 WARN L151 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 65 DAG size of output 61 [2018-04-11 15:14:19,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:14:19,707 INFO L93 Difference]: Finished difference Result 144 states and 151 transitions. [2018-04-11 15:14:19,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-11 15:14:19,708 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 60 [2018-04-11 15:14:19,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:14:19,708 INFO L225 Difference]: With dead ends: 144 [2018-04-11 15:14:19,708 INFO L226 Difference]: Without dead ends: 144 [2018-04-11 15:14:19,709 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=241, Invalid=2729, Unknown=0, NotChecked=0, Total=2970 [2018-04-11 15:14:19,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-04-11 15:14:19,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 125. [2018-04-11 15:14:19,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-04-11 15:14:19,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 132 transitions. [2018-04-11 15:14:19,710 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 132 transitions. Word has length 60 [2018-04-11 15:14:19,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:14:19,710 INFO L459 AbstractCegarLoop]: Abstraction has 125 states and 132 transitions. [2018-04-11 15:14:19,710 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-11 15:14:19,711 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 132 transitions. [2018-04-11 15:14:19,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-11 15:14:19,711 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:14:19,711 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:14:19,711 INFO L408 AbstractCegarLoop]: === Iteration 48 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr12RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr17RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr13RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr8RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr9RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr10RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr15RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr11RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr16RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr14RequiresViolation]=== [2018-04-11 15:14:19,711 INFO L82 PathProgramCache]: Analyzing trace with hash -320761833, now seen corresponding path program 8 times [2018-04-11 15:14:19,711 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:14:19,711 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:14:19,712 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:14:19,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:14:19,712 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:14:19,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:14:19,721 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:14:19,724 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:14:19,724 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:14:19,724 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:14:19,725 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:14:19,758 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:14:19,758 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:14:19,761 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:14:19,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:14:19,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:19,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:14:19,793 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:19,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:19,797 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:14:19,813 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:19,814 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 15:14:19,814 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:19,826 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:19,827 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:19,827 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 15:14:19,827 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:19,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:19,836 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:14:19,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:14:19,906 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:14:19,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:14:19,913 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:27 [2018-04-11 15:14:19,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 28 treesize of output 25 [2018-04-11 15:14:19,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:14:19,928 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:19,932 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:19,946 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 24 treesize of output 21 [2018-04-11 15:14:19,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 8 treesize of output 7 [2018-04-11 15:14:19,948 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:19,951 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:19,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 30 [2018-04-11 15:14:19,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:14:19,965 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:19,970 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:19,981 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 29 treesize of output 26 [2018-04-11 15:14:19,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:14:19,982 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:19,986 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:20,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:14:20,013 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:62, output treesize:43 [2018-04-11 15:14:20,054 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 36 treesize of output 32 [2018-04-11 15:14:20,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-11 15:14:20,056 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:20,062 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:20,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-04-11 15:14:20,078 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 15:14:20,078 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:20,082 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:20,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2018-04-11 15:14:20,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 15:14:20,098 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:20,103 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:20,115 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-11 15:14:20,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 15:14:20,117 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:20,121 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:20,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 15:14:20,132 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:71, output treesize:24 [2018-04-11 15:14:20,804 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:14:20,804 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:14:20,804 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-11 15:14:20,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-11 15:14:20,805 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-11 15:14:20,805 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2018-04-11 15:14:20,805 INFO L87 Difference]: Start difference. First operand 125 states and 132 transitions. Second operand 26 states. [2018-04-11 15:14:22,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:14:22,458 INFO L93 Difference]: Finished difference Result 135 states and 142 transitions. [2018-04-11 15:14:22,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-11 15:14:22,458 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 61 [2018-04-11 15:14:22,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:14:22,459 INFO L225 Difference]: With dead ends: 135 [2018-04-11 15:14:22,459 INFO L226 Difference]: Without dead ends: 135 [2018-04-11 15:14:22,459 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=160, Invalid=2192, Unknown=0, NotChecked=0, Total=2352 [2018-04-11 15:14:22,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-04-11 15:14:22,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 125. [2018-04-11 15:14:22,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-04-11 15:14:22,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 132 transitions. [2018-04-11 15:14:22,461 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 132 transitions. Word has length 61 [2018-04-11 15:14:22,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:14:22,461 INFO L459 AbstractCegarLoop]: Abstraction has 125 states and 132 transitions. [2018-04-11 15:14:22,461 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-11 15:14:22,461 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 132 transitions. [2018-04-11 15:14:22,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-11 15:14:22,461 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:14:22,461 INFO L355 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 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 15:14:22,461 INFO L408 AbstractCegarLoop]: === Iteration 49 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr12RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr17RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr13RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr8RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr9RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr10RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr15RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr11RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr16RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr14RequiresViolation]=== [2018-04-11 15:14:22,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1962543131, now seen corresponding path program 6 times [2018-04-11 15:14:22,461 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:14:22,461 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:14:22,462 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:14:22,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:14:22,462 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:14:22,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:14:22,474 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:14:22,479 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:14:22,479 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:14:22,479 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:14:22,479 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:14:22,535 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-04-11 15:14:22,535 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:14:22,540 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:14:22,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:14:22,541 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:22,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:22,543 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 15:14:22,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:14:22,551 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:22,558 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:22,558 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:22,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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 15:14:22,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:22,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:22,565 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:26 [2018-04-11 15:14:22,583 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 15 treesize of output 12 [2018-04-11 15:14:22,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 12 treesize of output 11 [2018-04-11 15:14:22,585 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:22,586 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:22,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:22,591 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-04-11 15:14:22,640 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:22,641 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 18 treesize of output 21 [2018-04-11 15:14:22,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:22,655 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:22,655 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:22,656 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:22,657 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 15:14:22,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:22,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:22,665 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2018-04-11 15:14:22,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:14:22,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:14:22,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:22,689 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:22,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:14:22,751 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:14:22,751 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:22,753 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:22,764 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 15:14:22,764 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:51, output treesize:44 [2018-04-11 15:14:22,809 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 24 treesize of output 18 [2018-04-11 15:14:22,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-04-11 15:14:22,811 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:22,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:22,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2018-04-11 15:14:22,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 15:14:22,829 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:22,831 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:22,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:14:22,840 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:58, output treesize:32 [2018-04-11 15:14:22,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-04-11 15:14:22,905 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:14:22,906 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:22,910 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:22,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:14:22,918 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:32 [2018-04-11 15:14:22,963 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 23 treesize of output 24 [2018-04-11 15:14:22,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:14:22,965 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:22,968 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:22,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:14:22,974 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:29 [2018-04-11 15:14:23,023 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 23 treesize of output 24 [2018-04-11 15:14:23,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:14:23,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:23,028 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:23,033 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 15:14:23,033 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:29 [2018-04-11 15:14:23,038 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 23 treesize of output 24 [2018-04-11 15:14:23,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:14:23,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:23,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:23,047 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 15:14:23,047 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:40, output treesize:29 [2018-04-11 15:14:23,071 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 23 treesize of output 24 [2018-04-11 15:14:23,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:14:23,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:23,075 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:23,081 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 15:14:23,081 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:40, output treesize:21 [2018-04-11 15:14:23,127 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 21 treesize of output 17 [2018-04-11 15:14:23,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-04-11 15:14:23,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:14:23,133 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:14:23,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 15:14:23,139 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:50 [2018-04-11 15:14:23,241 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-04-11 15:14:23,242 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:14:23,242 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-11 15:14:23,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 15:14:23,242 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 15:14:23,242 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2018-04-11 15:14:23,242 INFO L87 Difference]: Start difference. First operand 125 states and 132 transitions. Second operand 24 states. [2018-04-11 15:14:24,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:14:24,183 INFO L93 Difference]: Finished difference Result 124 states and 131 transitions. [2018-04-11 15:14:24,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 15:14:24,184 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 61 [2018-04-11 15:14:24,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:14:24,184 INFO L225 Difference]: With dead ends: 124 [2018-04-11 15:14:24,184 INFO L226 Difference]: Without dead ends: 124 [2018-04-11 15:14:24,185 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=237, Invalid=1569, Unknown=0, NotChecked=0, Total=1806 [2018-04-11 15:14:24,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-04-11 15:14:24,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-04-11 15:14:24,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-04-11 15:14:24,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 131 transitions. [2018-04-11 15:14:24,187 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 131 transitions. Word has length 61 [2018-04-11 15:14:24,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:14:24,187 INFO L459 AbstractCegarLoop]: Abstraction has 124 states and 131 transitions. [2018-04-11 15:14:24,187 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 15:14:24,187 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 131 transitions. [2018-04-11 15:14:24,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-11 15:14:24,187 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:14:24,187 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 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 15:14:24,187 INFO L408 AbstractCegarLoop]: === Iteration 50 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr12RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr17RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr13RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr8RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr9RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr10RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr15RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr11RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr16RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr14RequiresViolation]=== [2018-04-11 15:14:24,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1396914445, now seen corresponding path program 6 times [2018-04-11 15:14:24,188 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:14:24,188 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:14:24,188 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:14:24,188 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:14:24,188 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:14:24,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:14:24,198 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:14:24,202 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:14:24,202 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:14:24,202 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:14:24,203 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:14:24,257 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-04-11 15:14:24,257 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:14:24,262 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:14:24,274 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:14:24,275 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:24,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:14:24,281 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:24,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:24,287 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:14:24,306 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:24,307 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 15:14:24,308 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:24,321 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:24,321 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:24,322 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 15:14:24,322 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:24,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:14:24,333 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:26 [2018-04-11 15:14:24,362 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:24,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:14:24,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:24,378 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:24,379 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:24,379 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:24,380 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 15:14:24,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:24,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:24,389 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:21 [2018-04-11 15:14:24,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:14:24,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:14:24,407 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:24,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:24,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:14:24,438 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 15:14:24,439 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:24,440 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:24,447 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 15:14:24,447 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:43, output treesize:33 [2018-04-11 15:14:24,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-04-11 15:14:24,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-11 15:14:24,473 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:24,475 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:24,483 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 15 treesize of output 11 [2018-04-11 15:14:24,484 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 15:14:24,484 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:24,485 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:24,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:14:24,490 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:21 [2018-04-11 15:14:26,365 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:14:26,366 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:14:26,366 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-11 15:14:26,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-11 15:14:26,366 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-11 15:14:26,366 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=698, Unknown=0, NotChecked=0, Total=756 [2018-04-11 15:14:26,366 INFO L87 Difference]: Start difference. First operand 124 states and 131 transitions. Second operand 28 states. [2018-04-11 15:14:27,963 WARN L151 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 65 DAG size of output 61 [2018-04-11 15:14:28,193 WARN L151 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 67 DAG size of output 63 [2018-04-11 15:14:33,076 WARN L151 SmtUtils]: Spent 141ms on a formula simplification. DAG size of input: 71 DAG size of output 67 [2018-04-11 15:14:33,275 WARN L151 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 74 DAG size of output 68 [2018-04-11 15:14:33,495 WARN L151 SmtUtils]: Spent 138ms on a formula simplification. DAG size of input: 70 DAG size of output 66 [2018-04-11 15:14:33,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:14:33,855 INFO L93 Difference]: Finished difference Result 154 states and 161 transitions. [2018-04-11 15:14:33,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-11 15:14:33,855 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 62 [2018-04-11 15:14:33,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:14:33,856 INFO L225 Difference]: With dead ends: 154 [2018-04-11 15:14:33,856 INFO L226 Difference]: Without dead ends: 154 [2018-04-11 15:14:33,856 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=224, Invalid=2531, Unknown=1, NotChecked=0, Total=2756 [2018-04-11 15:14:33,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-04-11 15:14:33,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 129. [2018-04-11 15:14:33,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-11 15:14:33,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 136 transitions. [2018-04-11 15:14:33,858 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 136 transitions. Word has length 62 [2018-04-11 15:14:33,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:14:33,858 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 136 transitions. [2018-04-11 15:14:33,858 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-11 15:14:33,858 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 136 transitions. [2018-04-11 15:14:33,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-11 15:14:33,858 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:14:33,858 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 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 15:14:33,858 INFO L408 AbstractCegarLoop]: === Iteration 51 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr12RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr17RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr13RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr8RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr9RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr10RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr15RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr11RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr16RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr14RequiresViolation]=== [2018-04-11 15:14:33,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1390597087, now seen corresponding path program 5 times [2018-04-11 15:14:33,858 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:14:33,858 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:14:33,859 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:14:33,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:14:33,859 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:14:33,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:14:33,867 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:14:33,871 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:14:33,871 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:14:33,871 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:14:33,871 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:14:33,922 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-04-11 15:14:33,922 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:14:33,927 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:14:33,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:14:33,931 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:33,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:14:33,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:33,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:33,940 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:14:33,961 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:33,961 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:33,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-11 15:14:33,962 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:33,968 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 15:14:33,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:33,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:33,973 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:14:33,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 18 [2018-04-11 15:14:33,990 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:14:34,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:14:34,020 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:33 [2018-04-11 15:14:34,043 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 36 [2018-04-11 15:14:34,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:14:34,045 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:34,055 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:34,083 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 35 treesize of output 32 [2018-04-11 15:14:34,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:14:34,085 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:34,094 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:34,120 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 34 treesize of output 31 [2018-04-11 15:14:34,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 15:14:34,122 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:34,129 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:34,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 27 [2018-04-11 15:14:34,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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 15:14:34,153 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:34,160 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:34,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:14:34,174 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:74, output treesize:49 [2018-04-11 15:14:34,207 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 35 [2018-04-11 15:14:34,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-11 15:14:34,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:34,213 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:34,225 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 28 treesize of output 24 [2018-04-11 15:14:34,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 15:14:34,226 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:34,229 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:34,240 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 37 treesize of output 33 [2018-04-11 15:14:34,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 15:14:34,242 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:34,246 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:34,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-04-11 15:14:34,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 15:14:34,256 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:34,259 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:34,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 15:14:34,268 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:77, output treesize:30 [2018-04-11 15:14:36,054 WARN L148 SmtUtils]: Spent 329ms on a formula simplification that was a NOOP. DAG size: 44 [2018-04-11 15:14:36,810 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:14:36,810 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:14:36,869 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-04-11 15:14:36,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-11 15:14:36,869 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-11 15:14:36,870 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=989, Unknown=0, NotChecked=0, Total=1056 [2018-04-11 15:14:36,870 INFO L87 Difference]: Start difference. First operand 129 states and 136 transitions. Second operand 33 states. [2018-04-11 15:14:38,796 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 46 DAG size of output 45 [2018-04-11 15:14:39,004 WARN L151 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 47 DAG size of output 46 [2018-04-11 15:14:39,558 WARN L151 SmtUtils]: Spent 183ms on a formula simplification. DAG size of input: 50 DAG size of output 49 [2018-04-11 15:14:39,833 WARN L151 SmtUtils]: Spent 157ms on a formula simplification. DAG size of input: 51 DAG size of output 50 [2018-04-11 15:14:40,186 WARN L151 SmtUtils]: Spent 178ms on a formula simplification. DAG size of input: 56 DAG size of output 55 [2018-04-11 15:14:41,621 WARN L151 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 59 DAG size of output 58 [2018-04-11 15:14:41,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:14:41,674 INFO L93 Difference]: Finished difference Result 145 states and 153 transitions. [2018-04-11 15:14:41,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-11 15:14:41,675 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 62 [2018-04-11 15:14:41,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:14:41,675 INFO L225 Difference]: With dead ends: 145 [2018-04-11 15:14:41,675 INFO L226 Difference]: Without dead ends: 145 [2018-04-11 15:14:41,675 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 622 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=209, Invalid=3697, Unknown=0, NotChecked=0, Total=3906 [2018-04-11 15:14:41,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-04-11 15:14:41,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 131. [2018-04-11 15:14:41,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-04-11 15:14:41,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 139 transitions. [2018-04-11 15:14:41,677 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 139 transitions. Word has length 62 [2018-04-11 15:14:41,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:14:41,677 INFO L459 AbstractCegarLoop]: Abstraction has 131 states and 139 transitions. [2018-04-11 15:14:41,678 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-11 15:14:41,678 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 139 transitions. [2018-04-11 15:14:41,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-11 15:14:41,678 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:14:41,678 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 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 15:14:41,678 INFO L408 AbstractCegarLoop]: === Iteration 52 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr12RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr17RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr13RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr8RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr9RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr10RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr15RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr11RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr16RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr14RequiresViolation]=== [2018-04-11 15:14:41,678 INFO L82 PathProgramCache]: Analyzing trace with hash -709294917, now seen corresponding path program 6 times [2018-04-11 15:14:41,679 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:14:41,679 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:14:41,679 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:14:41,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:14:41,679 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:14:41,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:14:41,690 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:14:41,694 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:14:41,694 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:14:41,694 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:14:41,694 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:14:41,733 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-04-11 15:14:41,733 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:14:41,738 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:14:41,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:14:41,742 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:41,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:14:41,748 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:41,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:41,754 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:14:41,771 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:41,772 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 15:14:41,772 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:41,784 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:41,785 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:41,785 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 15:14:41,786 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:41,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:14:41,795 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:26 [2018-04-11 15:14:41,825 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:41,870 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 17 treesize of output 20 [2018-04-11 15:14:41,870 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:41,881 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:41,881 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:41,882 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:41,882 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 15:14:41,882 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:41,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:41,889 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:23 [2018-04-11 15:14:41,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:14:41,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:14:41,900 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:41,902 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:41,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:14:41,910 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 15:14:41,910 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:41,911 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:41,916 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 15:14:41,916 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:42, output treesize:39 [2018-04-11 15:14:41,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2018-04-11 15:14:41,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2018-04-11 15:14:41,940 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:41,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:41,949 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 15 treesize of output 11 [2018-04-11 15:14:41,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 15:14:41,950 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:41,951 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:41,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:14:41,955 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:23 [2018-04-11 15:14:44,275 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:14:44,276 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:14:44,276 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-04-11 15:14:44,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-11 15:14:44,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-11 15:14:44,276 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=924, Unknown=0, NotChecked=0, Total=992 [2018-04-11 15:14:44,276 INFO L87 Difference]: Start difference. First operand 131 states and 139 transitions. Second operand 32 states. [2018-04-11 15:14:46,360 WARN L151 SmtUtils]: Spent 473ms on a formula simplification. DAG size of input: 54 DAG size of output 50 [2018-04-11 15:14:46,793 WARN L151 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 58 DAG size of output 54 [2018-04-11 15:14:47,192 WARN L151 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 62 DAG size of output 58 [2018-04-11 15:14:47,435 WARN L151 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 65 DAG size of output 59 [2018-04-11 15:14:48,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:14:48,450 INFO L93 Difference]: Finished difference Result 147 states and 156 transitions. [2018-04-11 15:14:48,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-11 15:14:48,451 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2018-04-11 15:14:48,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:14:48,451 INFO L225 Difference]: With dead ends: 147 [2018-04-11 15:14:48,451 INFO L226 Difference]: Without dead ends: 147 [2018-04-11 15:14:48,451 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 592 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=269, Invalid=3513, Unknown=0, NotChecked=0, Total=3782 [2018-04-11 15:14:48,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-04-11 15:14:48,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 136. [2018-04-11 15:14:48,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-04-11 15:14:48,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 144 transitions. [2018-04-11 15:14:48,453 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 144 transitions. Word has length 62 [2018-04-11 15:14:48,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:14:48,453 INFO L459 AbstractCegarLoop]: Abstraction has 136 states and 144 transitions. [2018-04-11 15:14:48,453 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-11 15:14:48,453 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 144 transitions. [2018-04-11 15:14:48,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-04-11 15:14:48,454 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:14:48,454 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:14:48,454 INFO L408 AbstractCegarLoop]: === Iteration 53 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr12RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr17RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr13RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr8RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr9RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr10RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr15RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr11RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr16RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr14RequiresViolation]=== [2018-04-11 15:14:48,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1476451343, now seen corresponding path program 9 times [2018-04-11 15:14:48,454 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:14:48,454 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:14:48,454 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:14:48,454 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:14:48,454 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:14:48,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:14:48,468 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:14:48,474 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:14:48,475 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:14:48,475 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:14:48,475 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:14:48,519 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-04-11 15:14:48,520 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:14:48,524 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:14:48,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:14:48,527 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:48,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:14:48,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:48,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:48,536 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:14:48,546 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:48,547 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 15:14:48,547 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:48,553 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:48,553 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:48,554 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 15:14:48,554 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:48,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:48,557 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:14:48,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:14:48,568 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:14:48,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:14:48,574 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:27 [2018-04-11 15:14:48,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 30 [2018-04-11 15:14:48,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:14:48,587 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:48,591 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:48,603 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 28 treesize of output 25 [2018-04-11 15:14:48,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:14:48,604 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:48,607 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:48,618 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 24 treesize of output 21 [2018-04-11 15:14:48,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:14:48,619 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:48,621 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:48,631 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 29 treesize of output 26 [2018-04-11 15:14:48,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:14:48,632 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:48,636 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:48,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:14:48,643 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:62, output treesize:43 [2018-04-11 15:14:48,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2018-04-11 15:14:48,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 15:14:48,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:48,672 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:48,681 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 36 treesize of output 32 [2018-04-11 15:14:48,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-11 15:14:48,682 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:48,686 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:48,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-04-11 15:14:48,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 15:14:48,695 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:48,697 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:48,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-04-11 15:14:48,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 15:14:48,705 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:48,707 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:48,713 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 15:14:48,713 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:71, output treesize:24 [2018-04-11 15:14:49,157 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:14:49,158 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:14:49,158 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-11 15:14:49,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-11 15:14:49,158 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-11 15:14:49,158 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=650, Unknown=0, NotChecked=0, Total=702 [2018-04-11 15:14:49,158 INFO L87 Difference]: Start difference. First operand 136 states and 144 transitions. Second operand 27 states. [2018-04-11 15:14:51,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:14:51,058 INFO L93 Difference]: Finished difference Result 166 states and 174 transitions. [2018-04-11 15:14:51,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-11 15:14:51,058 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 63 [2018-04-11 15:14:51,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:14:51,059 INFO L225 Difference]: With dead ends: 166 [2018-04-11 15:14:51,059 INFO L226 Difference]: Without dead ends: 166 [2018-04-11 15:14:51,059 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=159, Invalid=2291, Unknown=0, NotChecked=0, Total=2450 [2018-04-11 15:14:51,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-04-11 15:14:51,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 136. [2018-04-11 15:14:51,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-04-11 15:14:51,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 144 transitions. [2018-04-11 15:14:51,061 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 144 transitions. Word has length 63 [2018-04-11 15:14:51,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:14:51,061 INFO L459 AbstractCegarLoop]: Abstraction has 136 states and 144 transitions. [2018-04-11 15:14:51,061 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-11 15:14:51,061 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 144 transitions. [2018-04-11 15:14:51,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-11 15:14:51,062 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:14:51,062 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 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 15:14:51,062 INFO L408 AbstractCegarLoop]: === Iteration 54 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr12RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr17RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr13RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr8RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr9RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr10RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr15RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr11RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr16RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr14RequiresViolation]=== [2018-04-11 15:14:51,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1705955571, now seen corresponding path program 7 times [2018-04-11 15:14:51,062 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:14:51,062 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:14:51,063 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:14:51,063 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:14:51,063 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:14:51,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:14:51,078 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:14:51,082 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:14:51,082 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:14:51,082 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:14:51,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:14:51,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:14:51,124 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:14:51,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:14:51,134 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:51,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:14:51,141 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:51,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:51,146 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:14:51,164 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:51,165 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 15:14:51,165 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:51,178 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:51,179 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:51,179 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 15:14:51,180 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:51,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:14:51,190 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:26 [2018-04-11 15:14:51,219 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:51,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-04-11 15:14:51,221 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:51,235 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:51,236 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:51,236 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:51,237 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 15:14:51,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:51,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:51,247 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:23 [2018-04-11 15:14:51,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:14:51,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:14:51,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:51,267 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:51,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:14:51,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:14:51,282 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:51,284 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:51,292 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 15:14:51,292 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:45, output treesize:39 [2018-04-11 15:14:51,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2018-04-11 15:14:51,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2018-04-11 15:14:51,318 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:51,321 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:51,326 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 15 treesize of output 11 [2018-04-11 15:14:51,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 15:14:51,328 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:51,329 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:51,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:14:51,333 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:23 [2018-04-11 15:14:52,879 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:14:52,879 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:14:52,879 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-04-11 15:14:52,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-11 15:14:52,879 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-11 15:14:52,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=809, Unknown=0, NotChecked=0, Total=870 [2018-04-11 15:14:52,879 INFO L87 Difference]: Start difference. First operand 136 states and 144 transitions. Second operand 30 states. [2018-04-11 15:14:54,456 WARN L151 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 63 DAG size of output 59 [2018-04-11 15:14:54,640 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 65 DAG size of output 61 [2018-04-11 15:14:54,957 WARN L151 SmtUtils]: Spent 167ms on a formula simplification. DAG size of input: 68 DAG size of output 64 [2018-04-11 15:14:55,226 WARN L151 SmtUtils]: Spent 165ms on a formula simplification. DAG size of input: 70 DAG size of output 66 [2018-04-11 15:14:55,853 WARN L151 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 77 DAG size of output 73 [2018-04-11 15:14:56,042 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 79 DAG size of output 75 [2018-04-11 15:14:56,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:14:56,099 INFO L93 Difference]: Finished difference Result 171 states and 179 transitions. [2018-04-11 15:14:56,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-11 15:14:56,099 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 67 [2018-04-11 15:14:56,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:14:56,100 INFO L225 Difference]: With dead ends: 171 [2018-04-11 15:14:56,100 INFO L226 Difference]: Without dead ends: 171 [2018-04-11 15:14:56,100 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=235, Invalid=2957, Unknown=0, NotChecked=0, Total=3192 [2018-04-11 15:14:56,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-04-11 15:14:56,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 141. [2018-04-11 15:14:56,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-04-11 15:14:56,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 149 transitions. [2018-04-11 15:14:56,101 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 149 transitions. Word has length 67 [2018-04-11 15:14:56,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:14:56,101 INFO L459 AbstractCegarLoop]: Abstraction has 141 states and 149 transitions. [2018-04-11 15:14:56,101 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-11 15:14:56,102 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 149 transitions. [2018-04-11 15:14:56,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-04-11 15:14:56,102 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:14:56,102 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:14:56,102 INFO L408 AbstractCegarLoop]: === Iteration 55 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr12RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr17RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr13RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr8RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr9RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr10RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr15RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr11RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr16RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr14RequiresViolation]=== [2018-04-11 15:14:56,102 INFO L82 PathProgramCache]: Analyzing trace with hash -712478039, now seen corresponding path program 10 times [2018-04-11 15:14:56,102 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:14:56,102 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:14:56,103 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:14:56,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:14:56,103 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:14:56,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:14:56,113 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:14:56,119 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:14:56,120 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:14:56,120 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:14:56,120 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:14:56,164 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:14:56,164 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:14:56,169 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:14:56,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:14:56,184 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:56,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:14:56,189 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:56,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:56,192 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:14:56,202 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:56,203 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:56,203 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 15:14:56,204 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:56,209 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 15:14:56,209 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:56,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:56,213 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-11 15:14:56,253 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 2 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:14:56,254 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:14:56,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:14:56,262 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:35 [2018-04-11 15:14:56,277 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 37 treesize of output 34 [2018-04-11 15:14:56,278 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 15:14:56,279 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:56,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:56,299 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 32 treesize of output 29 [2018-04-11 15:14:56,300 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 15:14:56,301 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:56,304 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:56,317 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 28 treesize of output 25 [2018-04-11 15:14:56,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:14:56,318 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:56,321 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:56,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 30 [2018-04-11 15:14:56,333 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:14:56,333 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:56,337 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:56,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:14:56,346 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:70, output treesize:55 [2018-04-11 15:14:56,378 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 38 treesize of output 34 [2018-04-11 15:14:56,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 15:14:56,379 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:56,383 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:56,394 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 27 treesize of output 23 [2018-04-11 15:14:56,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 15:14:56,395 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:56,398 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:56,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2018-04-11 15:14:56,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-11 15:14:56,409 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:56,414 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:56,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 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 15:14:56,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 15:14:56,423 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:56,426 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:56,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 15:14:56,433 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:83, output treesize:32 [2018-04-11 15:14:56,942 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 103 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:14:56,942 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:14:56,942 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-04-11 15:14:56,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-11 15:14:56,942 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-11 15:14:56,942 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-04-11 15:14:56,942 INFO L87 Difference]: Start difference. First operand 141 states and 149 transitions. Second operand 30 states. [2018-04-11 15:14:59,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:14:59,355 INFO L93 Difference]: Finished difference Result 186 states and 195 transitions. [2018-04-11 15:14:59,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-11 15:14:59,356 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 68 [2018-04-11 15:14:59,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:14:59,356 INFO L225 Difference]: With dead ends: 186 [2018-04-11 15:14:59,356 INFO L226 Difference]: Without dead ends: 186 [2018-04-11 15:14:59,356 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=185, Invalid=3007, Unknown=0, NotChecked=0, Total=3192 [2018-04-11 15:14:59,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-04-11 15:14:59,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 147. [2018-04-11 15:14:59,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-04-11 15:14:59,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 157 transitions. [2018-04-11 15:14:59,358 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 157 transitions. Word has length 68 [2018-04-11 15:14:59,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:14:59,358 INFO L459 AbstractCegarLoop]: Abstraction has 147 states and 157 transitions. [2018-04-11 15:14:59,358 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-11 15:14:59,358 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 157 transitions. [2018-04-11 15:14:59,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-04-11 15:14:59,358 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:14:59,358 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 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 15:14:59,358 INFO L408 AbstractCegarLoop]: === Iteration 56 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr12RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr17RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr13RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr8RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr9RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr10RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr15RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr11RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr16RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr14RequiresViolation]=== [2018-04-11 15:14:59,358 INFO L82 PathProgramCache]: Analyzing trace with hash 754302975, now seen corresponding path program 6 times [2018-04-11 15:14:59,358 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:14:59,359 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:14:59,359 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:14:59,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:14:59,359 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:14:59,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:14:59,368 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:14:59,372 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:14:59,372 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:14:59,373 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:14:59,373 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:14:59,414 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-04-11 15:14:59,414 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:14:59,418 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:14:59,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:14:59,420 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:59,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:14:59,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:59,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:59,435 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:14:59,445 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:59,446 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 15:14:59,446 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:59,455 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:59,455 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:59,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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 15:14:59,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:59,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:14:59,463 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:26 [2018-04-11 15:14:59,513 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:59,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:14:59,515 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:59,528 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:59,529 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:59,530 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:59,530 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 15:14:59,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:59,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:59,540 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:21 [2018-04-11 15:14:59,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:14:59,556 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 15:14:59,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:59,558 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:59,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:14:59,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:14:59,567 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:59,568 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:59,574 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 15:14:59,574 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:40, output treesize:33 [2018-04-11 15:14:59,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-04-11 15:14:59,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-11 15:14:59,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:59,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:59,610 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 15 treesize of output 11 [2018-04-11 15:14:59,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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 15:14:59,612 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:59,613 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:59,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:14:59,618 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:21 [2018-04-11 15:15:00,100 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:15:00,100 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:15:00,100 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-04-11 15:15:00,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-11 15:15:00,100 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-11 15:15:00,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=811, Unknown=0, NotChecked=0, Total=870 [2018-04-11 15:15:00,101 INFO L87 Difference]: Start difference. First operand 147 states and 157 transitions. Second operand 30 states. [2018-04-11 15:15:02,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:15:02,215 INFO L93 Difference]: Finished difference Result 151 states and 160 transitions. [2018-04-11 15:15:02,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-11 15:15:02,215 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 68 [2018-04-11 15:15:02,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:15:02,216 INFO L225 Difference]: With dead ends: 151 [2018-04-11 15:15:02,216 INFO L226 Difference]: Without dead ends: 151 [2018-04-11 15:15:02,216 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=248, Invalid=3174, Unknown=0, NotChecked=0, Total=3422 [2018-04-11 15:15:02,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-04-11 15:15:02,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 143. [2018-04-11 15:15:02,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-04-11 15:15:02,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 152 transitions. [2018-04-11 15:15:02,218 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 152 transitions. Word has length 68 [2018-04-11 15:15:02,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:15:02,218 INFO L459 AbstractCegarLoop]: Abstraction has 143 states and 152 transitions. [2018-04-11 15:15:02,218 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-11 15:15:02,218 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 152 transitions. [2018-04-11 15:15:02,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-04-11 15:15:02,219 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:15:02,219 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 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 15:15:02,219 INFO L408 AbstractCegarLoop]: === Iteration 57 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr12RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr17RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr13RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr8RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr9RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr10RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr15RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr11RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr16RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr14RequiresViolation]=== [2018-04-11 15:15:02,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1435605145, now seen corresponding path program 7 times [2018-04-11 15:15:02,219 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:15:02,220 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:15:02,220 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:02,220 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:15:02,220 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:02,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:15:02,238 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:15:02,245 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:15:02,245 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:15:02,245 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:15:02,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:15:02,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:15:02,312 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:15:02,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:15:02,325 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:02,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:15:02,330 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:02,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:02,335 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:15:02,351 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:15:02,352 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 15:15:02,353 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:02,364 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:15:02,364 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:15:02,365 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 15:15:02,365 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:02,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:15:02,383 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:26 [2018-04-11 15:15:02,410 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:15:02,411 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:15:02,411 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:15:02,412 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 15:15:02,412 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:02,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:15:02,423 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:02,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:02,431 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:21 [2018-04-11 15:15:02,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:15:02,448 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 15:15:02,448 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:02,450 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:02,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:15:02,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:15:02,464 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:02,466 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:02,475 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 15:15:02,475 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:43, output treesize:33 [2018-04-11 15:15:02,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-04-11 15:15:02,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-11 15:15:02,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:02,512 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:02,521 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 15 treesize of output 11 [2018-04-11 15:15:02,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 15:15:02,523 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:02,524 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:02,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:15:02,530 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:21 [2018-04-11 15:15:03,855 WARN L148 SmtUtils]: Spent 210ms on a formula simplification that was a NOOP. DAG size: 49 [2018-04-11 15:15:06,581 WARN L148 SmtUtils]: Spent 152ms on a formula simplification that was a NOOP. DAG size: 52 [2018-04-11 15:15:06,920 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:15:06,920 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:15:06,920 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-04-11 15:15:06,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-11 15:15:06,921 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-11 15:15:06,921 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1112, Unknown=1, NotChecked=0, Total=1190 [2018-04-11 15:15:06,921 INFO L87 Difference]: Start difference. First operand 143 states and 152 transitions. Second operand 35 states. [2018-04-11 15:15:09,521 WARN L151 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 65 DAG size of output 61 [2018-04-11 15:15:09,840 WARN L151 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 67 DAG size of output 63 [2018-04-11 15:15:10,114 WARN L151 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 68 DAG size of output 64 [2018-04-11 15:15:10,417 WARN L151 SmtUtils]: Spent 143ms on a formula simplification. DAG size of input: 71 DAG size of output 67 [2018-04-11 15:15:10,926 WARN L151 SmtUtils]: Spent 366ms on a formula simplification. DAG size of input: 74 DAG size of output 68 [2018-04-11 15:15:11,189 WARN L151 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 70 DAG size of output 66 [2018-04-11 15:15:11,540 WARN L151 SmtUtils]: Spent 166ms on a formula simplification. DAG size of input: 71 DAG size of output 67 [2018-04-11 15:15:12,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:15:12,064 INFO L93 Difference]: Finished difference Result 161 states and 171 transitions. [2018-04-11 15:15:12,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-11 15:15:12,085 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2018-04-11 15:15:12,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:15:12,085 INFO L225 Difference]: With dead ends: 161 [2018-04-11 15:15:12,085 INFO L226 Difference]: Without dead ends: 161 [2018-04-11 15:15:12,086 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 724 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=295, Invalid=4126, Unknown=1, NotChecked=0, Total=4422 [2018-04-11 15:15:12,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-04-11 15:15:12,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 148. [2018-04-11 15:15:12,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-04-11 15:15:12,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 157 transitions. [2018-04-11 15:15:12,087 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 157 transitions. Word has length 68 [2018-04-11 15:15:12,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:15:12,087 INFO L459 AbstractCegarLoop]: Abstraction has 148 states and 157 transitions. [2018-04-11 15:15:12,087 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-11 15:15:12,087 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 157 transitions. [2018-04-11 15:15:12,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-11 15:15:12,088 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:15:12,088 INFO L355 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 1, 1, 1, 1, 1, 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 15:15:12,088 INFO L408 AbstractCegarLoop]: === Iteration 58 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr12RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr17RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr13RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr8RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr9RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr10RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr15RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr11RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr16RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr14RequiresViolation]=== [2018-04-11 15:15:12,088 INFO L82 PathProgramCache]: Analyzing trace with hash 2072836365, now seen corresponding path program 8 times [2018-04-11 15:15:12,088 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:15:12,088 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:15:12,089 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:12,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:15:12,089 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:12,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:15:12,098 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:15:12,101 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:15:12,101 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:15:12,101 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:15:12,101 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:15:12,129 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:15:12,130 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:15:12,133 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:15:12,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:15:12,137 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:12,141 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:15:12,141 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:12,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:12,144 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:15:12,155 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:15:12,156 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 15:15:12,156 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:12,163 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:15:12,164 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:15:12,164 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 15:15:12,164 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:12,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:15:12,170 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:26 [2018-04-11 15:15:12,188 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:15:12,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:15:12,189 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:12,198 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:15:12,198 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:15:12,199 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:15:12,199 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 15:15:12,199 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:12,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:12,205 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:21 [2018-04-11 15:15:12,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:15:12,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, 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 15:15:12,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:12,217 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:12,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:15:12,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:15:12,226 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:12,227 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:12,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:12,233 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:43, output treesize:33 [2018-04-11 15:15:12,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-04-11 15:15:12,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-04-11 15:15:12,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:12,259 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:12,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 15:15:12,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-04-11 15:15:12,266 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:12,267 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:12,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:15:12,271 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:21 [2018-04-11 15:15:14,257 WARN L148 SmtUtils]: Spent 115ms on a formula simplification that was a NOOP. DAG size: 58 [2018-04-11 15:15:14,708 WARN L148 SmtUtils]: Spent 122ms on a formula simplification that was a NOOP. DAG size: 62 [2018-04-11 15:15:15,051 WARN L148 SmtUtils]: Spent 143ms on a formula simplification that was a NOOP. DAG size: 61 [2018-04-11 15:15:21,980 WARN L148 SmtUtils]: Spent 254ms on a formula simplification that was a NOOP. DAG size: 61 [2018-04-11 15:15:22,297 WARN L148 SmtUtils]: Spent 178ms on a formula simplification that was a NOOP. DAG size: 65 [2018-04-11 15:15:22,325 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 171 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:15:22,325 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:15:22,326 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-04-11 15:15:22,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-11 15:15:22,326 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-11 15:15:22,326 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=924, Unknown=2, NotChecked=0, Total=992 [2018-04-11 15:15:22,326 INFO L87 Difference]: Start difference. First operand 148 states and 157 transitions. Second operand 32 states. [2018-04-11 15:15:23,951 WARN L151 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 65 DAG size of output 61 [2018-04-11 15:15:24,299 WARN L151 SmtUtils]: Spent 119ms on a formula simplification. DAG size of input: 67 DAG size of output 63 [2018-04-11 15:15:24,514 WARN L151 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 69 DAG size of output 65 [2018-04-11 15:15:24,925 WARN L151 SmtUtils]: Spent 206ms on a formula simplification. DAG size of input: 72 DAG size of output 68 [2018-04-11 15:15:25,304 WARN L151 SmtUtils]: Spent 242ms on a formula simplification. DAG size of input: 74 DAG size of output 70 [2018-04-11 15:15:26,154 WARN L151 SmtUtils]: Spent 339ms on a formula simplification. DAG size of input: 77 DAG size of output 73 [2018-04-11 15:15:26,683 WARN L151 SmtUtils]: Spent 345ms on a formula simplification. DAG size of input: 81 DAG size of output 77 [2018-04-11 15:15:27,869 WARN L151 SmtUtils]: Spent 270ms on a formula simplification. DAG size of input: 84 DAG size of output 79 [2018-04-11 15:15:28,471 WARN L151 SmtUtils]: Spent 317ms on a formula simplification. DAG size of input: 80 DAG size of output 76 [2018-04-11 15:15:35,984 WARN L151 SmtUtils]: Spent 2553ms on a formula simplification. DAG size of input: 80 DAG size of output 76 [2018-04-11 15:15:36,208 WARN L151 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 84 DAG size of output 80 [2018-04-11 15:15:36,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:15:36,271 INFO L93 Difference]: Finished difference Result 188 states and 197 transitions. [2018-04-11 15:15:36,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-11 15:15:36,271 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 72 [2018-04-11 15:15:36,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:15:36,272 INFO L225 Difference]: With dead ends: 188 [2018-04-11 15:15:36,272 INFO L226 Difference]: Without dead ends: 188 [2018-04-11 15:15:36,272 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 22.9s TimeCoverageRelationStatistics Valid=256, Invalid=3400, Unknown=4, NotChecked=0, Total=3660 [2018-04-11 15:15:36,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-04-11 15:15:36,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 153. [2018-04-11 15:15:36,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-04-11 15:15:36,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 162 transitions. [2018-04-11 15:15:36,273 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 162 transitions. Word has length 72 [2018-04-11 15:15:36,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:15:36,273 INFO L459 AbstractCegarLoop]: Abstraction has 153 states and 162 transitions. [2018-04-11 15:15:36,273 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-11 15:15:36,273 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 162 transitions. [2018-04-11 15:15:36,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-04-11 15:15:36,274 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:15:36,274 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:15:36,274 INFO L408 AbstractCegarLoop]: === Iteration 59 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr12RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr17RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr13RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr8RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr9RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr10RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr15RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr11RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr16RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr14RequiresViolation]=== [2018-04-11 15:15:36,274 INFO L82 PathProgramCache]: Analyzing trace with hash 161191665, now seen corresponding path program 11 times [2018-04-11 15:15:36,274 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:15:36,274 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:15:36,274 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:36,274 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:15:36,277 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:36,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:15:36,286 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:15:36,290 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:15:36,290 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:15:36,290 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:15:36,291 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:15:36,328 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-04-11 15:15:36,329 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:15:36,332 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:15:36,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:15:36,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:36,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:15:36,346 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:36,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:36,349 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:15:36,359 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:15:36,359 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 15:15:36,360 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:36,368 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:15:36,368 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:15:36,369 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 15:15:36,369 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:36,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:36,375 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:23 [2018-04-11 15:15:36,400 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:15:36,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:15:36,401 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:36,411 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:15:36,427 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:15:36,428 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:15:36,428 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 15:15:36,429 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:36,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:36,437 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2018-04-11 15:15:36,455 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:15:36,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:15:36,458 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:36,460 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:36,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 15:15:36,474 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:15:36,475 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:36,476 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:36,486 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 15:15:36,487 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:45, output treesize:42 [2018-04-11 15:15:36,526 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 33 treesize of output 25 [2018-04-11 15:15:36,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 14 [2018-04-11 15:15:36,528 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:36,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:36,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 11 [2018-04-11 15:15:36,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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 15:15:36,539 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:36,540 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:36,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:15:36,545 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:56, output treesize:26 [2018-04-11 15:15:36,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 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 15:15:36,726 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:36,730 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 15:15:36,730 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:20 [2018-04-11 15:15:37,125 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:15:37,126 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:15:37,149 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-04-11 15:15:37,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-11 15:15:37,149 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-11 15:15:37,150 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=1054, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 15:15:37,150 INFO L87 Difference]: Start difference. First operand 153 states and 162 transitions. Second operand 34 states. [2018-04-11 15:15:39,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:15:39,430 INFO L93 Difference]: Finished difference Result 203 states and 213 transitions. [2018-04-11 15:15:39,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-11 15:15:39,431 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 73 [2018-04-11 15:15:39,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:15:39,431 INFO L225 Difference]: With dead ends: 203 [2018-04-11 15:15:39,431 INFO L226 Difference]: Without dead ends: 203 [2018-04-11 15:15:39,432 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=283, Invalid=4139, Unknown=0, NotChecked=0, Total=4422 [2018-04-11 15:15:39,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-04-11 15:15:39,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 159. [2018-04-11 15:15:39,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-04-11 15:15:39,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 170 transitions. [2018-04-11 15:15:39,434 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 170 transitions. Word has length 73 [2018-04-11 15:15:39,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:15:39,434 INFO L459 AbstractCegarLoop]: Abstraction has 159 states and 170 transitions. [2018-04-11 15:15:39,434 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-11 15:15:39,434 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 170 transitions. [2018-04-11 15:15:39,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-11 15:15:39,435 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:15:39,435 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 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 15:15:39,435 INFO L408 AbstractCegarLoop]: === Iteration 60 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr12RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr17RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr13RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr8RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr9RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr10RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr15RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr11RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr16RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstpncpy_alloca_true_valid_memsafety_true_termination_i__cstpncpyErr14RequiresViolation]=== [2018-04-11 15:15:39,435 INFO L82 PathProgramCache]: Analyzing trace with hash 2122020189, now seen corresponding path program 7 times [2018-04-11 15:15:39,435 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:15:39,436 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:15:39,436 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:39,436 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:15:39,436 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:39,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:15:39,453 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:15:39,459 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:15:39,459 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:15:39,459 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:15:39,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:15:39,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:15:39,523 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:15:39,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:15:39,530 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:39,535 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 15:15:39,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:39,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:39,539 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:15:39,551 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:15:39,552 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 15:15:39,552 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:39,560 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:15:39,561 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:15:39,561 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 15:15:39,561 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:39,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:39,566 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:15:39,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 18 [2018-04-11 15:15:39,584 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:15:39,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:15:39,593 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:33 [2018-04-11 15:15:39,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 31 [2018-04-11 15:15:39,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:15:39,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:39,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:39,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 27 [2018-04-11 15:15:39,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:15:39,640 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:39,645 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:39,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 39 treesize of output 36 [2018-04-11 15:15:39,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:15:39,664 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:39,671 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:39,685 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 35 treesize of output 32 [2018-04-11 15:15:39,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:15:39,686 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:39,691 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:39,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:15:39,702 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:74, output treesize:49 [2018-04-11 15:15:39,730 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 37 treesize of output 33 [2018-04-11 15:15:39,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 15:15:39,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:39,736 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:39,749 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-04-11 15:15:39,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable 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 15:15:39,750 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:39,755 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:39,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:15:39,767 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:77, output treesize:55 [2018-04-11 15:15:39,804 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 28 treesize of output 24 [2018-04-11 15:15:39,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-04-11 15:15:39,805 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:39,808 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:39,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-04-11 15:15:39,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 15:15:39,827 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:39,830 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:39,838 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 2 xjuncts. [2018-04-11 15:15:39,838 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:55, output treesize:30 [2018-04-11 15:15:41,022 WARN L148 SmtUtils]: Spent 108ms on a formula simplification that was a NOOP. DAG size: 43 [2018-04-11 15:15:43,728 WARN L148 SmtUtils]: Spent 2190ms on a formula simplification that was a NOOP. DAG size: 45 [2018-04-11 15:15:44,071 WARN L148 SmtUtils]: Spent 204ms on a formula simplification that was a NOOP. DAG size: 48 [2018-04-11 15:15:44,338 WARN L148 SmtUtils]: Spent 112ms on a formula simplification that was a NOOP. DAG size: 49 [2018-04-11 15:15:44,814 WARN L148 SmtUtils]: Spent 150ms on a formula simplification that was a NOOP. DAG size: 54 [2018-04-11 15:15:46,062 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:15:46,062 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:15:46,062 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-04-11 15:15:46,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-11 15:15:46,063 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-11 15:15:46,063 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1402, Unknown=0, NotChecked=0, Total=1482 [2018-04-11 15:15:46,063 INFO L87 Difference]: Start difference. First operand 159 states and 170 transitions. Second operand 39 states. [2018-04-11 15:15:48,706 WARN L151 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 47 DAG size of output 46 [2018-04-11 15:15:48,952 WARN L151 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 47 DAG size of output 46 [2018-04-11 15:15:49,299 WARN L151 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 50 DAG size of output 49 [2018-04-11 15:15:49,626 WARN L151 SmtUtils]: Spent 177ms on a formula simplification. DAG size of input: 51 DAG size of output 50 [2018-04-11 15:15:50,446 WARN L151 SmtUtils]: Spent 230ms on a formula simplification. DAG size of input: 52 DAG size of output 51 [2018-04-11 15:15:51,034 WARN L151 SmtUtils]: Spent 167ms on a formula simplification. DAG size of input: 55 DAG size of output 54 [2018-04-11 15:15:51,484 WARN L151 SmtUtils]: Spent 247ms on a formula simplification. DAG size of input: 56 DAG size of output 55 [2018-04-11 15:15:54,283 WARN L151 SmtUtils]: Spent 270ms on a formula simplification. DAG size of input: 57 DAG size of output 56 [2018-04-11 15:15:57,079 WARN L151 SmtUtils]: Spent 327ms on a formula simplification. DAG size of input: 60 DAG size of output 59 [2018-04-11 15:15:57,816 WARN L151 SmtUtils]: Spent 361ms on a formula simplification. DAG size of input: 61 DAG size of output 60 [2018-04-11 15:16:00,317 WARN L151 SmtUtils]: Spent 1726ms on a formula simplification. DAG size of input: 66 DAG size of output 65 [2018-04-11 15:16:00,604 WARN L151 SmtUtils]: Spent 139ms on a formula simplification. DAG size of input: 72 DAG size of output 64 [2018-04-11 15:16:01,202 WARN L151 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 64 DAG size of output 63 [2018-04-11 15:16:01,481 WARN L151 SmtUtils]: Spent 151ms on a formula simplification. DAG size of input: 66 DAG size of output 65 [2018-04-11 15:16:04,135 WARN L151 SmtUtils]: Spent 211ms on a formula simplification. DAG size of input: 68 DAG size of output 67 [2018-04-11 15:16:04,479 WARN L151 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 67 DAG size of output 66 Received shutdown request... [2018-04-11 15:16:04,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-11 15:16:04,522 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-11 15:16:04,524 WARN L197 ceAbstractionStarter]: Timeout [2018-04-11 15:16:04,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 03:16:04 BoogieIcfgContainer [2018-04-11 15:16:04,524 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 15:16:04,525 INFO L168 Benchmark]: Toolchain (without parser) took 177302.44 ms. Allocated memory was 404.2 MB in the beginning and 1.2 GB in the end (delta: 821.6 MB). Free memory was 337.6 MB in the beginning and 1.1 GB in the end (delta: -774.9 MB). Peak memory consumption was 804.8 MB. Max. memory is 5.3 GB. [2018-04-11 15:16:04,526 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 404.2 MB. Free memory is still 362.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 15:16:04,526 INFO L168 Benchmark]: CACSL2BoogieTranslator took 248.85 ms. Allocated memory is still 404.2 MB. Free memory was 336.2 MB in the beginning and 309.8 MB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 5.3 GB. [2018-04-11 15:16:04,526 INFO L168 Benchmark]: Boogie Preprocessor took 41.29 ms. Allocated memory is still 404.2 MB. Free memory was 309.8 MB in the beginning and 307.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-11 15:16:04,526 INFO L168 Benchmark]: RCFGBuilder took 391.69 ms. Allocated memory was 404.2 MB in the beginning and 593.5 MB in the end (delta: 189.3 MB). Free memory was 307.2 MB in the beginning and 524.5 MB in the end (delta: -217.3 MB). Peak memory consumption was 24.2 MB. Max. memory is 5.3 GB. [2018-04-11 15:16:04,526 INFO L168 Benchmark]: TraceAbstraction took 176617.35 ms. Allocated memory was 593.5 MB in the beginning and 1.2 GB in the end (delta: 632.3 MB). Free memory was 523.1 MB in the beginning and 1.1 GB in the end (delta: -589.4 MB). Peak memory consumption was 801.0 MB. Max. memory is 5.3 GB. [2018-04-11 15:16:04,527 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 404.2 MB. Free memory is still 362.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 248.85 ms. Allocated memory is still 404.2 MB. Free memory was 336.2 MB in the beginning and 309.8 MB in the end (delta: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 41.29 ms. Allocated memory is still 404.2 MB. Free memory was 309.8 MB in the beginning and 307.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 391.69 ms. Allocated memory was 404.2 MB in the beginning and 593.5 MB in the end (delta: 189.3 MB). Free memory was 307.2 MB in the beginning and 524.5 MB in the end (delta: -217.3 MB). Peak memory consumption was 24.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 176617.35 ms. Allocated memory was 593.5 MB in the beginning and 1.2 GB in the end (delta: 632.3 MB). Free memory was 523.1 MB in the beginning and 1.1 GB in the end (delta: -589.4 MB). Peak memory consumption was 801.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 569]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 569). Cancelled while BasicCegarLoop was constructing difference of abstraction (159states) and interpolant automaton (currently 39 states, 39 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 72 known predicates. - TimeoutResultAtElement [Line: 558]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 558). Cancelled while BasicCegarLoop was constructing difference of abstraction (159states) and interpolant automaton (currently 39 states, 39 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 72 known predicates. - TimeoutResultAtElement [Line: 569]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 569). Cancelled while BasicCegarLoop was constructing difference of abstraction (159states) and interpolant automaton (currently 39 states, 39 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 72 known predicates. - TimeoutResultAtElement [Line: 544]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (159states) and interpolant automaton (currently 39 states, 39 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 72 known predicates. - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (159states) and interpolant automaton (currently 39 states, 39 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 72 known predicates. - TimeoutResultAtElement [Line: 556]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was constructing difference of abstraction (159states) and interpolant automaton (currently 39 states, 39 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 72 known predicates. - TimeoutResultAtElement [Line: 544]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was constructing difference of abstraction (159states) and interpolant automaton (currently 39 states, 39 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 72 known predicates. - TimeoutResultAtElement [Line: 546]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was constructing difference of abstraction (159states) and interpolant automaton (currently 39 states, 39 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 72 known predicates. - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (159states) and interpolant automaton (currently 39 states, 39 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 72 known predicates. - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (159states) and interpolant automaton (currently 39 states, 39 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 72 known predicates. - TimeoutResultAtElement [Line: 540]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was constructing difference of abstraction (159states) and interpolant automaton (currently 39 states, 39 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 72 known predicates. - TimeoutResultAtElement [Line: 540]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 540). Cancelled while BasicCegarLoop was constructing difference of abstraction (159states) and interpolant automaton (currently 39 states, 39 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 72 known predicates. - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (159states) and interpolant automaton (currently 39 states, 39 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 72 known predicates. - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (159states) and interpolant automaton (currently 39 states, 39 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 72 known predicates. - TimeoutResultAtElement [Line: 551]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 551). Cancelled while BasicCegarLoop was constructing difference of abstraction (159states) and interpolant automaton (currently 39 states, 39 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 72 known predicates. - TimeoutResultAtElement [Line: 546]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was constructing difference of abstraction (159states) and interpolant automaton (currently 39 states, 39 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 72 known predicates. - TimeoutResultAtElement [Line: 546]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was constructing difference of abstraction (159states) and interpolant automaton (currently 39 states, 39 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 72 known predicates. - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was constructing difference of abstraction (159states) and interpolant automaton (currently 39 states, 39 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 72 known predicates. - TimeoutResultAtElement [Line: 556]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 556). Cancelled while BasicCegarLoop was constructing difference of abstraction (159states) and interpolant automaton (currently 39 states, 39 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 72 known predicates. - TimeoutResultAtElement [Line: 546]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was constructing difference of abstraction (159states) and interpolant automaton (currently 39 states, 39 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 72 known predicates. - TimeoutResultAtElement [Line: 551]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 551). Cancelled while BasicCegarLoop was constructing difference of abstraction (159states) and interpolant automaton (currently 39 states, 39 states before enhancement), while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 72 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 77 locations, 21 error locations. TIMEOUT Result, 176.5s OverallTime, 60 OverallIterations, 9 TraceHistogramMax, 112.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2258 SDtfs, 5047 SDslu, 27962 SDs, 0 SdLazy, 42845 SolverSat, 1438 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 29.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3316 GetRequests, 1325 SyntacticMatches, 1 SemanticMatches, 1989 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 13370 ImplicationChecksByTransitivity, 129.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=178occurred 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, 59 MinimizatonAttempts, 1013 StatesRemovedByMinimization, 53 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 61.1s InterpolantComputationTime, 5024 NumberOfCodeBlocks, 5017 NumberOfCodeBlocksAsserted, 199 NumberOfCheckSat, 2574 ConstructedInterpolants, 1517 QuantifiedInterpolants, 3868612 SizeOfPredicates, 1091 NumberOfNonLiveVariables, 13398 ConjunctsInSsa, 4142 ConjunctsInUnsatCore, 60 InterpolantComputations, 21 PerfectInterpolantSequences, 18/2255 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_15-16-04-533.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstpncpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_15-16-04-533.csv Completed graceful shutdown