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_cstpcpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-408c70d-m [2018-04-13 04:07:16,863 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-13 04:07:16,864 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-13 04:07:16,877 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-13 04:07:16,878 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-13 04:07:16,878 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-13 04:07:16,879 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-13 04:07:16,880 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-13 04:07:16,882 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-13 04:07:16,883 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-13 04:07:16,883 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-13 04:07:16,884 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-13 04:07:16,884 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-13 04:07:16,885 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-13 04:07:16,886 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-13 04:07:16,888 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-13 04:07:16,889 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-13 04:07:16,890 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-13 04:07:16,891 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-13 04:07:16,892 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-13 04:07:16,894 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-13 04:07:16,894 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-13 04:07:16,894 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-13 04:07:16,895 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-13 04:07:16,896 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-13 04:07:16,897 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-13 04:07:16,897 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-13 04:07:16,898 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-13 04:07:16,898 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-13 04:07:16,898 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-13 04:07:16,899 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-13 04:07:16,899 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-13 04:07:16,909 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-13 04:07:16,910 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-13 04:07:16,911 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-13 04:07:16,911 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-13 04:07:16,911 INFO L133 SettingsManager]: * Use SBE=true [2018-04-13 04:07:16,911 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-13 04:07:16,911 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-13 04:07:16,911 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-13 04:07:16,912 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-13 04:07:16,912 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-13 04:07:16,912 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-13 04:07:16,912 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-13 04:07:16,912 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-13 04:07:16,912 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-13 04:07:16,913 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-13 04:07:16,913 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-13 04:07:16,913 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-13 04:07:16,913 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-13 04:07:16,913 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-13 04:07:16,913 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-13 04:07:16,914 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-13 04:07:16,914 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-13 04:07:16,914 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-13 04:07:16,914 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-13 04:07:16,944 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-13 04:07:16,954 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-13 04:07:16,958 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-13 04:07:16,961 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-13 04:07:16,961 INFO L276 PluginConnector]: CDTParser initialized [2018-04-13 04:07:16,962 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,247 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGcc5f352a7 [2018-04-13 04:07:17,379 INFO L287 CDTParser]: IsIndexed: true [2018-04-13 04:07:17,379 INFO L288 CDTParser]: Found 1 translation units. [2018-04-13 04:07:17,380 INFO L168 CDTParser]: Scanning openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,386 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-13 04:07:17,386 INFO L215 ultiparseSymbolTable]: [2018-04-13 04:07:17,386 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-13 04:07:17,386 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpy ('cstpcpy') in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,386 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____bswap_64 ('__bswap_64') in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,387 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,387 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____bswap_32 ('__bswap_32') in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,387 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-13 04:07:17,387 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____u_char in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,387 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__pthread_key_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,387 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____off64_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,387 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____blksize_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,387 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__blksize_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,387 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____qaddr_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,387 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__u_quad_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,388 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__int16_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,388 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____dev_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,388 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____fsblkcnt_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,388 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__uid_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,388 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__lldiv_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,388 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____caddr_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,388 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__fd_set in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,388 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____u_long in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,388 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__div_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,388 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__u_char in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,389 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__time_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,389 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__ulong in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,389 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__caddr_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,389 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____pthread_list_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,389 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__pthread_barrierattr_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,389 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__blkcnt_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,389 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__pthread_rwlock_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,389 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__sigset_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,389 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____uint32_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,389 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____int16_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,389 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____intptr_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,390 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____u_quad_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,390 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____gid_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,390 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__size_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,390 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____ssize_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,390 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__pthread_mutexattr_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,390 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____quad_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,390 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____pid_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,390 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____ino64_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,390 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__key_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,390 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____socklen_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,390 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__int32_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,390 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____rlim_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,390 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__pthread_rwlockattr_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,391 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____blkcnt64_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,391 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____off_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,391 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__pthread_barrier_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,391 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__fd_mask in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,391 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__fsfilcnt_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,391 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____int32_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,391 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____nlink_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,391 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____suseconds_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,391 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__timer_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,391 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__u_int32_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,391 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__clockid_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,392 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__u_int8_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,392 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__u_int in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,392 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__pthread_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,392 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____id_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,392 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____syscall_ulong_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,392 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____timer_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,392 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__fsblkcnt_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,392 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____sig_atomic_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,392 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____int64_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,392 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__pthread_attr_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,392 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____uid_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,393 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____fd_mask in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,393 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__nlink_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,393 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____fsblkcnt64_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,393 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__uint in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,393 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__wchar_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,393 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____useconds_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,393 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__loff_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,393 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__ssize_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,393 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____uint64_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,393 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____fsword_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,393 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__pthread_spinlock_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,394 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__u_int16_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,394 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__register_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,394 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__quad_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,394 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__off_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,394 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____u_int in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,394 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__u_short in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,394 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____clockid_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,394 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____sigset_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,394 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__pthread_cond_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,394 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____blkcnt_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,394 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__id_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,394 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__pthread_once_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,394 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__dev_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,394 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__u_long in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,394 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____mode_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,394 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____fsid_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,394 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____syscall_slong_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,395 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____ino_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,395 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____time_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,395 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__int8_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,395 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____u_short in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,395 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__u_int64_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,395 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__pthread_mutex_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,395 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____fsfilcnt64_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,395 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__clock_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,395 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__suseconds_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,395 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__ushort in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,395 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__gid_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,395 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__ldiv_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,395 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__ino_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,395 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__pid_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,395 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____clock_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,395 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____uint8_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,395 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____daddr_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,395 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____key_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,396 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__mode_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,396 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__fsid_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,396 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____int8_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,396 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__int64_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,396 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____loff_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,396 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__daddr_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,396 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____rlim64_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,396 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____fsfilcnt_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,396 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____uint16_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,396 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____WAIT_STATUS in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,396 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__pthread_condattr_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:17,409 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGcc5f352a7 [2018-04-13 04:07:17,412 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-13 04:07:17,413 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-13 04:07:17,413 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-13 04:07:17,413 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-13 04:07:17,417 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-13 04:07:17,417 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 04:07:17" (1/1) ... [2018-04-13 04:07:17,419 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5323b491 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:07:17, skipping insertion in model container [2018-04-13 04:07:17,419 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 04:07:17" (1/1) ... [2018-04-13 04:07:17,429 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 04:07:17,450 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-13 04:07:17,571 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 04:07:17,602 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-13 04:07:17,608 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-13 04:07:17,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:07:17 WrapperNode [2018-04-13 04:07:17,642 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-13 04:07:17,643 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-13 04:07:17,643 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-13 04:07:17,643 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-13 04:07:17,653 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:07:17" (1/1) ... [2018-04-13 04:07:17,653 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:07:17" (1/1) ... [2018-04-13 04:07:17,665 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:07:17" (1/1) ... [2018-04-13 04:07:17,666 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:07:17" (1/1) ... [2018-04-13 04:07:17,672 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:07:17" (1/1) ... [2018-04-13 04:07:17,676 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:07:17" (1/1) ... [2018-04-13 04:07:17,678 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:07:17" (1/1) ... [2018-04-13 04:07:17,681 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-13 04:07:17,682 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-13 04:07:17,682 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-13 04:07:17,682 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-13 04:07:17,683 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:07:17" (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-13 04:07:17,785 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-13 04:07:17,785 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-13 04:07:17,785 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-13 04:07:17,785 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-13 04:07:17,785 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpy [2018-04-13 04:07:17,786 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-13 04:07:17,786 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-13 04:07:17,786 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-13 04:07:17,786 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-13 04:07:17,786 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-13 04:07:17,786 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-13 04:07:17,786 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-13 04:07:17,786 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-13 04:07:17,786 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-13 04:07:17,786 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-13 04:07:17,787 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-13 04:07:17,787 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-13 04:07:17,787 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-13 04:07:17,787 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-13 04:07:17,787 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-13 04:07:17,787 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-13 04:07:17,787 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-13 04:07:17,787 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-13 04:07:17,787 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-13 04:07:17,788 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-13 04:07:17,788 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-13 04:07:17,788 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-13 04:07:17,788 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-13 04:07:17,788 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-13 04:07:17,788 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-13 04:07:17,788 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-13 04:07:17,788 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-13 04:07:17,788 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-13 04:07:17,789 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-13 04:07:17,789 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-13 04:07:17,789 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-13 04:07:17,789 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-13 04:07:17,789 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-13 04:07:17,789 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-13 04:07:17,789 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-13 04:07:17,789 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-13 04:07:17,789 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-13 04:07:17,790 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-13 04:07:17,790 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-13 04:07:17,790 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-13 04:07:17,790 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-13 04:07:17,790 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-13 04:07:17,790 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-13 04:07:17,790 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-13 04:07:17,790 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-13 04:07:17,791 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-13 04:07:17,791 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-13 04:07:17,791 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-13 04:07:17,791 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-13 04:07:17,791 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-13 04:07:17,791 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-13 04:07:17,791 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-13 04:07:17,791 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-13 04:07:17,791 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-13 04:07:17,791 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-13 04:07:17,792 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-13 04:07:17,792 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-13 04:07:17,792 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-13 04:07:17,792 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-13 04:07:17,792 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-13 04:07:17,792 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-13 04:07:17,792 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-13 04:07:17,792 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-13 04:07:17,792 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-13 04:07:17,792 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-13 04:07:17,793 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-13 04:07:17,793 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-13 04:07:17,793 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-13 04:07:17,793 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-13 04:07:17,793 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-13 04:07:17,793 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-13 04:07:17,793 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-13 04:07:17,793 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-13 04:07:17,793 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-13 04:07:17,793 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-13 04:07:17,794 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-13 04:07:17,794 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-13 04:07:17,794 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-13 04:07:17,794 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-13 04:07:17,794 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-13 04:07:17,794 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-13 04:07:17,794 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-13 04:07:17,794 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-13 04:07:17,794 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-13 04:07:17,794 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-13 04:07:17,795 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-13 04:07:17,795 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-13 04:07:17,795 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-13 04:07:17,795 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-13 04:07:17,795 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-13 04:07:17,795 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-13 04:07:17,795 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-13 04:07:17,795 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-13 04:07:17,795 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-13 04:07:17,795 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-13 04:07:17,796 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-13 04:07:17,796 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-13 04:07:17,796 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-13 04:07:17,796 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-13 04:07:17,796 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-13 04:07:17,796 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-13 04:07:17,796 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-13 04:07:17,796 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-13 04:07:17,796 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-13 04:07:17,796 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpy [2018-04-13 04:07:17,796 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-13 04:07:17,797 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-13 04:07:17,797 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-13 04:07:17,797 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-13 04:07:17,797 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-13 04:07:17,797 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-13 04:07:17,797 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-13 04:07:17,797 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-13 04:07:18,047 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-13 04:07:18,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 04:07:18 BoogieIcfgContainer [2018-04-13 04:07:18,047 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-13 04:07:18,048 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-13 04:07:18,048 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-13 04:07:18,051 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-13 04:07:18,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 04:07:17" (1/3) ... [2018-04-13 04:07:18,051 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41085b43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 04:07:18, skipping insertion in model container [2018-04-13 04:07:18,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:07:17" (2/3) ... [2018-04-13 04:07:18,051 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41085b43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 04:07:18, skipping insertion in model container [2018-04-13 04:07:18,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 04:07:18" (3/3) ... [2018-04-13 04:07:18,052 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-13 04:07:18,059 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-13 04:07:18,065 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-04-13 04:07:18,092 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-13 04:07:18,092 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-13 04:07:18,092 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-13 04:07:18,092 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-13 04:07:18,093 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-13 04:07:18,093 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-13 04:07:18,093 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-13 04:07:18,093 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-13 04:07:18,093 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-13 04:07:18,093 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-13 04:07:18,101 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-04-13 04:07:18,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-04-13 04:07:18,107 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:07:18,108 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:07:18,108 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:07:18,110 INFO L82 PathProgramCache]: Analyzing trace with hash -449322580, now seen corresponding path program 1 times [2018-04-13 04:07:18,111 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:07:18,111 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:07:18,137 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:18,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:07:18,137 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:18,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:07:18,169 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:07:18,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:07:18,204 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:07:18,204 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 04:07:18,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 04:07:18,213 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 04:07:18,214 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 04:07:18,215 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 4 states. [2018-04-13 04:07:18,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:07:18,265 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-04-13 04:07:18,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 04:07:18,267 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-04-13 04:07:18,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:07:18,272 INFO L225 Difference]: With dead ends: 44 [2018-04-13 04:07:18,272 INFO L226 Difference]: Without dead ends: 40 [2018-04-13 04:07:18,273 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-13 04:07:18,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-04-13 04:07:18,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-04-13 04:07:18,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-04-13 04:07:18,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-04-13 04:07:18,292 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 10 [2018-04-13 04:07:18,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:07:18,292 INFO L459 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-04-13 04:07:18,293 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 04:07:18,293 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-04-13 04:07:18,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-04-13 04:07:18,293 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:07:18,293 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:07:18,293 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:07:18,293 INFO L82 PathProgramCache]: Analyzing trace with hash -449320658, now seen corresponding path program 1 times [2018-04-13 04:07:18,293 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:07:18,293 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:07:18,294 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:18,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:07:18,294 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:18,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:07:18,299 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:07:18,308 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-13 04:07:18,309 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:07:18,309 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-13 04:07:18,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-13 04:07:18,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-13 04:07:18,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-13 04:07:18,310 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 3 states. [2018-04-13 04:07:18,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:07:18,330 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-04-13 04:07:18,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-13 04:07:18,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-04-13 04:07:18,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:07:18,331 INFO L225 Difference]: With dead ends: 39 [2018-04-13 04:07:18,331 INFO L226 Difference]: Without dead ends: 38 [2018-04-13 04:07:18,332 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-13 04:07:18,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-04-13 04:07:18,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-04-13 04:07:18,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-04-13 04:07:18,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-04-13 04:07:18,335 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 10 [2018-04-13 04:07:18,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:07:18,335 INFO L459 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-04-13 04:07:18,335 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-13 04:07:18,335 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-04-13 04:07:18,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-13 04:07:18,336 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:07:18,336 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:07:18,336 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:07:18,336 INFO L82 PathProgramCache]: Analyzing trace with hash -556014976, now seen corresponding path program 1 times [2018-04-13 04:07:18,336 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:07:18,336 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:07:18,337 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:18,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:07:18,337 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:18,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:07:18,350 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:07:18,376 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-13 04:07:18,376 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:07:18,376 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-13 04:07:18,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-13 04:07:18,377 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-13 04:07:18,377 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-13 04:07:18,377 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 4 states. [2018-04-13 04:07:18,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:07:18,410 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-04-13 04:07:18,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-13 04:07:18,411 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-04-13 04:07:18,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:07:18,411 INFO L225 Difference]: With dead ends: 36 [2018-04-13 04:07:18,411 INFO L226 Difference]: Without dead ends: 36 [2018-04-13 04:07:18,411 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-13 04:07:18,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-04-13 04:07:18,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-04-13 04:07:18,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-04-13 04:07:18,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-04-13 04:07:18,413 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 14 [2018-04-13 04:07:18,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:07:18,414 INFO L459 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-04-13 04:07:18,414 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-13 04:07:18,414 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-04-13 04:07:18,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-13 04:07:18,414 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:07:18,414 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:07:18,414 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:07:18,414 INFO L82 PathProgramCache]: Analyzing trace with hash -556014975, now seen corresponding path program 1 times [2018-04-13 04:07:18,414 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:07:18,414 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:07:18,415 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:18,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:07:18,415 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:18,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:07:18,427 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:07:18,478 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-13 04:07:18,479 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:07:18,479 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 04:07:18,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 04:07:18,479 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 04:07:18,479 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-13 04:07:18,479 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 5 states. [2018-04-13 04:07:18,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:07:18,499 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-04-13 04:07:18,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 04:07:18,499 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-04-13 04:07:18,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:07:18,500 INFO L225 Difference]: With dead ends: 35 [2018-04-13 04:07:18,500 INFO L226 Difference]: Without dead ends: 35 [2018-04-13 04:07:18,500 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-13 04:07:18,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-04-13 04:07:18,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-04-13 04:07:18,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-04-13 04:07:18,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-04-13 04:07:18,502 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 14 [2018-04-13 04:07:18,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:07:18,502 INFO L459 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-04-13 04:07:18,502 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 04:07:18,503 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-04-13 04:07:18,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-13 04:07:18,503 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:07:18,503 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:07:18,503 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:07:18,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1899342595, now seen corresponding path program 1 times [2018-04-13 04:07:18,503 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:07:18,503 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:07:18,504 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:18,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:07:18,504 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:18,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:07:18,513 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:07:18,535 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-13 04:07:18,535 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:07:18,535 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-13 04:07:18,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-13 04:07:18,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-13 04:07:18,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-13 04:07:18,536 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 5 states. [2018-04-13 04:07:18,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:07:18,576 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-04-13 04:07:18,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-13 04:07:18,577 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-13 04:07:18,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:07:18,577 INFO L225 Difference]: With dead ends: 34 [2018-04-13 04:07:18,577 INFO L226 Difference]: Without dead ends: 34 [2018-04-13 04:07:18,578 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-13 04:07:18,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-04-13 04:07:18,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-04-13 04:07:18,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-04-13 04:07:18,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-04-13 04:07:18,580 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 18 [2018-04-13 04:07:18,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:07:18,580 INFO L459 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-04-13 04:07:18,581 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-13 04:07:18,581 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-04-13 04:07:18,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-13 04:07:18,581 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:07:18,581 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:07:18,581 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:07:18,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1899342596, now seen corresponding path program 1 times [2018-04-13 04:07:18,581 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:07:18,582 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:07:18,582 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:18,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:07:18,582 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:18,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:07:18,593 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:07:18,648 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-13 04:07:18,649 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:07:18,649 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-13 04:07:18,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-13 04:07:18,651 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-13 04:07:18,651 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-04-13 04:07:18,651 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 8 states. [2018-04-13 04:07:18,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:07:18,714 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-04-13 04:07:18,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-13 04:07:18,715 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-04-13 04:07:18,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:07:18,717 INFO L225 Difference]: With dead ends: 44 [2018-04-13 04:07:18,717 INFO L226 Difference]: Without dead ends: 44 [2018-04-13 04:07:18,718 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-04-13 04:07:18,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-04-13 04:07:18,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2018-04-13 04:07:18,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-04-13 04:07:18,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-04-13 04:07:18,721 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 18 [2018-04-13 04:07:18,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:07:18,721 INFO L459 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-04-13 04:07:18,721 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-13 04:07:18,721 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-04-13 04:07:18,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-13 04:07:18,722 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:07:18,722 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:07:18,722 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:07:18,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1249921719, now seen corresponding path program 1 times [2018-04-13 04:07:18,722 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:07:18,722 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:07:18,723 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:18,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:07:18,723 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:18,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:07:18,735 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:07:18,739 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:07:18,740 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:07:18,740 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:07:18,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:07:18,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:07:18,769 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:07:18,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, 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-13 04:07:18,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:18,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:07:18,801 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-13 04:07:18,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-13 04:07:18,812 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:18,815 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-13 04:07:18,815 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-13 04:07:18,834 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-13 04:07:18,834 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:07:18,834 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-13 04:07:18,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-13 04:07:18,835 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-13 04:07:18,835 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-13 04:07:18,835 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 6 states. [2018-04-13 04:07:18,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:07:18,875 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-04-13 04:07:18,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-13 04:07:18,875 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-04-13 04:07:18,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:07:18,875 INFO L225 Difference]: With dead ends: 35 [2018-04-13 04:07:18,875 INFO L226 Difference]: Without dead ends: 35 [2018-04-13 04:07:18,876 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-04-13 04:07:18,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-04-13 04:07:18,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-04-13 04:07:18,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-04-13 04:07:18,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-04-13 04:07:18,878 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 19 [2018-04-13 04:07:18,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:07:18,879 INFO L459 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-04-13 04:07:18,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-13 04:07:18,879 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-04-13 04:07:18,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-13 04:07:18,879 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:07:18,879 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:07:18,880 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:07:18,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1249921718, now seen corresponding path program 1 times [2018-04-13 04:07:18,880 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:07:18,880 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:07:18,881 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:18,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:07:18,881 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:18,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:07:18,891 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:07:18,894 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:07:18,894 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:07:18,894 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:07:18,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:07:18,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:07:18,922 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:07:18,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:07:18,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:18,955 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:07:18,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:18,960 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-13 04:07:18,961 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:17 [2018-04-13 04:07:18,998 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:07:18,999 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:07:19,000 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-13 04:07:19,000 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:19,007 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-13 04:07:19,007 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:19,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:07:19,012 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2018-04-13 04:07:19,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:07:19,103 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:07:19,103 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-13 04:07:19,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-13 04:07:19,104 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-13 04:07:19,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-04-13 04:07:19,104 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 12 states. [2018-04-13 04:07:19,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:07:19,372 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2018-04-13 04:07:19,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-13 04:07:19,372 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-04-13 04:07:19,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:07:19,373 INFO L225 Difference]: With dead ends: 68 [2018-04-13 04:07:19,373 INFO L226 Difference]: Without dead ends: 68 [2018-04-13 04:07:19,373 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2018-04-13 04:07:19,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-04-13 04:07:19,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 54. [2018-04-13 04:07:19,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-04-13 04:07:19,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-04-13 04:07:19,376 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 19 [2018-04-13 04:07:19,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:07:19,376 INFO L459 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-04-13 04:07:19,376 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-13 04:07:19,376 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-04-13 04:07:19,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-13 04:07:19,376 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:07:19,377 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:07:19,377 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:07:19,377 INFO L82 PathProgramCache]: Analyzing trace with hash -991756280, now seen corresponding path program 1 times [2018-04-13 04:07:19,377 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:07:19,377 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:07:19,377 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:19,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:07:19,377 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:19,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:07:19,386 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:07:19,389 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:07:19,389 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:07:19,389 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:07:19,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:07:19,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:07:19,412 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:07:19,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:07:19,426 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:19,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:07:19,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:19,439 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-13 04:07:19,439 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:07:19,459 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:07:19,460 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:07:19,461 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-13 04:07:19,461 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:19,469 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-13 04:07:19,469 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:19,475 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-13 04:07:19,475 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-13 04:07:19,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-13 04:07:19,499 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:07:19,499 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-13 04:07:19,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-13 04:07:19,499 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-13 04:07:19,499 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-04-13 04:07:19,499 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 8 states. [2018-04-13 04:07:19,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:07:19,594 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2018-04-13 04:07:19,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-13 04:07:19,595 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-04-13 04:07:19,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:07:19,595 INFO L225 Difference]: With dead ends: 65 [2018-04-13 04:07:19,596 INFO L226 Difference]: Without dead ends: 65 [2018-04-13 04:07:19,596 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-04-13 04:07:19,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-04-13 04:07:19,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 36. [2018-04-13 04:07:19,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-04-13 04:07:19,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-04-13 04:07:19,599 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 19 [2018-04-13 04:07:19,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:07:19,599 INFO L459 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-04-13 04:07:19,599 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-13 04:07:19,599 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-04-13 04:07:19,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-13 04:07:19,600 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:07:19,600 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:07:19,600 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:07:19,600 INFO L82 PathProgramCache]: Analyzing trace with hash -660876371, now seen corresponding path program 1 times [2018-04-13 04:07:19,600 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:07:19,600 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:07:19,601 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:19,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:07:19,601 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:19,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:07:19,610 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:07:19,688 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-13 04:07:19,688 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:07:19,689 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-13 04:07:19,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-13 04:07:19,689 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-13 04:07:19,689 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-04-13 04:07:19,689 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 10 states. [2018-04-13 04:07:19,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:07:19,764 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2018-04-13 04:07:19,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-13 04:07:19,764 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-04-13 04:07:19,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:07:19,764 INFO L225 Difference]: With dead ends: 58 [2018-04-13 04:07:19,764 INFO L226 Difference]: Without dead ends: 58 [2018-04-13 04:07:19,764 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-04-13 04:07:19,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-04-13 04:07:19,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2018-04-13 04:07:19,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-04-13 04:07:19,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2018-04-13 04:07:19,767 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 23 [2018-04-13 04:07:19,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:07:19,767 INFO L459 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2018-04-13 04:07:19,767 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-13 04:07:19,767 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2018-04-13 04:07:19,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-13 04:07:19,767 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:07:19,767 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:07:19,768 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:07:19,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1681944725, now seen corresponding path program 1 times [2018-04-13 04:07:19,768 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:07:19,769 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:07:19,769 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:19,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:07:19,769 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:19,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:07:19,775 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:07:19,867 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-13 04:07:19,867 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:07:19,867 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:07:19,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:07:19,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:07:19,889 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:07:19,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:07:19,896 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:19,899 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:07:19,900 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 04:07:19,923 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-13 04:07:19,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 13 treesize of output 12 [2018-04-13 04:07:19,931 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:19,932 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:07:19,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:07:19,937 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-04-13 04:07:20,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-04-13 04:07:20,017 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 16 treesize of output 13 [2018-04-13 04:07:20,018 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 04:07:20,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:07:20,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:07:20,030 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:54 [2018-04-13 04:07:20,103 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-13 04:07:20,103 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-13 04:07:20,103 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2018-04-13 04:07:20,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-13 04:07:20,104 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-13 04:07:20,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-04-13 04:07:20,104 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 19 states. [2018-04-13 04:07:20,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:07:20,389 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-04-13 04:07:20,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-13 04:07:20,390 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23 [2018-04-13 04:07:20,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:07:20,390 INFO L225 Difference]: With dead ends: 65 [2018-04-13 04:07:20,390 INFO L226 Difference]: Without dead ends: 65 [2018-04-13 04:07:20,390 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2018-04-13 04:07:20,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-04-13 04:07:20,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 55. [2018-04-13 04:07:20,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-04-13 04:07:20,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-04-13 04:07:20,393 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 23 [2018-04-13 04:07:20,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:07:20,393 INFO L459 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-04-13 04:07:20,393 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-13 04:07:20,393 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-04-13 04:07:20,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-13 04:07:20,394 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:07:20,394 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] [2018-04-13 04:07:20,394 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:07:20,394 INFO L82 PathProgramCache]: Analyzing trace with hash -600678973, now seen corresponding path program 1 times [2018-04-13 04:07:20,394 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:07:20,394 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:07:20,395 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:20,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:07:20,395 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:20,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:07:20,403 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:07:20,407 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:07:20,407 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:07:20,407 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:07:20,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:07:20,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:07:20,427 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:07:20,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:07:20,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:20,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:07:20,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:20,461 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-13 04:07:20,461 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:17 [2018-04-13 04:07:20,482 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:07:20,487 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-13 04:07:20,487 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:20,496 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:07:20,497 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:07:20,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:07:20,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:20,503 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-13 04:07:20,503 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:20 [2018-04-13 04:07:20,610 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-13 04:07:20,610 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:07:20,610 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-13 04:07:20,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-13 04:07:20,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-13 04:07:20,611 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-04-13 04:07:20,611 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 15 states. [2018-04-13 04:07:20,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:07:20,870 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2018-04-13 04:07:20,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-13 04:07:20,870 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2018-04-13 04:07:20,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:07:20,871 INFO L225 Difference]: With dead ends: 64 [2018-04-13 04:07:20,871 INFO L226 Difference]: Without dead ends: 64 [2018-04-13 04:07:20,871 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=537, Unknown=0, NotChecked=0, Total=650 [2018-04-13 04:07:20,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-04-13 04:07:20,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 56. [2018-04-13 04:07:20,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-04-13 04:07:20,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-04-13 04:07:20,874 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 24 [2018-04-13 04:07:20,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:07:20,874 INFO L459 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-04-13 04:07:20,874 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-13 04:07:20,874 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-04-13 04:07:20,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-13 04:07:20,874 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:07:20,874 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:07:20,875 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:07:20,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1671194714, now seen corresponding path program 2 times [2018-04-13 04:07:20,875 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:07:20,875 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:07:20,876 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:20,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:07:20,876 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:20,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:07:20,884 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:07:20,890 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:07:20,890 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:07:20,890 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:07:20,891 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:07:20,917 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:07:20,917 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:07:20,920 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:07:20,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:07:20,923 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:20,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:07:20,925 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-13 04:07:20,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:07:20,935 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:20,942 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:07:20,943 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:07:20,943 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-13 04:07:20,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:20,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:07:20,948 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-13 04:07:20,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, 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-13 04:07:20,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 13 treesize of output 12 [2018-04-13 04:07:20,965 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:20,966 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:07:20,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:07:20,970 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-04-13 04:07:21,012 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 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-13 04:07:21,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:07:21,014 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:21,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:07:21,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:07:21,023 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:18 [2018-04-13 04:07:21,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-13 04:07:21,053 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-13 04:07:21,053 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 04:07:21,057 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:07:21,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:07:21,063 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:40 [2018-04-13 04:07:21,134 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:07:21,135 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:07:21,135 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-13 04:07:21,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-13 04:07:21,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-13 04:07:21,136 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2018-04-13 04:07:21,136 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 15 states. [2018-04-13 04:07:21,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:07:21,412 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2018-04-13 04:07:21,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-13 04:07:21,412 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-04-13 04:07:21,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:07:21,412 INFO L225 Difference]: With dead ends: 70 [2018-04-13 04:07:21,413 INFO L226 Difference]: Without dead ends: 70 [2018-04-13 04:07:21,413 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2018-04-13 04:07:21,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-04-13 04:07:21,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 60. [2018-04-13 04:07:21,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-04-13 04:07:21,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-04-13 04:07:21,417 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 28 [2018-04-13 04:07:21,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:07:21,417 INFO L459 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-04-13 04:07:21,417 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-13 04:07:21,417 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-04-13 04:07:21,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-13 04:07:21,418 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:07:21,418 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:07:21,418 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:07:21,418 INFO L82 PathProgramCache]: Analyzing trace with hash -549923555, now seen corresponding path program 1 times [2018-04-13 04:07:21,418 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:07:21,418 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:07:21,419 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:21,419 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:07:21,419 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:21,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:07:21,426 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:07:21,428 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:07:21,428 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:07:21,428 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:07:21,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:07:21,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:07:21,438 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:07:21,477 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:07:21,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-04-13 04:07:21,479 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 23 treesize of output 15 [2018-04-13 04:07:21,480 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:21,484 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:07:21,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-13 04:07:21,487 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-13 04:07:21,507 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc7.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc7.base| 1))) (and (= (select |c_old(#valid)| |main_#t~malloc7.base|) 0) (= (store (store .cse0 |c_main_#t~malloc8.base| 1) |main_#t~malloc7.base| 0) |c_#valid|) (= (select .cse0 |c_main_#t~malloc8.base|) 0)))) is different from true [2018-04-13 04:07:21,520 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc7.base| Int) (|main_#t~malloc8.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc7.base| 1))) (and (= (select |c_old(#valid)| |main_#t~malloc7.base|) 0) (= |c_#valid| (store (store (store .cse0 |main_#t~malloc8.base| 1) |main_#t~malloc7.base| 0) |main_#t~malloc8.base| 0)) (= (select .cse0 |main_#t~malloc8.base|) 0)))) is different from true [2018-04-13 04:07:21,522 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-13 04:07:21,522 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-13 04:07:21,522 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-13 04:07:21,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-13 04:07:21,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-13 04:07:21,523 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=22, Unknown=2, NotChecked=18, Total=56 [2018-04-13 04:07:21,523 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 8 states. [2018-04-13 04:07:21,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:07:21,555 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-04-13 04:07:21,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-13 04:07:21,555 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-04-13 04:07:21,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:07:21,556 INFO L225 Difference]: With dead ends: 59 [2018-04-13 04:07:21,556 INFO L226 Difference]: Without dead ends: 35 [2018-04-13 04:07:21,556 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=30, Unknown=2, NotChecked=22, Total=72 [2018-04-13 04:07:21,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-04-13 04:07:21,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-04-13 04:07:21,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-04-13 04:07:21,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-04-13 04:07:21,557 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 29 [2018-04-13 04:07:21,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:07:21,558 INFO L459 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-04-13 04:07:21,558 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-13 04:07:21,558 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-04-13 04:07:21,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-13 04:07:21,558 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:07:21,558 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:07:21,558 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:07:21,558 INFO L82 PathProgramCache]: Analyzing trace with hash -267428632, now seen corresponding path program 2 times [2018-04-13 04:07:21,558 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:07:21,558 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:07:21,559 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:21,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:07:21,559 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:21,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:07:21,565 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:07:21,569 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:07:21,569 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:07:21,569 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:07:21,570 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:07:21,599 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:07:21,599 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:07:21,602 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:07:21,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-13 04:07:21,610 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:21,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 6 treesize of output 5 [2018-04-13 04:07:21,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:21,618 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-13 04:07:21,618 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:07:21,632 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:07:21,633 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-13 04:07:21,634 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:21,644 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:07:21,644 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:07:21,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-13 04:07:21,645 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:21,650 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-13 04:07:21,650 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-13 04:07:21,757 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:07:21,758 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:07:21,758 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-13 04:07:21,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-13 04:07:21,758 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-13 04:07:21,758 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-04-13 04:07:21,758 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 13 states. [2018-04-13 04:07:21,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:07:21,969 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2018-04-13 04:07:21,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-13 04:07:21,969 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2018-04-13 04:07:21,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:07:21,970 INFO L225 Difference]: With dead ends: 38 [2018-04-13 04:07:21,970 INFO L226 Difference]: Without dead ends: 38 [2018-04-13 04:07:21,970 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2018-04-13 04:07:21,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-04-13 04:07:21,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2018-04-13 04:07:21,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-04-13 04:07:21,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-04-13 04:07:21,972 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 29 [2018-04-13 04:07:21,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:07:21,972 INFO L459 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-04-13 04:07:21,973 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-13 04:07:21,973 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-04-13 04:07:21,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-13 04:07:21,973 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:07:21,973 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:07:21,973 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:07:21,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1840413771, now seen corresponding path program 3 times [2018-04-13 04:07:21,974 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:07:21,974 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:07:21,974 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:21,974 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:07:21,974 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:21,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:07:21,982 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:07:21,990 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:07:21,990 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:07:21,991 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:07:21,991 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:07:22,029 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-13 04:07:22,029 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:07:22,033 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:07:22,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:07:22,038 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:22,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:07:22,041 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 04:07:22,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:07:22,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:22,058 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:07:22,059 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:07:22,060 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-13 04:07:22,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:22,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:07:22,064 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2018-04-13 04:07:22,080 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-13 04:07:22,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, 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-13 04:07:22,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:22,082 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:07:22,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:07:22,087 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-04-13 04:07:22,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-04-13 04:07:22,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:07:22,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:22,129 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:07:22,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:07:22,134 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:19 [2018-04-13 04:07:22,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-04-13 04:07:22,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-04-13 04:07:22,176 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:22,193 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 30 [2018-04-13 04:07:22,194 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-13 04:07:22,202 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:07:22,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:07:22,225 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:29, output treesize:33 [2018-04-13 04:07:22,258 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-13 04:07:22,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:22,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-13 04:07:22,273 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-13 04:07:22,274 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-13 04:07:22,277 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:07:22,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:07:22,281 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:59, output treesize:34 [2018-04-13 04:07:22,327 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:07:22,327 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:07:22,328 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-13 04:07:22,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-13 04:07:22,328 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-13 04:07:22,328 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2018-04-13 04:07:22,328 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 16 states. [2018-04-13 04:07:22,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:07:22,552 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2018-04-13 04:07:22,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-13 04:07:22,552 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 33 [2018-04-13 04:07:22,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:07:22,552 INFO L225 Difference]: With dead ends: 44 [2018-04-13 04:07:22,552 INFO L226 Difference]: Without dead ends: 44 [2018-04-13 04:07:22,553 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2018-04-13 04:07:22,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-04-13 04:07:22,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2018-04-13 04:07:22,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-04-13 04:07:22,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-04-13 04:07:22,554 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 33 [2018-04-13 04:07:22,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:07:22,554 INFO L459 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-04-13 04:07:22,554 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-13 04:07:22,555 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-04-13 04:07:22,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-13 04:07:22,555 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:07:22,555 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:07:22,555 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:07:22,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1218252003, now seen corresponding path program 3 times [2018-04-13 04:07:22,556 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:07:22,556 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:07:22,556 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:22,557 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:07:22,557 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:22,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:07:22,563 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:07:22,568 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:07:22,569 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:07:22,569 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:07:22,569 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:07:22,596 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-13 04:07:22,596 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:07:22,599 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:07:22,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-13 04:07:22,604 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:22,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:07:22,607 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-13 04:07:22,622 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-13 04:07:22,622 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 04:07:22,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:07:22,632 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-04-13 04:07:22,783 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-13 04:07:22,783 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:07:22,783 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-13 04:07:22,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-13 04:07:22,784 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-13 04:07:22,784 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2018-04-13 04:07:22,784 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 15 states. [2018-04-13 04:07:23,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:07:23,046 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-04-13 04:07:23,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-13 04:07:23,046 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2018-04-13 04:07:23,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:07:23,047 INFO L225 Difference]: With dead ends: 43 [2018-04-13 04:07:23,047 INFO L226 Difference]: Without dead ends: 43 [2018-04-13 04:07:23,047 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2018-04-13 04:07:23,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-04-13 04:07:23,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2018-04-13 04:07:23,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-04-13 04:07:23,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-04-13 04:07:23,049 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 34 [2018-04-13 04:07:23,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:07:23,049 INFO L459 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-04-13 04:07:23,049 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-13 04:07:23,049 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-04-13 04:07:23,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-13 04:07:23,050 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:07:23,050 INFO L355 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:07:23,050 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:07:23,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1738651334, now seen corresponding path program 4 times [2018-04-13 04:07:23,051 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:07:23,051 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:07:23,051 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:23,051 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:07:23,051 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:23,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:07:23,060 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:07:23,066 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:07:23,066 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:07:23,066 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:07:23,067 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 04:07:23,092 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 04:07:23,092 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:07:23,096 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:07:23,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:07:23,111 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:23,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:07:23,114 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-13 04:07:23,127 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:07:23,127 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:07:23,128 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-13 04:07:23,128 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:23,136 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-13 04:07:23,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:23,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:07:23,141 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2018-04-13 04:07:23,164 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-13 04:07:23,166 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:07:23,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:23,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:07:23,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:07:23,174 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-04-13 04:07:23,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-04-13 04:07:23,237 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 04:07:23,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:23,243 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:07:23,251 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-13 04:07:23,251 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:23 [2018-04-13 04:07:23,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-04-13 04:07:23,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:07:23,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:23,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:07:23,277 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-13 04:07:23,277 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:22 [2018-04-13 04:07:23,313 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-04-13 04:07:23,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:07:23,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:23,318 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:07:23,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:07:23,326 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:18 [2018-04-13 04:07:23,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-13 04:07:23,354 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-13 04:07:23,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 04:07:23,356 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:07:23,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:07:23,361 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-04-13 04:07:23,442 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:07:23,442 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:07:23,442 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-13 04:07:23,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-13 04:07:23,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-13 04:07:23,443 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2018-04-13 04:07:23,443 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 16 states. [2018-04-13 04:07:23,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:07:23,666 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-04-13 04:07:23,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-13 04:07:23,666 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 38 [2018-04-13 04:07:23,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:07:23,666 INFO L225 Difference]: With dead ends: 49 [2018-04-13 04:07:23,666 INFO L226 Difference]: Without dead ends: 49 [2018-04-13 04:07:23,667 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2018-04-13 04:07:23,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-04-13 04:07:23,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2018-04-13 04:07:23,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-04-13 04:07:23,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-04-13 04:07:23,668 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 38 [2018-04-13 04:07:23,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:07:23,668 INFO L459 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-04-13 04:07:23,668 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-13 04:07:23,668 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-04-13 04:07:23,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-13 04:07:23,669 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:07:23,669 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:07:23,669 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:07:23,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1936383544, now seen corresponding path program 4 times [2018-04-13 04:07:23,669 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:07:23,669 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:07:23,670 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:23,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:07:23,670 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:23,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:07:23,678 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:07:23,681 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:07:23,681 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:07:23,681 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:07:23,682 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 04:07:23,706 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 04:07:23,708 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:07:23,712 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:07:23,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:07:23,742 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:23,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 6 treesize of output 5 [2018-04-13 04:07:23,749 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:23,755 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-13 04:07:23,755 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:07:23,772 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:07:23,773 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-13 04:07:23,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:23,786 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:07:23,787 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:07:23,787 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-13 04:07:23,788 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:23,795 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-13 04:07:23,795 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:07:23,957 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:07:23,958 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:07:23,958 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-13 04:07:23,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-13 04:07:23,958 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-13 04:07:23,958 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2018-04-13 04:07:23,958 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 16 states. [2018-04-13 04:07:24,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:07:24,233 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2018-04-13 04:07:24,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-13 04:07:24,233 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2018-04-13 04:07:24,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:07:24,233 INFO L225 Difference]: With dead ends: 48 [2018-04-13 04:07:24,234 INFO L226 Difference]: Without dead ends: 48 [2018-04-13 04:07:24,234 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2018-04-13 04:07:24,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-04-13 04:07:24,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-04-13 04:07:24,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-04-13 04:07:24,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-04-13 04:07:24,235 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 39 [2018-04-13 04:07:24,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:07:24,235 INFO L459 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-04-13 04:07:24,235 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-13 04:07:24,235 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-04-13 04:07:24,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-13 04:07:24,236 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:07:24,236 INFO L355 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:07:24,236 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:07:24,236 INFO L82 PathProgramCache]: Analyzing trace with hash 369807659, now seen corresponding path program 5 times [2018-04-13 04:07:24,236 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:07:24,236 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:07:24,236 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:24,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:07:24,236 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:24,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:07:24,243 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:07:24,246 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:07:24,246 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:07:24,246 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:07:24,246 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 04:07:24,279 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-04-13 04:07:24,279 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:07:24,283 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:07:24,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:07:24,296 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:24,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:07:24,297 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-13 04:07:24,308 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:07:24,309 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:07:24,310 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-13 04:07:24,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:24,316 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-13 04:07:24,316 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:24,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:07:24,320 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-13 04:07:24,338 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-13 04:07:24,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:07:24,339 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:24,341 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:07:24,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:07:24,345 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-13 04:07:24,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-04-13 04:07:24,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-13 04:07:24,385 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:24,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:07:24,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:07:24,395 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-04-13 04:07:24,398 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-13 04:07:24,398 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:24,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:07:24,403 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:19 [2018-04-13 04:07:24,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-04-13 04:07:24,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:07:24,424 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:24,430 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:07:24,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:07:24,436 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2018-04-13 04:07:24,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-04-13 04:07:24,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:07:24,459 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:24,463 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:07:24,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:07:24,469 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2018-04-13 04:07:24,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-04-13 04:07:24,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-13 04:07:24,495 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:24,499 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:07:24,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:07:24,506 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-04-13 04:07:24,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 19 treesize of output 15 [2018-04-13 04:07:24,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-13 04:07:24,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-13 04:07:24,558 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:07:24,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-13 04:07:24,563 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-04-13 04:07:24,629 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 22 proven. 36 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-13 04:07:24,629 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:07:24,629 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-13 04:07:24,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-13 04:07:24,630 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-13 04:07:24,630 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2018-04-13 04:07:24,630 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 17 states. [2018-04-13 04:07:24,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:07:24,965 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-04-13 04:07:24,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-13 04:07:24,965 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 43 [2018-04-13 04:07:24,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:07:24,966 INFO L225 Difference]: With dead ends: 45 [2018-04-13 04:07:24,966 INFO L226 Difference]: Without dead ends: 45 [2018-04-13 04:07:24,966 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=665, Unknown=0, NotChecked=0, Total=812 [2018-04-13 04:07:24,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-04-13 04:07:24,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-04-13 04:07:24,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-04-13 04:07:24,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-04-13 04:07:24,968 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 43 [2018-04-13 04:07:24,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:07:24,969 INFO L459 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-04-13 04:07:24,969 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-13 04:07:24,969 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-04-13 04:07:24,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-13 04:07:24,969 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:07:24,969 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:07:24,970 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:07:24,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1420864509, now seen corresponding path program 5 times [2018-04-13 04:07:24,970 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:07:24,970 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:07:24,970 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:24,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:07:24,971 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:07:24,977 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:07:24,986 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:07:24,986 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:07:24,987 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:07:24,987 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 04:07:25,012 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-04-13 04:07:25,012 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:07:25,014 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:07:25,095 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:07:25,095 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:25,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:07:25,101 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-13 04:07:25,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-13 04:07:25,125 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 04:07:25,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-13 04:07:25,151 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:25,155 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-13 04:07:25,155 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:14 [2018-04-13 04:07:25,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-13 04:07:25,232 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:25,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:07:25,238 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:14 [2018-04-13 04:07:25,350 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:07:25,350 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:07:25,350 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-13 04:07:25,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-13 04:07:25,351 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-13 04:07:25,351 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-04-13 04:07:25,351 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 16 states. [2018-04-13 04:07:25,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:07:25,661 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2018-04-13 04:07:25,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-13 04:07:25,661 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 44 [2018-04-13 04:07:25,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:07:25,661 INFO L225 Difference]: With dead ends: 52 [2018-04-13 04:07:25,662 INFO L226 Difference]: Without dead ends: 52 [2018-04-13 04:07:25,662 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=662, Unknown=0, NotChecked=0, Total=756 [2018-04-13 04:07:25,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-04-13 04:07:25,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2018-04-13 04:07:25,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-04-13 04:07:25,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2018-04-13 04:07:25,663 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 44 [2018-04-13 04:07:25,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:07:25,663 INFO L459 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2018-04-13 04:07:25,663 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-13 04:07:25,663 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2018-04-13 04:07:25,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-13 04:07:25,664 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:07:25,664 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:07:25,664 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:07:25,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1741835944, now seen corresponding path program 6 times [2018-04-13 04:07:25,664 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:07:25,664 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:07:25,664 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:25,664 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:07:25,664 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:25,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:07:25,670 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:07:25,675 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:07:25,675 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:07:25,675 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:07:25,676 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 04:07:25,721 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-04-13 04:07:25,721 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:07:25,724 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:07:25,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-13 04:07:25,730 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:25,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:07:25,736 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:25,740 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-13 04:07:25,740 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:07:25,754 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:07:25,755 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-13 04:07:25,756 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:25,764 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:07:25,765 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:07:25,765 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-13 04:07:25,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:25,771 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-13 04:07:25,771 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-13 04:07:25,965 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:07:25,965 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:07:25,965 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-13 04:07:25,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-13 04:07:25,966 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-13 04:07:25,966 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-04-13 04:07:25,966 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 17 states. [2018-04-13 04:07:26,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:07:26,366 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2018-04-13 04:07:26,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-13 04:07:26,366 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 49 [2018-04-13 04:07:26,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:07:26,367 INFO L225 Difference]: With dead ends: 57 [2018-04-13 04:07:26,367 INFO L226 Difference]: Without dead ends: 57 [2018-04-13 04:07:26,367 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=770, Unknown=0, NotChecked=0, Total=870 [2018-04-13 04:07:26,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-04-13 04:07:26,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-04-13 04:07:26,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-04-13 04:07:26,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-04-13 04:07:26,369 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 49 [2018-04-13 04:07:26,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:07:26,369 INFO L459 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-04-13 04:07:26,369 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-13 04:07:26,369 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-04-13 04:07:26,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-13 04:07:26,369 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:07:26,369 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:07:26,369 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:07:26,369 INFO L82 PathProgramCache]: Analyzing trace with hash -508873949, now seen corresponding path program 7 times [2018-04-13 04:07:26,369 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:07:26,369 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:07:26,370 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:26,370 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:07:26,370 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:26,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:07:26,380 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:07:26,386 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:07:26,386 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:07:26,386 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:07:26,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:07:26,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:07:26,430 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:07:26,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:07:26,437 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:26,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:07:26,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:26,451 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-13 04:07:26,451 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:07:26,471 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:07:26,473 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-13 04:07:26,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:26,497 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:07:26,498 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:07:26,499 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-13 04:07:26,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:26,504 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-13 04:07:26,504 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-13 04:07:26,752 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:07:26,752 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:07:26,752 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-13 04:07:26,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-13 04:07:26,753 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-13 04:07:26,753 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2018-04-13 04:07:26,753 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 19 states. [2018-04-13 04:07:27,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:07:27,233 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2018-04-13 04:07:27,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-13 04:07:27,234 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 54 [2018-04-13 04:07:27,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:07:27,234 INFO L225 Difference]: With dead ends: 62 [2018-04-13 04:07:27,234 INFO L226 Difference]: Without dead ends: 62 [2018-04-13 04:07:27,235 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=1004, Unknown=0, NotChecked=0, Total=1122 [2018-04-13 04:07:27,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-04-13 04:07:27,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2018-04-13 04:07:27,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-04-13 04:07:27,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-04-13 04:07:27,236 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 54 [2018-04-13 04:07:27,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:07:27,236 INFO L459 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-04-13 04:07:27,236 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-13 04:07:27,236 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-04-13 04:07:27,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-13 04:07:27,236 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:07:27,236 INFO L355 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:07:27,237 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:07:27,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1314593912, now seen corresponding path program 8 times [2018-04-13 04:07:27,237 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:07:27,237 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:07:27,237 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:27,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:07:27,237 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:27,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:07:27,244 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:07:27,247 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:07:27,247 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:07:27,247 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:07:27,248 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:07:27,275 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:07:27,276 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:07:27,279 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:07:27,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:07:27,284 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:27,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:07:27,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:27,309 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-13 04:07:27,310 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:07:27,328 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:07:27,329 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:07:27,329 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-13 04:07:27,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:27,344 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-13 04:07:27,345 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:27,350 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-13 04:07:27,351 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:07:27,645 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:07:27,645 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:07:27,645 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-13 04:07:27,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-13 04:07:27,645 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-13 04:07:27,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=340, Unknown=0, NotChecked=0, Total=380 [2018-04-13 04:07:27,646 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 20 states. [2018-04-13 04:07:28,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:07:28,137 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2018-04-13 04:07:28,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-13 04:07:28,138 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 59 [2018-04-13 04:07:28,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:07:28,138 INFO L225 Difference]: With dead ends: 67 [2018-04-13 04:07:28,138 INFO L226 Difference]: Without dead ends: 67 [2018-04-13 04:07:28,139 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=124, Invalid=1136, Unknown=0, NotChecked=0, Total=1260 [2018-04-13 04:07:28,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-04-13 04:07:28,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2018-04-13 04:07:28,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-04-13 04:07:28,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2018-04-13 04:07:28,140 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 59 [2018-04-13 04:07:28,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:07:28,140 INFO L459 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2018-04-13 04:07:28,140 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-13 04:07:28,140 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2018-04-13 04:07:28,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-13 04:07:28,141 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:07:28,141 INFO L355 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:07:28,141 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:07:28,141 INFO L82 PathProgramCache]: Analyzing trace with hash -158160317, now seen corresponding path program 9 times [2018-04-13 04:07:28,141 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:07:28,141 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:07:28,142 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:28,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:07:28,142 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:28,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:07:28,155 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:07:28,162 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:07:28,162 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:07:28,162 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:07:28,163 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:07:28,257 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-04-13 04:07:28,258 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:07:28,264 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:07:28,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:07:28,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:28,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:07:28,273 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-13 04:07:28,291 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-13 04:07:28,292 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 04:07:28,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:07:28,312 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-04-13 04:07:28,536 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:07:28,537 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:07:28,537 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-13 04:07:28,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-13 04:07:28,537 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-13 04:07:28,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2018-04-13 04:07:28,538 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 21 states. [2018-04-13 04:07:29,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:07:29,028 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2018-04-13 04:07:29,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-13 04:07:29,028 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2018-04-13 04:07:29,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:07:29,028 INFO L225 Difference]: With dead ends: 72 [2018-04-13 04:07:29,028 INFO L226 Difference]: Without dead ends: 72 [2018-04-13 04:07:29,029 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=1279, Unknown=0, NotChecked=0, Total=1406 [2018-04-13 04:07:29,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-04-13 04:07:29,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2018-04-13 04:07:29,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-04-13 04:07:29,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2018-04-13 04:07:29,030 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 64 [2018-04-13 04:07:29,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:07:29,030 INFO L459 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2018-04-13 04:07:29,031 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-13 04:07:29,031 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2018-04-13 04:07:29,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-13 04:07:29,031 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:07:29,031 INFO L355 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:07:29,031 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:07:29,031 INFO L82 PathProgramCache]: Analyzing trace with hash -596975512, now seen corresponding path program 10 times [2018-04-13 04:07:29,031 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:07:29,031 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:07:29,032 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:29,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:07:29,032 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:29,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:07:29,040 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:07:29,044 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:07:29,044 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:07:29,044 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:07:29,045 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 04:07:29,072 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 04:07:29,072 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:07:29,076 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:07:29,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:07:29,111 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:29,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:07:29,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:29,125 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-13 04:07:29,125 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:07:29,141 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:07:29,143 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-13 04:07:29,143 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:29,152 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:07:29,152 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:07:29,153 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-13 04:07:29,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:29,158 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-13 04:07:29,158 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:07:29,475 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:07:29,476 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:07:29,476 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-13 04:07:29,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-13 04:07:29,476 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-13 04:07:29,477 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2018-04-13 04:07:29,477 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 22 states. [2018-04-13 04:07:30,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:07:30,103 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2018-04-13 04:07:30,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-13 04:07:30,104 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 69 [2018-04-13 04:07:30,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:07:30,104 INFO L225 Difference]: With dead ends: 77 [2018-04-13 04:07:30,104 INFO L226 Difference]: Without dead ends: 77 [2018-04-13 04:07:30,104 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=133, Invalid=1427, Unknown=0, NotChecked=0, Total=1560 [2018-04-13 04:07:30,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-04-13 04:07:30,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2018-04-13 04:07:30,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-04-13 04:07:30,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-04-13 04:07:30,106 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 69 [2018-04-13 04:07:30,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:07:30,106 INFO L459 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-04-13 04:07:30,106 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-13 04:07:30,106 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-04-13 04:07:30,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-13 04:07:30,106 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:07:30,107 INFO L355 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:07:30,107 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:07:30,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1114093923, now seen corresponding path program 11 times [2018-04-13 04:07:30,107 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:07:30,107 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:07:30,108 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:30,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:07:30,108 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:30,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:07:30,124 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:07:30,129 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:07:30,130 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:07:30,130 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:07:30,130 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 04:07:30,201 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-04-13 04:07:30,201 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:07:30,206 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:07:30,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:07:30,219 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:30,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:07:30,225 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:30,229 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-13 04:07:30,229 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:07:30,242 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:07:30,243 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-13 04:07:30,244 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:30,251 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:07:30,252 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:07:30,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-13 04:07:30,252 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:30,275 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-13 04:07:30,275 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:28 [2018-04-13 04:07:30,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-04-13 04:07:30,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:30,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:07:30,346 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:18 [2018-04-13 04:07:30,563 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:07:30,563 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:07:30,563 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-13 04:07:30,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-13 04:07:30,563 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-13 04:07:30,564 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2018-04-13 04:07:30,564 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 22 states. [2018-04-13 04:07:31,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:07:31,273 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2018-04-13 04:07:31,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-13 04:07:31,274 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 74 [2018-04-13 04:07:31,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:07:31,274 INFO L225 Difference]: With dead ends: 82 [2018-04-13 04:07:31,274 INFO L226 Difference]: Without dead ends: 82 [2018-04-13 04:07:31,275 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=125, Invalid=1357, Unknown=0, NotChecked=0, Total=1482 [2018-04-13 04:07:31,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-04-13 04:07:31,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2018-04-13 04:07:31,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-04-13 04:07:31,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2018-04-13 04:07:31,276 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 74 [2018-04-13 04:07:31,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:07:31,276 INFO L459 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2018-04-13 04:07:31,276 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-13 04:07:31,276 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2018-04-13 04:07:31,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-04-13 04:07:31,277 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:07:31,277 INFO L355 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:07:31,277 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:07:31,277 INFO L82 PathProgramCache]: Analyzing trace with hash 2097300808, now seen corresponding path program 12 times [2018-04-13 04:07:31,277 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:07:31,277 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:07:31,278 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:31,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:07:31,278 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:31,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:07:31,291 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:07:31,296 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:07:31,296 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:07:31,296 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:07:31,297 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 04:07:31,411 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-04-13 04:07:31,411 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:07:31,419 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:07:31,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:07:31,436 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:31,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:07:31,439 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-13 04:07:31,458 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-13 04:07:31,458 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 04:07:31,468 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:07:31,468 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-13 04:07:31,847 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 0 proven. 366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:07:31,847 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:07:31,847 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-13 04:07:31,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-13 04:07:31,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-13 04:07:31,848 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=504, Unknown=0, NotChecked=0, Total=552 [2018-04-13 04:07:31,848 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 24 states. [2018-04-13 04:07:32,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:07:32,502 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2018-04-13 04:07:32,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-13 04:07:32,502 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 79 [2018-04-13 04:07:32,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:07:32,502 INFO L225 Difference]: With dead ends: 87 [2018-04-13 04:07:32,502 INFO L226 Difference]: Without dead ends: 87 [2018-04-13 04:07:32,503 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=148, Invalid=1744, Unknown=0, NotChecked=0, Total=1892 [2018-04-13 04:07:32,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-04-13 04:07:32,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2018-04-13 04:07:32,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-04-13 04:07:32,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2018-04-13 04:07:32,505 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 79 [2018-04-13 04:07:32,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:07:32,505 INFO L459 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-04-13 04:07:32,506 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-13 04:07:32,506 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2018-04-13 04:07:32,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-04-13 04:07:32,506 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:07:32,506 INFO L355 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:07:32,507 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:07:32,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1962123133, now seen corresponding path program 13 times [2018-04-13 04:07:32,507 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:07:32,507 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:07:32,507 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:32,508 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:07:32,508 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:32,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:07:32,522 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:07:32,527 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:07:32,528 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:07:32,528 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:07:32,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:07:32,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:07:32,626 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:07:32,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:07:32,645 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:32,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:07:32,649 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-13 04:07:32,666 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-13 04:07:32,667 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 04:07:32,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:07:32,674 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-04-13 04:07:33,046 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:07:33,046 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:07:33,046 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-13 04:07:33,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-13 04:07:33,046 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-13 04:07:33,046 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2018-04-13 04:07:33,047 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 25 states. [2018-04-13 04:07:33,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:07:33,764 INFO L93 Difference]: Finished difference Result 92 states and 93 transitions. [2018-04-13 04:07:33,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-13 04:07:33,764 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 84 [2018-04-13 04:07:33,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:07:33,764 INFO L225 Difference]: With dead ends: 92 [2018-04-13 04:07:33,764 INFO L226 Difference]: Without dead ends: 92 [2018-04-13 04:07:33,765 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=151, Invalid=1919, Unknown=0, NotChecked=0, Total=2070 [2018-04-13 04:07:33,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-04-13 04:07:33,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2018-04-13 04:07:33,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-04-13 04:07:33,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2018-04-13 04:07:33,766 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 84 [2018-04-13 04:07:33,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:07:33,767 INFO L459 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2018-04-13 04:07:33,767 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-13 04:07:33,767 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2018-04-13 04:07:33,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-04-13 04:07:33,767 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:07:33,767 INFO L355 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:07:33,767 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:07:33,767 INFO L82 PathProgramCache]: Analyzing trace with hash 717820456, now seen corresponding path program 14 times [2018-04-13 04:07:33,767 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:07:33,768 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:07:33,768 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:33,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:07:33,768 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:33,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:07:33,784 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:07:33,790 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:07:33,791 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:07:33,791 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:07:33,791 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:07:33,894 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:07:33,894 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:07:33,901 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:07:33,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-13 04:07:33,919 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:33,924 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:07:33,924 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:33,928 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-13 04:07:33,928 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:07:33,940 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:07:33,940 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:07:33,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:07:33,941 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:33,946 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-13 04:07:33,947 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:33,955 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-13 04:07:33,955 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:07:34,441 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 0 proven. 497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:07:34,441 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:07:34,441 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-13 04:07:34,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-13 04:07:34,442 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-13 04:07:34,442 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2018-04-13 04:07:34,442 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand 26 states. [2018-04-13 04:07:35,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:07:35,345 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2018-04-13 04:07:35,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-13 04:07:35,345 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 89 [2018-04-13 04:07:35,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:07:35,346 INFO L225 Difference]: With dead ends: 97 [2018-04-13 04:07:35,346 INFO L226 Difference]: Without dead ends: 97 [2018-04-13 04:07:35,346 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=157, Invalid=2099, Unknown=0, NotChecked=0, Total=2256 [2018-04-13 04:07:35,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-04-13 04:07:35,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2018-04-13 04:07:35,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-04-13 04:07:35,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2018-04-13 04:07:35,348 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 89 [2018-04-13 04:07:35,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:07:35,348 INFO L459 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2018-04-13 04:07:35,348 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-13 04:07:35,349 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2018-04-13 04:07:35,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-04-13 04:07:35,349 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:07:35,349 INFO L355 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:07:35,349 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:07:35,349 INFO L82 PathProgramCache]: Analyzing trace with hash 602054563, now seen corresponding path program 15 times [2018-04-13 04:07:35,349 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:07:35,349 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:07:35,350 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:35,350 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:07:35,350 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:35,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:07:35,368 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:07:35,375 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:07:35,375 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:07:35,375 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:07:35,376 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:07:35,494 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-04-13 04:07:35,494 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:07:35,502 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:07:35,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:07:35,506 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:35,509 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:07:35,536 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-13 04:07:35,570 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-13 04:07:35,570 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 04:07:35,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:07:35,575 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-04-13 04:07:35,949 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:07:35,949 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:07:35,950 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-13 04:07:35,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-13 04:07:35,950 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-13 04:07:35,950 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=649, Unknown=0, NotChecked=0, Total=702 [2018-04-13 04:07:35,950 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 27 states. [2018-04-13 04:07:36,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:07:36,911 INFO L93 Difference]: Finished difference Result 102 states and 103 transitions. [2018-04-13 04:07:36,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-13 04:07:36,912 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 94 [2018-04-13 04:07:36,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:07:36,912 INFO L225 Difference]: With dead ends: 102 [2018-04-13 04:07:36,912 INFO L226 Difference]: Without dead ends: 102 [2018-04-13 04:07:36,913 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=163, Invalid=2287, Unknown=0, NotChecked=0, Total=2450 [2018-04-13 04:07:36,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-04-13 04:07:36,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-04-13 04:07:36,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-04-13 04:07:36,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2018-04-13 04:07:36,914 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 94 [2018-04-13 04:07:36,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:07:36,914 INFO L459 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2018-04-13 04:07:36,915 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-13 04:07:36,915 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2018-04-13 04:07:36,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-04-13 04:07:36,915 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:07:36,915 INFO L355 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:07:36,915 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:07:36,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1604142856, now seen corresponding path program 16 times [2018-04-13 04:07:36,915 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:07:36,915 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:07:36,916 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:36,916 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:07:36,916 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:36,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:07:36,926 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:07:36,929 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:07:36,929 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:07:36,930 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:07:36,930 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 04:07:36,998 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 04:07:36,998 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:07:37,007 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:07:37,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:07:37,011 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:37,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-13 04:07:37,022 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:37,026 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-13 04:07:37,026 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:07:37,046 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:07:37,047 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-13 04:07:37,048 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:37,056 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:07:37,057 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:07:37,058 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-13 04:07:37,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:37,063 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-13 04:07:37,063 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-13 04:07:37,457 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:07:37,457 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:07:37,457 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-13 04:07:37,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-13 04:07:37,458 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-13 04:07:37,458 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=650, Unknown=0, NotChecked=0, Total=702 [2018-04-13 04:07:37,458 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 27 states. [2018-04-13 04:07:38,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:07:38,524 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2018-04-13 04:07:38,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-13 04:07:38,524 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 99 [2018-04-13 04:07:38,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:07:38,525 INFO L225 Difference]: With dead ends: 107 [2018-04-13 04:07:38,525 INFO L226 Difference]: Without dead ends: 107 [2018-04-13 04:07:38,526 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=160, Invalid=2290, Unknown=0, NotChecked=0, Total=2450 [2018-04-13 04:07:38,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-04-13 04:07:38,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2018-04-13 04:07:38,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-04-13 04:07:38,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2018-04-13 04:07:38,528 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 99 [2018-04-13 04:07:38,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:07:38,528 INFO L459 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2018-04-13 04:07:38,528 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-13 04:07:38,528 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2018-04-13 04:07:38,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-04-13 04:07:38,528 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:07:38,528 INFO L355 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:07:38,528 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:07:38,528 INFO L82 PathProgramCache]: Analyzing trace with hash 231503555, now seen corresponding path program 17 times [2018-04-13 04:07:38,528 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:07:38,529 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:07:38,529 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:38,529 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:07:38,529 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:38,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:07:38,540 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:07:38,548 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:07:38,548 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:07:38,549 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:07:38,549 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 04:07:38,732 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-04-13 04:07:38,732 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:07:38,740 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:07:38,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:07:38,745 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:38,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:07:38,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:38,758 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-13 04:07:38,758 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:07:38,770 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:07:38,771 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-13 04:07:38,771 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:38,779 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:07:38,780 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:07:38,781 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-13 04:07:38,781 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:38,786 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-13 04:07:38,786 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-13 04:07:38,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 5 treesize of output 1 [2018-04-13 04:07:38,858 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:38,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:07:38,861 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:18 [2018-04-13 04:07:39,228 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 0 proven. 731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:07:39,228 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:07:39,229 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-13 04:07:39,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-13 04:07:39,229 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-13 04:07:39,229 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2018-04-13 04:07:39,230 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 28 states. [2018-04-13 04:07:40,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:07:40,370 INFO L93 Difference]: Finished difference Result 112 states and 113 transitions. [2018-04-13 04:07:40,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-13 04:07:40,370 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 104 [2018-04-13 04:07:40,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:07:40,371 INFO L225 Difference]: With dead ends: 112 [2018-04-13 04:07:40,371 INFO L226 Difference]: Without dead ends: 112 [2018-04-13 04:07:40,372 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=166, Invalid=2486, Unknown=0, NotChecked=0, Total=2652 [2018-04-13 04:07:40,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-04-13 04:07:40,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2018-04-13 04:07:40,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-04-13 04:07:40,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 111 transitions. [2018-04-13 04:07:40,374 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 111 transitions. Word has length 104 [2018-04-13 04:07:40,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:07:40,375 INFO L459 AbstractCegarLoop]: Abstraction has 110 states and 111 transitions. [2018-04-13 04:07:40,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-13 04:07:40,375 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2018-04-13 04:07:40,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-04-13 04:07:40,375 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:07:40,375 INFO L355 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:07:40,375 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:07:40,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1474094056, now seen corresponding path program 18 times [2018-04-13 04:07:40,376 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:07:40,376 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:07:40,376 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:40,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:07:40,377 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:40,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:07:40,397 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:07:40,404 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:07:40,404 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:07:40,405 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:07:40,405 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 04:07:40,549 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-04-13 04:07:40,549 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:07:40,581 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:07:40,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:07:40,586 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:40,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:07:40,594 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:40,600 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-13 04:07:40,600 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:07:40,616 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:07:40,617 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:07:40,618 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-13 04:07:40,618 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:40,626 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-13 04:07:40,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:40,641 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-13 04:07:40,642 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-13 04:07:41,111 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 0 proven. 819 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:07:41,112 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:07:41,112 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-04-13 04:07:41,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-13 04:07:41,112 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-13 04:07:41,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=756, Unknown=0, NotChecked=0, Total=812 [2018-04-13 04:07:41,113 INFO L87 Difference]: Start difference. First operand 110 states and 111 transitions. Second operand 29 states. [2018-04-13 04:07:42,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:07:42,361 INFO L93 Difference]: Finished difference Result 117 states and 118 transitions. [2018-04-13 04:07:42,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-13 04:07:42,361 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 109 [2018-04-13 04:07:42,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:07:42,362 INFO L225 Difference]: With dead ends: 117 [2018-04-13 04:07:42,362 INFO L226 Difference]: Without dead ends: 117 [2018-04-13 04:07:42,362 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=172, Invalid=2690, Unknown=0, NotChecked=0, Total=2862 [2018-04-13 04:07:42,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-04-13 04:07:42,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-04-13 04:07:42,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-04-13 04:07:42,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2018-04-13 04:07:42,364 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 109 [2018-04-13 04:07:42,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:07:42,364 INFO L459 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2018-04-13 04:07:42,364 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-13 04:07:42,364 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2018-04-13 04:07:42,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-04-13 04:07:42,365 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:07:42,365 INFO L355 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:07:42,365 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:07:42,365 INFO L82 PathProgramCache]: Analyzing trace with hash 388752867, now seen corresponding path program 19 times [2018-04-13 04:07:42,365 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:07:42,365 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:07:42,365 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:42,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:07:42,365 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:42,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:07:42,378 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:07:42,385 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:07:42,385 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:07:42,385 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:07:42,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:07:42,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:07:42,540 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:07:42,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 6 treesize of output 5 [2018-04-13 04:07:42,549 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:42,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:07:42,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:42,562 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-13 04:07:42,562 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:07:42,574 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:07:42,575 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:07:42,575 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-13 04:07:42,575 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:42,581 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-13 04:07:42,581 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:42,585 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-13 04:07:42,585 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:07:43,040 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 0 proven. 912 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:07:43,040 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:07:43,041 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-04-13 04:07:43,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-13 04:07:43,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-13 04:07:43,041 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=869, Unknown=0, NotChecked=0, Total=930 [2018-04-13 04:07:43,041 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 31 states. [2018-04-13 04:07:44,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:07:44,379 INFO L93 Difference]: Finished difference Result 122 states and 123 transitions. [2018-04-13 04:07:44,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-13 04:07:44,379 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 114 [2018-04-13 04:07:44,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:07:44,380 INFO L225 Difference]: With dead ends: 122 [2018-04-13 04:07:44,380 INFO L226 Difference]: Without dead ends: 122 [2018-04-13 04:07:44,381 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=187, Invalid=3119, Unknown=0, NotChecked=0, Total=3306 [2018-04-13 04:07:44,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-04-13 04:07:44,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2018-04-13 04:07:44,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-04-13 04:07:44,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 121 transitions. [2018-04-13 04:07:44,382 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 121 transitions. Word has length 114 [2018-04-13 04:07:44,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:07:44,382 INFO L459 AbstractCegarLoop]: Abstraction has 120 states and 121 transitions. [2018-04-13 04:07:44,382 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-13 04:07:44,382 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2018-04-13 04:07:44,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-04-13 04:07:44,383 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:07:44,383 INFO L355 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:07:44,383 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:07:44,383 INFO L82 PathProgramCache]: Analyzing trace with hash -228202296, now seen corresponding path program 20 times [2018-04-13 04:07:44,383 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:07:44,383 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:07:44,384 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:44,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:07:44,384 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:44,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:07:44,396 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:07:44,403 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:07:44,403 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:07:44,403 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:07:44,404 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:07:44,536 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:07:44,537 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:07:44,545 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:07:44,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:07:44,565 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:44,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:07:44,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:44,582 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-13 04:07:44,583 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:07:44,594 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:07:44,594 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:07:44,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:07:44,599 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:44,606 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-13 04:07:44,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:44,610 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-13 04:07:44,610 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:07:45,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 0 proven. 1010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:07:45,110 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:07:45,110 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-04-13 04:07:45,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-13 04:07:45,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-13 04:07:45,111 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=929, Unknown=0, NotChecked=0, Total=992 [2018-04-13 04:07:45,111 INFO L87 Difference]: Start difference. First operand 120 states and 121 transitions. Second operand 32 states. [2018-04-13 04:07:46,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:07:46,479 INFO L93 Difference]: Finished difference Result 127 states and 128 transitions. [2018-04-13 04:07:46,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-13 04:07:46,479 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 119 [2018-04-13 04:07:46,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:07:46,479 INFO L225 Difference]: With dead ends: 127 [2018-04-13 04:07:46,480 INFO L226 Difference]: Without dead ends: 127 [2018-04-13 04:07:46,480 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=193, Invalid=3347, Unknown=0, NotChecked=0, Total=3540 [2018-04-13 04:07:46,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-04-13 04:07:46,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2018-04-13 04:07:46,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-04-13 04:07:46,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2018-04-13 04:07:46,482 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 119 [2018-04-13 04:07:46,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:07:46,482 INFO L459 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2018-04-13 04:07:46,482 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-13 04:07:46,482 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2018-04-13 04:07:46,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-04-13 04:07:46,482 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:07:46,482 INFO L355 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:07:46,482 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:07:46,483 INFO L82 PathProgramCache]: Analyzing trace with hash -69014269, now seen corresponding path program 21 times [2018-04-13 04:07:46,483 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:07:46,483 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:07:46,483 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:46,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:07:46,483 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:46,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:07:46,497 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:07:46,507 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:07:46,507 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:07:46,507 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:07:46,508 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:07:46,754 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-04-13 04:07:46,755 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:07:46,772 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:07:46,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:07:46,789 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:46,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:07:46,792 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-13 04:07:46,807 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-13 04:07:46,808 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 04:07:46,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:07:46,813 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-04-13 04:07:47,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 0 proven. 1113 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:07:47,375 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:07:47,375 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-04-13 04:07:47,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-13 04:07:47,376 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-13 04:07:47,376 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=991, Unknown=0, NotChecked=0, Total=1056 [2018-04-13 04:07:47,376 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand 33 states. [2018-04-13 04:07:48,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:07:48,649 INFO L93 Difference]: Finished difference Result 132 states and 133 transitions. [2018-04-13 04:07:48,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-13 04:07:48,649 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 124 [2018-04-13 04:07:48,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:07:48,649 INFO L225 Difference]: With dead ends: 132 [2018-04-13 04:07:48,649 INFO L226 Difference]: Without dead ends: 132 [2018-04-13 04:07:48,650 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=199, Invalid=3583, Unknown=0, NotChecked=0, Total=3782 [2018-04-13 04:07:48,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-04-13 04:07:48,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2018-04-13 04:07:48,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-04-13 04:07:48,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 131 transitions. [2018-04-13 04:07:48,652 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 131 transitions. Word has length 124 [2018-04-13 04:07:48,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:07:48,652 INFO L459 AbstractCegarLoop]: Abstraction has 130 states and 131 transitions. [2018-04-13 04:07:48,652 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-13 04:07:48,652 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2018-04-13 04:07:48,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-04-13 04:07:48,652 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:07:48,652 INFO L355 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:07:48,652 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:07:48,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1869195864, now seen corresponding path program 22 times [2018-04-13 04:07:48,653 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:07:48,653 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:07:48,653 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:48,653 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:07:48,653 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:48,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:07:48,666 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:07:48,681 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:07:48,681 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:07:48,681 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:07:48,682 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 04:07:48,778 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 04:07:48,778 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:07:48,787 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:07:48,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-13 04:07:48,793 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:48,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:07:48,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:48,800 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-13 04:07:48,800 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:07:48,809 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:07:48,809 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:07:48,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-13 04:07:48,810 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:48,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-13 04:07:48,814 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:48,818 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-13 04:07:48,818 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:07:49,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:07:49,381 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:07:49,381 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-04-13 04:07:49,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-13 04:07:49,382 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-13 04:07:49,382 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1055, Unknown=0, NotChecked=0, Total=1122 [2018-04-13 04:07:49,382 INFO L87 Difference]: Start difference. First operand 130 states and 131 transitions. Second operand 34 states. [2018-04-13 04:07:50,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:07:50,930 INFO L93 Difference]: Finished difference Result 137 states and 138 transitions. [2018-04-13 04:07:50,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-13 04:07:50,930 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 129 [2018-04-13 04:07:50,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:07:50,930 INFO L225 Difference]: With dead ends: 137 [2018-04-13 04:07:50,931 INFO L226 Difference]: Without dead ends: 137 [2018-04-13 04:07:50,931 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=205, Invalid=3827, Unknown=0, NotChecked=0, Total=4032 [2018-04-13 04:07:50,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-04-13 04:07:50,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2018-04-13 04:07:50,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-04-13 04:07:50,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2018-04-13 04:07:50,933 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 129 [2018-04-13 04:07:50,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:07:50,933 INFO L459 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2018-04-13 04:07:50,933 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-13 04:07:50,933 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2018-04-13 04:07:50,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-04-13 04:07:50,933 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:07:50,933 INFO L355 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:07:50,933 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:07:50,934 INFO L82 PathProgramCache]: Analyzing trace with hash -2058122205, now seen corresponding path program 23 times [2018-04-13 04:07:50,934 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:07:50,934 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:07:50,934 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:50,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:07:50,934 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:50,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:07:50,949 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:07:50,962 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:07:50,962 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:07:50,962 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:07:50,963 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 04:07:51,241 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-04-13 04:07:51,242 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:07:51,252 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:07:51,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-13 04:07:51,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:51,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:07:51,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:51,266 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-13 04:07:51,266 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:07:51,276 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:07:51,277 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-13 04:07:51,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:51,285 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:07:51,285 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:07:51,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-13 04:07:51,286 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:51,291 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-13 04:07:51,292 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:28 [2018-04-13 04:07:51,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:07:51,457 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:51,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:07:51,460 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:18 [2018-04-13 04:07:51,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1334 backedges. 0 proven. 1334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:07:51,897 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:07:51,897 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-04-13 04:07:51,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-13 04:07:51,898 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-13 04:07:51,898 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2018-04-13 04:07:51,898 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 34 states. [2018-04-13 04:07:53,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:07:53,744 INFO L93 Difference]: Finished difference Result 142 states and 143 transitions. [2018-04-13 04:07:53,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-13 04:07:53,745 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 134 [2018-04-13 04:07:53,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:07:53,745 INFO L225 Difference]: With dead ends: 142 [2018-04-13 04:07:53,745 INFO L226 Difference]: Without dead ends: 142 [2018-04-13 04:07:53,746 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=197, Invalid=3709, Unknown=0, NotChecked=0, Total=3906 [2018-04-13 04:07:53,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-04-13 04:07:53,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2018-04-13 04:07:53,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-04-13 04:07:53,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 141 transitions. [2018-04-13 04:07:53,747 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 141 transitions. Word has length 134 [2018-04-13 04:07:53,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:07:53,748 INFO L459 AbstractCegarLoop]: Abstraction has 140 states and 141 transitions. [2018-04-13 04:07:53,748 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-13 04:07:53,748 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 141 transitions. [2018-04-13 04:07:53,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-04-13 04:07:53,748 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:07:53,748 INFO L355 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:07:53,748 INFO L408 AbstractCegarLoop]: === Iteration 40 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:07:53,748 INFO L82 PathProgramCache]: Analyzing trace with hash -162780536, now seen corresponding path program 24 times [2018-04-13 04:07:53,748 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:07:53,748 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:07:53,749 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:53,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:07:53,749 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:53,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:07:53,763 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:07:53,772 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:07:53,772 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:07:53,772 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:07:53,772 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 04:07:53,969 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-04-13 04:07:53,969 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:07:53,981 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:07:53,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 6 treesize of output 5 [2018-04-13 04:07:53,985 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:53,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:07:53,995 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:53,999 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-13 04:07:53,999 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:07:54,020 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:07:54,021 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:07:54,021 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-13 04:07:54,021 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:54,028 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-13 04:07:54,029 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:54,033 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-13 04:07:54,033 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-13 04:07:54,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 0 proven. 1452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:07:54,649 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:07:54,650 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-04-13 04:07:54,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-13 04:07:54,650 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-13 04:07:54,650 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=1122, Unknown=0, NotChecked=0, Total=1190 [2018-04-13 04:07:54,650 INFO L87 Difference]: Start difference. First operand 140 states and 141 transitions. Second operand 35 states. [2018-04-13 04:07:56,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:07:56,428 INFO L93 Difference]: Finished difference Result 147 states and 148 transitions. [2018-04-13 04:07:56,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-13 04:07:56,429 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 139 [2018-04-13 04:07:56,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:07:56,429 INFO L225 Difference]: With dead ends: 147 [2018-04-13 04:07:56,429 INFO L226 Difference]: Without dead ends: 147 [2018-04-13 04:07:56,430 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=208, Invalid=4082, Unknown=0, NotChecked=0, Total=4290 [2018-04-13 04:07:56,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-04-13 04:07:56,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2018-04-13 04:07:56,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-04-13 04:07:56,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2018-04-13 04:07:56,432 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 139 [2018-04-13 04:07:56,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:07:56,432 INFO L459 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2018-04-13 04:07:56,432 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-13 04:07:56,432 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2018-04-13 04:07:56,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-04-13 04:07:56,432 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:07:56,432 INFO L355 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:07:56,432 INFO L408 AbstractCegarLoop]: === Iteration 41 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:07:56,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1436564669, now seen corresponding path program 25 times [2018-04-13 04:07:56,432 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:07:56,433 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:07:56,433 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:56,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:07:56,433 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:56,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:07:56,449 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:07:56,456 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:07:56,456 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:07:56,456 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:07:56,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:07:56,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:07:56,678 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:07:56,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 6 treesize of output 5 [2018-04-13 04:07:56,687 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:56,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:07:56,692 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:56,696 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-13 04:07:56,696 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:07:56,708 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:07:56,709 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-13 04:07:56,709 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:56,743 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:07:56,744 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:07:56,744 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-13 04:07:56,745 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:56,754 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-13 04:07:56,754 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:25 [2018-04-13 04:07:57,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:07:57,147 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:57,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:07:57,151 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:18 [2018-04-13 04:07:57,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1575 backedges. 0 proven. 1575 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:07:57,561 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:07:57,561 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-04-13 04:07:57,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-13 04:07:57,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-13 04:07:57,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=1330, Unknown=0, NotChecked=0, Total=1406 [2018-04-13 04:07:57,562 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 38 states. [2018-04-13 04:07:59,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:07:59,691 INFO L93 Difference]: Finished difference Result 152 states and 153 transitions. [2018-04-13 04:07:59,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-13 04:07:59,692 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 144 [2018-04-13 04:07:59,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:07:59,692 INFO L225 Difference]: With dead ends: 152 [2018-04-13 04:07:59,692 INFO L226 Difference]: Without dead ends: 152 [2018-04-13 04:07:59,693 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 624 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=227, Invalid=4743, Unknown=0, NotChecked=0, Total=4970 [2018-04-13 04:07:59,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-04-13 04:07:59,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2018-04-13 04:07:59,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-04-13 04:07:59,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 151 transitions. [2018-04-13 04:07:59,695 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 151 transitions. Word has length 144 [2018-04-13 04:07:59,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:07:59,695 INFO L459 AbstractCegarLoop]: Abstraction has 150 states and 151 transitions. [2018-04-13 04:07:59,695 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-13 04:07:59,695 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2018-04-13 04:07:59,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-04-13 04:07:59,695 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:07:59,695 INFO L355 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:07:59,696 INFO L408 AbstractCegarLoop]: === Iteration 42 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:07:59,696 INFO L82 PathProgramCache]: Analyzing trace with hash 702900072, now seen corresponding path program 26 times [2018-04-13 04:07:59,696 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:07:59,696 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:07:59,696 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:59,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:07:59,696 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:07:59,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:07:59,714 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:07:59,721 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:07:59,722 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:07:59,722 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:07:59,722 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:07:59,974 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:07:59,974 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:07:59,989 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:07:59,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 6 treesize of output 5 [2018-04-13 04:07:59,993 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:07:59,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:07:59,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:08:00,000 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-13 04:08:00,001 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:08:00,010 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:08:00,012 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-13 04:08:00,012 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:08:00,019 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:08:00,019 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:08:00,020 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-13 04:08:00,020 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:08:00,023 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-13 04:08:00,023 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:08:00,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1703 backedges. 0 proven. 1703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:08:00,760 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:08:00,760 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-04-13 04:08:00,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-13 04:08:00,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-13 04:08:00,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1331, Unknown=0, NotChecked=0, Total=1406 [2018-04-13 04:08:00,761 INFO L87 Difference]: Start difference. First operand 150 states and 151 transitions. Second operand 38 states. [2018-04-13 04:08:03,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:08:03,150 INFO L93 Difference]: Finished difference Result 157 states and 158 transitions. [2018-04-13 04:08:03,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-13 04:08:03,150 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 149 [2018-04-13 04:08:03,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:08:03,151 INFO L225 Difference]: With dead ends: 157 [2018-04-13 04:08:03,151 INFO L226 Difference]: Without dead ends: 157 [2018-04-13 04:08:03,152 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=229, Invalid=4883, Unknown=0, NotChecked=0, Total=5112 [2018-04-13 04:08:03,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-04-13 04:08:03,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2018-04-13 04:08:03,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-04-13 04:08:03,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2018-04-13 04:08:03,154 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 149 [2018-04-13 04:08:03,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:08:03,154 INFO L459 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2018-04-13 04:08:03,154 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-13 04:08:03,154 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2018-04-13 04:08:03,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-04-13 04:08:03,155 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:08:03,155 INFO L355 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:08:03,155 INFO L408 AbstractCegarLoop]: === Iteration 43 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:08:03,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1352035741, now seen corresponding path program 27 times [2018-04-13 04:08:03,155 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:08:03,155 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:08:03,156 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:08:03,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:08:03,156 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:08:03,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:08:03,175 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:08:03,184 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:08:03,184 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:08:03,184 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:08:03,185 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:08:03,530 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-04-13 04:08:03,530 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:08:03,548 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:08:03,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:08:03,563 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:08:03,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:08:03,565 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-13 04:08:03,576 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-13 04:08:03,577 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 04:08:03,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:08:03,581 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-04-13 04:08:04,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 0 proven. 1836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:08:04,209 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:08:04,209 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-04-13 04:08:04,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-13 04:08:04,210 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-13 04:08:04,210 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1405, Unknown=0, NotChecked=0, Total=1482 [2018-04-13 04:08:04,210 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand 39 states. [2018-04-13 04:08:06,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:08:06,129 INFO L93 Difference]: Finished difference Result 162 states and 163 transitions. [2018-04-13 04:08:06,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-13 04:08:06,130 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 154 [2018-04-13 04:08:06,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:08:06,130 INFO L225 Difference]: With dead ends: 162 [2018-04-13 04:08:06,130 INFO L226 Difference]: Without dead ends: 162 [2018-04-13 04:08:06,131 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 683 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=235, Invalid=5167, Unknown=0, NotChecked=0, Total=5402 [2018-04-13 04:08:06,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-04-13 04:08:06,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2018-04-13 04:08:06,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-04-13 04:08:06,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 161 transitions. [2018-04-13 04:08:06,133 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 161 transitions. Word has length 154 [2018-04-13 04:08:06,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:08:06,133 INFO L459 AbstractCegarLoop]: Abstraction has 160 states and 161 transitions. [2018-04-13 04:08:06,133 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-13 04:08:06,133 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2018-04-13 04:08:06,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-04-13 04:08:06,134 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:08:06,134 INFO L355 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:08:06,134 INFO L408 AbstractCegarLoop]: === Iteration 44 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:08:06,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1413483592, now seen corresponding path program 28 times [2018-04-13 04:08:06,134 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:08:06,134 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:08:06,134 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:08:06,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:08:06,134 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:08:06,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:08:06,152 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:08:06,158 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:08:06,159 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:08:06,159 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:08:06,159 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 04:08:06,306 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 04:08:06,306 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:08:06,327 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:08:06,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:08:06,340 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:08:06,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-13 04:08:06,345 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:08:06,350 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-13 04:08:06,350 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:08:06,362 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:08:06,362 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:08:06,363 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-13 04:08:06,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:08:06,368 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-13 04:08:06,369 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:08:06,374 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-13 04:08:06,375 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-13 04:08:07,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1974 backedges. 0 proven. 1974 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:08:07,172 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:08:07,172 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-04-13 04:08:07,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-13 04:08:07,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-13 04:08:07,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=1406, Unknown=0, NotChecked=0, Total=1482 [2018-04-13 04:08:07,173 INFO L87 Difference]: Start difference. First operand 160 states and 161 transitions. Second operand 39 states. [2018-04-13 04:08:09,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:08:09,441 INFO L93 Difference]: Finished difference Result 167 states and 168 transitions. [2018-04-13 04:08:09,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-13 04:08:09,441 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 159 [2018-04-13 04:08:09,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:08:09,442 INFO L225 Difference]: With dead ends: 167 [2018-04-13 04:08:09,442 INFO L226 Difference]: Without dead ends: 167 [2018-04-13 04:08:09,442 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=232, Invalid=5170, Unknown=0, NotChecked=0, Total=5402 [2018-04-13 04:08:09,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-04-13 04:08:09,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2018-04-13 04:08:09,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-04-13 04:08:09,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2018-04-13 04:08:09,444 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 159 [2018-04-13 04:08:09,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:08:09,444 INFO L459 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2018-04-13 04:08:09,444 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-13 04:08:09,444 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2018-04-13 04:08:09,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-04-13 04:08:09,445 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:08:09,445 INFO L355 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:08:09,445 INFO L408 AbstractCegarLoop]: === Iteration 45 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:08:09,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1179842947, now seen corresponding path program 29 times [2018-04-13 04:08:09,445 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:08:09,445 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:08:09,445 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:08:09,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:08:09,445 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:08:09,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:08:09,465 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:08:09,471 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:08:09,471 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:08:09,471 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:08:09,472 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 04:08:09,711 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-04-13 04:08:09,711 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:08:09,737 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:08:09,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:08:09,740 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:08:09,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:08:09,745 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:08:09,765 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-13 04:08:09,765 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:08:09,775 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:08:09,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-13 04:08:09,776 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:08:09,784 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:08:09,784 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:08:09,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-13 04:08:09,785 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:08:09,791 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-13 04:08:09,791 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:28 [2018-04-13 04:08:09,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-04-13 04:08:09,912 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:08:09,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:08:09,916 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:18 [2018-04-13 04:08:10,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2117 backedges. 0 proven. 2117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:08:10,654 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:08:10,687 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-04-13 04:08:10,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-13 04:08:10,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-13 04:08:10,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1482, Unknown=0, NotChecked=0, Total=1560 [2018-04-13 04:08:10,688 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand 40 states. [2018-04-13 04:08:13,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:08:13,121 INFO L93 Difference]: Finished difference Result 172 states and 173 transitions. [2018-04-13 04:08:13,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-13 04:08:13,122 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 164 [2018-04-13 04:08:13,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:08:13,122 INFO L225 Difference]: With dead ends: 172 [2018-04-13 04:08:13,122 INFO L226 Difference]: Without dead ends: 172 [2018-04-13 04:08:13,123 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 613 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=233, Invalid=5317, Unknown=0, NotChecked=0, Total=5550 [2018-04-13 04:08:13,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-04-13 04:08:13,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2018-04-13 04:08:13,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-04-13 04:08:13,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 171 transitions. [2018-04-13 04:08:13,125 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 171 transitions. Word has length 164 [2018-04-13 04:08:13,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:08:13,125 INFO L459 AbstractCegarLoop]: Abstraction has 170 states and 171 transitions. [2018-04-13 04:08:13,125 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-13 04:08:13,126 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 171 transitions. [2018-04-13 04:08:13,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-04-13 04:08:13,126 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:08:13,126 INFO L355 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:08:13,126 INFO L408 AbstractCegarLoop]: === Iteration 46 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:08:13,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1598416600, now seen corresponding path program 30 times [2018-04-13 04:08:13,127 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:08:13,127 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:08:13,127 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:08:13,127 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:08:13,127 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:08:13,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:08:13,157 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:08:13,161 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:08:13,161 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:08:13,161 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:08:13,162 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 04:08:13,475 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-04-13 04:08:13,475 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:08:13,496 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:08:13,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:08:13,512 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:08:13,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:08:13,523 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-13 04:08:13,537 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-13 04:08:13,538 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 04:08:13,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:08:13,544 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-13 04:08:14,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2265 backedges. 0 proven. 2265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:08:14,306 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:08:14,306 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-04-13 04:08:14,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-13 04:08:14,306 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-13 04:08:14,307 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1560, Unknown=0, NotChecked=0, Total=1640 [2018-04-13 04:08:14,307 INFO L87 Difference]: Start difference. First operand 170 states and 171 transitions. Second operand 41 states. [2018-04-13 04:08:16,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:08:16,611 INFO L93 Difference]: Finished difference Result 177 states and 178 transitions. [2018-04-13 04:08:16,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-13 04:08:16,611 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 169 [2018-04-13 04:08:16,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:08:16,612 INFO L225 Difference]: With dead ends: 177 [2018-04-13 04:08:16,612 INFO L226 Difference]: Without dead ends: 177 [2018-04-13 04:08:16,612 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=244, Invalid=5762, Unknown=0, NotChecked=0, Total=6006 [2018-04-13 04:08:16,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-04-13 04:08:16,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2018-04-13 04:08:16,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-04-13 04:08:16,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2018-04-13 04:08:16,614 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 169 [2018-04-13 04:08:16,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:08:16,615 INFO L459 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2018-04-13 04:08:16,615 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-13 04:08:16,615 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2018-04-13 04:08:16,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-04-13 04:08:16,616 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:08:16,616 INFO L355 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:08:16,616 INFO L408 AbstractCegarLoop]: === Iteration 47 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:08:16,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1367476061, now seen corresponding path program 31 times [2018-04-13 04:08:16,616 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:08:16,616 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:08:16,617 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:08:16,617 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:08:16,617 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:08:16,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:08:16,656 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:08:16,667 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:08:16,667 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:08:16,667 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:08:16,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:08:16,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:08:16,997 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:08:17,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:08:17,001 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:08:17,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:08:17,006 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:08:17,009 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-13 04:08:17,009 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:08:17,019 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:08:17,020 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-13 04:08:17,020 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:08:17,026 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:08:17,027 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:08:17,027 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-13 04:08:17,027 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:08:17,031 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-13 04:08:17,031 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-13 04:08:17,905 INFO L134 CoverageAnalysis]: Checked inductivity of 2418 backedges. 0 proven. 2418 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:08:17,905 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:08:17,905 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-04-13 04:08:17,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-13 04:08:17,906 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-13 04:08:17,906 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1640, Unknown=0, NotChecked=0, Total=1722 [2018-04-13 04:08:17,906 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 42 states. [2018-04-13 04:08:20,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:08:20,497 INFO L93 Difference]: Finished difference Result 182 states and 183 transitions. [2018-04-13 04:08:20,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-04-13 04:08:20,498 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 174 [2018-04-13 04:08:20,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:08:20,499 INFO L225 Difference]: With dead ends: 182 [2018-04-13 04:08:20,499 INFO L226 Difference]: Without dead ends: 182 [2018-04-13 04:08:20,499 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 733 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=250, Invalid=6070, Unknown=0, NotChecked=0, Total=6320 [2018-04-13 04:08:20,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-04-13 04:08:20,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2018-04-13 04:08:20,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-04-13 04:08:20,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 181 transitions. [2018-04-13 04:08:20,501 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 181 transitions. Word has length 174 [2018-04-13 04:08:20,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:08:20,501 INFO L459 AbstractCegarLoop]: Abstraction has 180 states and 181 transitions. [2018-04-13 04:08:20,501 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-13 04:08:20,501 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 181 transitions. [2018-04-13 04:08:20,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-04-13 04:08:20,502 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:08:20,502 INFO L355 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:08:20,502 INFO L408 AbstractCegarLoop]: === Iteration 48 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:08:20,502 INFO L82 PathProgramCache]: Analyzing trace with hash 489786888, now seen corresponding path program 32 times [2018-04-13 04:08:20,502 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:08:20,502 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:08:20,502 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:08:20,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:08:20,502 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:08:20,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:08:20,524 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:08:20,532 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:08:20,532 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:08:20,532 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:08:20,533 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:08:20,789 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:08:20,789 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:08:20,829 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:08:20,833 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:08:20,833 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:08:20,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:08:20,841 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:08:20,846 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-13 04:08:20,847 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:08:20,859 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:08:20,860 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-13 04:08:20,861 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:08:20,877 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:08:20,878 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:08:20,878 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-13 04:08:20,878 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:08:20,884 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-13 04:08:20,884 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-13 04:08:21,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2576 backedges. 0 proven. 2576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:08:21,951 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:08:21,952 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-04-13 04:08:21,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-04-13 04:08:21,952 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-04-13 04:08:21,952 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1804, Unknown=0, NotChecked=0, Total=1892 [2018-04-13 04:08:21,952 INFO L87 Difference]: Start difference. First operand 180 states and 181 transitions. Second operand 44 states. [2018-04-13 04:08:24,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:08:24,732 INFO L93 Difference]: Finished difference Result 187 states and 188 transitions. [2018-04-13 04:08:24,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-13 04:08:24,732 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 179 [2018-04-13 04:08:24,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:08:24,733 INFO L225 Difference]: With dead ends: 187 [2018-04-13 04:08:24,733 INFO L226 Difference]: Without dead ends: 187 [2018-04-13 04:08:24,733 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 911 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=268, Invalid=6704, Unknown=0, NotChecked=0, Total=6972 [2018-04-13 04:08:24,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-04-13 04:08:24,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2018-04-13 04:08:24,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-04-13 04:08:24,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 186 transitions. [2018-04-13 04:08:24,736 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 186 transitions. Word has length 179 [2018-04-13 04:08:24,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:08:24,736 INFO L459 AbstractCegarLoop]: Abstraction has 185 states and 186 transitions. [2018-04-13 04:08:24,736 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-04-13 04:08:24,736 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 186 transitions. [2018-04-13 04:08:24,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-04-13 04:08:24,736 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:08:24,737 INFO L355 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:08:24,737 INFO L408 AbstractCegarLoop]: === Iteration 49 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:08:24,737 INFO L82 PathProgramCache]: Analyzing trace with hash -724791357, now seen corresponding path program 33 times [2018-04-13 04:08:24,737 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:08:24,737 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:08:24,737 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:08:24,737 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:08:24,737 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:08:24,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:08:24,760 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:08:24,770 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:08:24,770 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:08:24,770 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:08:24,770 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:08:25,074 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-04-13 04:08:25,074 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:08:25,093 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:08:25,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:08:25,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:08:25,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:08:25,100 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-13 04:08:25,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-13 04:08:25,116 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 04:08:25,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:08:25,122 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-04-13 04:08:25,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2739 backedges. 0 proven. 2739 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:08:25,965 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:08:25,965 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-04-13 04:08:25,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-04-13 04:08:25,966 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-04-13 04:08:25,967 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1891, Unknown=0, NotChecked=0, Total=1980 [2018-04-13 04:08:25,967 INFO L87 Difference]: Start difference. First operand 185 states and 186 transitions. Second operand 45 states. [2018-04-13 04:08:28,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:08:28,498 INFO L93 Difference]: Finished difference Result 192 states and 193 transitions. [2018-04-13 04:08:28,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-13 04:08:28,498 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 184 [2018-04-13 04:08:28,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:08:28,499 INFO L225 Difference]: With dead ends: 192 [2018-04-13 04:08:28,499 INFO L226 Difference]: Without dead ends: 192 [2018-04-13 04:08:28,499 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 926 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=271, Invalid=7039, Unknown=0, NotChecked=0, Total=7310 [2018-04-13 04:08:28,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-04-13 04:08:28,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 190. [2018-04-13 04:08:28,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-04-13 04:08:28,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 191 transitions. [2018-04-13 04:08:28,501 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 191 transitions. Word has length 184 [2018-04-13 04:08:28,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:08:28,501 INFO L459 AbstractCegarLoop]: Abstraction has 190 states and 191 transitions. [2018-04-13 04:08:28,501 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-04-13 04:08:28,501 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 191 transitions. [2018-04-13 04:08:28,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-04-13 04:08:28,501 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:08:28,502 INFO L355 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:08:28,502 INFO L408 AbstractCegarLoop]: === Iteration 50 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:08:28,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1710986520, now seen corresponding path program 34 times [2018-04-13 04:08:28,502 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:08:28,502 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:08:28,502 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:08:28,502 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:08:28,502 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:08:28,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:08:28,526 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:08:28,534 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:08:28,534 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:08:28,534 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:08:28,534 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 04:08:28,801 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 04:08:28,801 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:08:28,829 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:08:28,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:08:28,836 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:08:28,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:08:28,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:08:28,843 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-13 04:08:28,843 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:08:28,853 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:08:28,854 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:08:28,854 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-13 04:08:28,854 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:08:28,860 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-13 04:08:28,860 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:08:28,864 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-13 04:08:28,864 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-13 04:08:29,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2907 backedges. 0 proven. 2907 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:08:29,903 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:08:29,904 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-04-13 04:08:29,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-04-13 04:08:29,904 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-04-13 04:08:29,905 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1892, Unknown=0, NotChecked=0, Total=1980 [2018-04-13 04:08:29,905 INFO L87 Difference]: Start difference. First operand 190 states and 191 transitions. Second operand 45 states. [2018-04-13 04:08:32,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:08:32,874 INFO L93 Difference]: Finished difference Result 197 states and 198 transitions. [2018-04-13 04:08:32,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-13 04:08:32,874 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 189 [2018-04-13 04:08:32,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:08:32,875 INFO L225 Difference]: With dead ends: 197 [2018-04-13 04:08:32,875 INFO L226 Difference]: Without dead ends: 197 [2018-04-13 04:08:32,875 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 854 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=268, Invalid=7042, Unknown=0, NotChecked=0, Total=7310 [2018-04-13 04:08:32,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-04-13 04:08:32,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2018-04-13 04:08:32,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-04-13 04:08:32,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 196 transitions. [2018-04-13 04:08:32,877 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 196 transitions. Word has length 189 [2018-04-13 04:08:32,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:08:32,877 INFO L459 AbstractCegarLoop]: Abstraction has 195 states and 196 transitions. [2018-04-13 04:08:32,877 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-04-13 04:08:32,877 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 196 transitions. [2018-04-13 04:08:32,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-04-13 04:08:32,877 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:08:32,878 INFO L355 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:08:32,878 INFO L408 AbstractCegarLoop]: === Iteration 51 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:08:32,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1939914467, now seen corresponding path program 35 times [2018-04-13 04:08:32,878 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:08:32,878 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:08:32,878 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:08:32,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:08:32,878 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:08:32,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:08:32,903 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:08:32,909 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:08:32,910 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:08:32,910 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:08:32,910 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 04:08:33,458 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-04-13 04:08:33,458 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:08:33,477 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:08:33,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:08:33,480 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:08:33,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:08:33,493 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-13 04:08:33,505 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-13 04:08:33,506 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 04:08:33,511 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:08:33,511 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-13 04:08:34,368 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:08:34,369 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:08:34,369 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-04-13 04:08:34,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-04-13 04:08:34,369 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-04-13 04:08:34,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-04-13 04:08:34,369 INFO L87 Difference]: Start difference. First operand 195 states and 196 transitions. Second operand 45 states. [2018-04-13 04:08:36,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:08:36,918 INFO L93 Difference]: Finished difference Result 202 states and 203 transitions. [2018-04-13 04:08:36,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-13 04:08:36,918 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 194 [2018-04-13 04:08:36,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:08:36,919 INFO L225 Difference]: With dead ends: 202 [2018-04-13 04:08:36,919 INFO L226 Difference]: Without dead ends: 202 [2018-04-13 04:08:36,919 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 813 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=265, Invalid=7045, Unknown=0, NotChecked=0, Total=7310 [2018-04-13 04:08:36,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-04-13 04:08:36,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 200. [2018-04-13 04:08:36,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-04-13 04:08:36,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 201 transitions. [2018-04-13 04:08:36,921 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 201 transitions. Word has length 194 [2018-04-13 04:08:36,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:08:36,921 INFO L459 AbstractCegarLoop]: Abstraction has 200 states and 201 transitions. [2018-04-13 04:08:36,921 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-04-13 04:08:36,921 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 201 transitions. [2018-04-13 04:08:36,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-04-13 04:08:36,922 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:08:36,922 INFO L355 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:08:36,922 INFO L408 AbstractCegarLoop]: === Iteration 52 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:08:36,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1978617912, now seen corresponding path program 36 times [2018-04-13 04:08:36,922 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:08:36,922 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:08:36,922 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:08:36,922 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:08:36,923 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:08:36,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:08:36,949 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:08:36,958 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:08:36,958 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:08:36,958 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:08:36,958 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 04:08:37,435 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-04-13 04:08:37,436 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:08:37,460 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:08:37,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:08:37,463 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:08:37,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:08:37,467 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:08:37,470 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-13 04:08:37,471 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:08:37,488 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:08:37,490 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:08:37,490 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-13 04:08:37,490 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:08:37,496 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-13 04:08:37,496 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:08:37,500 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-13 04:08:37,500 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-13 04:08:38,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3258 backedges. 0 proven. 3258 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:08:38,534 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:08:38,534 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-04-13 04:08:38,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-04-13 04:08:38,535 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-04-13 04:08:38,535 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=2070, Unknown=0, NotChecked=0, Total=2162 [2018-04-13 04:08:38,535 INFO L87 Difference]: Start difference. First operand 200 states and 201 transitions. Second operand 47 states. [2018-04-13 04:08:41,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:08:41,782 INFO L93 Difference]: Finished difference Result 207 states and 208 transitions. [2018-04-13 04:08:41,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-13 04:08:41,782 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 199 [2018-04-13 04:08:41,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:08:41,783 INFO L225 Difference]: With dead ends: 207 [2018-04-13 04:08:41,783 INFO L226 Difference]: Without dead ends: 207 [2018-04-13 04:08:41,783 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 938 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=280, Invalid=7730, Unknown=0, NotChecked=0, Total=8010 [2018-04-13 04:08:41,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-04-13 04:08:41,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 205. [2018-04-13 04:08:41,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-04-13 04:08:41,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 206 transitions. [2018-04-13 04:08:41,785 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 206 transitions. Word has length 199 [2018-04-13 04:08:41,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:08:41,785 INFO L459 AbstractCegarLoop]: Abstraction has 205 states and 206 transitions. [2018-04-13 04:08:41,785 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-04-13 04:08:41,785 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 206 transitions. [2018-04-13 04:08:41,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-04-13 04:08:41,786 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:08:41,786 INFO L355 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:08:41,786 INFO L408 AbstractCegarLoop]: === Iteration 53 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:08:41,786 INFO L82 PathProgramCache]: Analyzing trace with hash 853313027, now seen corresponding path program 37 times [2018-04-13 04:08:41,786 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:08:41,786 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:08:41,786 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:08:41,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:08:41,787 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:08:41,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:08:41,828 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:08:41,833 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:08:41,833 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:08:41,833 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:08:41,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:08:42,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:08:42,288 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:08:42,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:08:42,291 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:08:42,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:08:42,304 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:08:42,308 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-13 04:08:42,308 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:08:42,319 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:08:42,319 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:08:42,320 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-13 04:08:42,320 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:08:42,325 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-13 04:08:42,325 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:08:42,329 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-13 04:08:42,329 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-13 04:08:43,521 INFO L134 CoverageAnalysis]: Checked inductivity of 3441 backedges. 0 proven. 3441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:08:43,521 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:08:43,521 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-04-13 04:08:43,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-04-13 04:08:43,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-04-13 04:08:43,522 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=2162, Unknown=0, NotChecked=0, Total=2256 [2018-04-13 04:08:43,522 INFO L87 Difference]: Start difference. First operand 205 states and 206 transitions. Second operand 48 states. [2018-04-13 04:08:46,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:08:46,886 INFO L93 Difference]: Finished difference Result 212 states and 213 transitions. [2018-04-13 04:08:46,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-13 04:08:46,907 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 204 [2018-04-13 04:08:46,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:08:46,907 INFO L225 Difference]: With dead ends: 212 [2018-04-13 04:08:46,907 INFO L226 Difference]: Without dead ends: 212 [2018-04-13 04:08:46,908 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 982 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=286, Invalid=8086, Unknown=0, NotChecked=0, Total=8372 [2018-04-13 04:08:46,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-04-13 04:08:46,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 210. [2018-04-13 04:08:46,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-04-13 04:08:46,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 211 transitions. [2018-04-13 04:08:46,909 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 211 transitions. Word has length 204 [2018-04-13 04:08:46,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:08:46,910 INFO L459 AbstractCegarLoop]: Abstraction has 210 states and 211 transitions. [2018-04-13 04:08:46,910 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-04-13 04:08:46,910 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 211 transitions. [2018-04-13 04:08:46,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-04-13 04:08:46,910 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:08:46,910 INFO L355 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:08:46,910 INFO L408 AbstractCegarLoop]: === Iteration 54 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:08:46,910 INFO L82 PathProgramCache]: Analyzing trace with hash -491496280, now seen corresponding path program 38 times [2018-04-13 04:08:46,910 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:08:46,910 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:08:46,911 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:08:46,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:08:46,911 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:08:46,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:08:46,939 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:08:46,951 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:08:46,951 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:08:46,951 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:08:46,952 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:08:47,487 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:08:47,488 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:08:47,504 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:08:47,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:08:47,507 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:08:47,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:08:47,510 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-13 04:08:47,520 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-13 04:08:47,520 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 04:08:47,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:08:47,525 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-04-13 04:08:48,504 INFO L134 CoverageAnalysis]: Checked inductivity of 3629 backedges. 0 proven. 3629 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:08:48,504 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:08:48,504 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-04-13 04:08:48,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-04-13 04:08:48,505 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-04-13 04:08:48,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2447, Unknown=0, NotChecked=0, Total=2550 [2018-04-13 04:08:48,505 INFO L87 Difference]: Start difference. First operand 210 states and 211 transitions. Second operand 51 states. [2018-04-13 04:08:51,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:08:51,493 INFO L93 Difference]: Finished difference Result 217 states and 218 transitions. [2018-04-13 04:08:51,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-04-13 04:08:51,493 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 209 [2018-04-13 04:08:51,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:08:51,494 INFO L225 Difference]: With dead ends: 217 [2018-04-13 04:08:51,494 INFO L226 Difference]: Without dead ends: 217 [2018-04-13 04:08:51,495 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1287 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=313, Invalid=9193, Unknown=0, NotChecked=0, Total=9506 [2018-04-13 04:08:51,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-04-13 04:08:51,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 215. [2018-04-13 04:08:51,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-04-13 04:08:51,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 216 transitions. [2018-04-13 04:08:51,496 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 216 transitions. Word has length 209 [2018-04-13 04:08:51,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:08:51,497 INFO L459 AbstractCegarLoop]: Abstraction has 215 states and 216 transitions. [2018-04-13 04:08:51,497 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-04-13 04:08:51,497 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 216 transitions. [2018-04-13 04:08:51,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-04-13 04:08:51,497 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:08:51,497 INFO L355 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:08:51,497 INFO L408 AbstractCegarLoop]: === Iteration 55 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:08:51,497 INFO L82 PathProgramCache]: Analyzing trace with hash -941497053, now seen corresponding path program 39 times [2018-04-13 04:08:51,497 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:08:51,497 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:08:51,498 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:08:51,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:08:51,498 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:08:51,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:08:51,527 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:08:51,533 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:08:51,534 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:08:51,534 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:08:51,534 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:08:52,147 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-04-13 04:08:52,147 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:08:52,192 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:08:52,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:08:52,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:08:52,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:08:52,222 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:08:52,226 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-13 04:08:52,226 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:08:52,238 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:08:52,239 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-13 04:08:52,239 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:08:52,248 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:08:52,249 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:08:52,249 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-13 04:08:52,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:08:52,254 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-13 04:08:52,254 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-13 04:08:53,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3822 backedges. 0 proven. 3822 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:08:53,459 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:08:53,459 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-04-13 04:08:53,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-04-13 04:08:53,459 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-04-13 04:08:53,460 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=2352, Unknown=0, NotChecked=0, Total=2450 [2018-04-13 04:08:53,460 INFO L87 Difference]: Start difference. First operand 215 states and 216 transitions. Second operand 50 states. [2018-04-13 04:08:57,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:08:57,105 INFO L93 Difference]: Finished difference Result 222 states and 223 transitions. [2018-04-13 04:08:57,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-04-13 04:08:57,105 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 214 [2018-04-13 04:08:57,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:08:57,106 INFO L225 Difference]: With dead ends: 222 [2018-04-13 04:08:57,106 INFO L226 Difference]: Without dead ends: 222 [2018-04-13 04:08:57,107 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1073 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=298, Invalid=8822, Unknown=0, NotChecked=0, Total=9120 [2018-04-13 04:08:57,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-04-13 04:08:57,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2018-04-13 04:08:57,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-04-13 04:08:57,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 221 transitions. [2018-04-13 04:08:57,108 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 221 transitions. Word has length 214 [2018-04-13 04:08:57,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:08:57,109 INFO L459 AbstractCegarLoop]: Abstraction has 220 states and 221 transitions. [2018-04-13 04:08:57,109 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-04-13 04:08:57,109 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 221 transitions. [2018-04-13 04:08:57,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-04-13 04:08:57,109 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:08:57,109 INFO L355 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:08:57,109 INFO L408 AbstractCegarLoop]: === Iteration 56 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:08:57,109 INFO L82 PathProgramCache]: Analyzing trace with hash -70422136, now seen corresponding path program 40 times [2018-04-13 04:08:57,109 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:08:57,109 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:08:57,110 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:08:57,110 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:08:57,110 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:08:57,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:08:57,141 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:08:57,152 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:08:57,152 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:08:57,152 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:08:57,152 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 04:08:57,654 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 04:08:57,654 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:08:57,701 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:08:57,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:08:57,705 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:08:57,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:08:57,709 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:08:57,712 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-13 04:08:57,713 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:08:57,723 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:08:57,724 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-13 04:08:57,724 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:08:57,737 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:08:57,737 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:08:57,738 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-13 04:08:57,738 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:08:57,742 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-13 04:08:57,742 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-13 04:08:59,014 INFO L134 CoverageAnalysis]: Checked inductivity of 4020 backedges. 0 proven. 4020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:08:59,014 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:08:59,014 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-04-13 04:08:59,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-04-13 04:08:59,014 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-04-13 04:08:59,015 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=2450, Unknown=0, NotChecked=0, Total=2550 [2018-04-13 04:08:59,015 INFO L87 Difference]: Start difference. First operand 220 states and 221 transitions. Second operand 51 states. [2018-04-13 04:09:03,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:09:03,118 INFO L93 Difference]: Finished difference Result 227 states and 228 transitions. [2018-04-13 04:09:03,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-04-13 04:09:03,118 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 219 [2018-04-13 04:09:03,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:09:03,119 INFO L225 Difference]: With dead ends: 227 [2018-04-13 04:09:03,119 INFO L226 Difference]: Without dead ends: 227 [2018-04-13 04:09:03,119 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1127 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=304, Invalid=9202, Unknown=0, NotChecked=0, Total=9506 [2018-04-13 04:09:03,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-04-13 04:09:03,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 225. [2018-04-13 04:09:03,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-04-13 04:09:03,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 226 transitions. [2018-04-13 04:09:03,121 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 226 transitions. Word has length 219 [2018-04-13 04:09:03,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:09:03,121 INFO L459 AbstractCegarLoop]: Abstraction has 225 states and 226 transitions. [2018-04-13 04:09:03,121 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-04-13 04:09:03,121 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 226 transitions. [2018-04-13 04:09:03,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-04-13 04:09:03,122 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:09:03,122 INFO L355 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:09:03,122 INFO L408 AbstractCegarLoop]: === Iteration 57 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:09:03,122 INFO L82 PathProgramCache]: Analyzing trace with hash 361946179, now seen corresponding path program 41 times [2018-04-13 04:09:03,122 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:09:03,122 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:09:03,123 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:09:03,123 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:09:03,123 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:09:03,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:09:03,158 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:09:03,170 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:09:03,170 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:09:03,170 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:09:03,170 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 04:09:03,934 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-04-13 04:09:03,934 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:09:03,981 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:09:03,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 6 treesize of output 5 [2018-04-13 04:09:03,990 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:09:03,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:09:03,993 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-13 04:09:04,004 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-13 04:09:04,004 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 04:09:04,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:09:04,010 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-13 04:09:04,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select 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-13 04:09:04,155 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:09:04,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:09:04,158 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:17 [2018-04-13 04:09:05,309 INFO L134 CoverageAnalysis]: Checked inductivity of 4223 backedges. 0 proven. 4223 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:09:05,310 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:09:05,310 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-04-13 04:09:05,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-04-13 04:09:05,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-04-13 04:09:05,310 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2651, Unknown=0, NotChecked=0, Total=2756 [2018-04-13 04:09:05,311 INFO L87 Difference]: Start difference. First operand 225 states and 226 transitions. Second operand 53 states. [2018-04-13 04:09:09,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:09:09,221 INFO L93 Difference]: Finished difference Result 232 states and 233 transitions. [2018-04-13 04:09:09,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-04-13 04:09:09,221 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 224 [2018-04-13 04:09:09,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:09:09,222 INFO L225 Difference]: With dead ends: 232 [2018-04-13 04:09:09,222 INFO L226 Difference]: Without dead ends: 232 [2018-04-13 04:09:09,222 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1306 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=319, Invalid=9983, Unknown=0, NotChecked=0, Total=10302 [2018-04-13 04:09:09,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-04-13 04:09:09,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 230. [2018-04-13 04:09:09,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-04-13 04:09:09,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 231 transitions. [2018-04-13 04:09:09,224 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 231 transitions. Word has length 224 [2018-04-13 04:09:09,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:09:09,224 INFO L459 AbstractCegarLoop]: Abstraction has 230 states and 231 transitions. [2018-04-13 04:09:09,224 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-04-13 04:09:09,224 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 231 transitions. [2018-04-13 04:09:09,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-04-13 04:09:09,225 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:09:09,225 INFO L355 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:09:09,225 INFO L408 AbstractCegarLoop]: === Iteration 58 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:09:09,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1874456168, now seen corresponding path program 42 times [2018-04-13 04:09:09,225 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:09:09,226 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:09:09,226 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:09:09,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:09:09,226 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:09:09,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:09:09,266 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:09:09,273 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:09:09,274 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:09:09,274 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:09:09,274 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 04:09:09,998 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-04-13 04:09:09,998 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:09:10,037 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:09:10,041 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:09:10,041 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:09:10,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:09:10,046 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:09:10,049 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-13 04:09:10,050 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:09:10,059 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:09:10,060 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-13 04:09:10,060 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:09:10,067 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:09:10,067 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:09:10,068 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-13 04:09:10,068 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:09:10,072 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-13 04:09:10,072 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-13 04:09:11,523 INFO L134 CoverageAnalysis]: Checked inductivity of 4431 backedges. 0 proven. 4431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:09:11,523 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:09:11,523 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-04-13 04:09:11,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-04-13 04:09:11,524 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-04-13 04:09:11,524 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=2652, Unknown=0, NotChecked=0, Total=2756 [2018-04-13 04:09:11,524 INFO L87 Difference]: Start difference. First operand 230 states and 231 transitions. Second operand 53 states. [2018-04-13 04:09:15,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:09:15,611 INFO L93 Difference]: Finished difference Result 237 states and 238 transitions. [2018-04-13 04:09:15,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-04-13 04:09:15,612 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 229 [2018-04-13 04:09:15,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:09:15,612 INFO L225 Difference]: With dead ends: 237 [2018-04-13 04:09:15,612 INFO L226 Difference]: Without dead ends: 237 [2018-04-13 04:09:15,613 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1217 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=316, Invalid=9986, Unknown=0, NotChecked=0, Total=10302 [2018-04-13 04:09:15,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-04-13 04:09:15,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 235. [2018-04-13 04:09:15,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-04-13 04:09:15,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 236 transitions. [2018-04-13 04:09:15,614 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 236 transitions. Word has length 229 [2018-04-13 04:09:15,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:09:15,614 INFO L459 AbstractCegarLoop]: Abstraction has 235 states and 236 transitions. [2018-04-13 04:09:15,614 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-04-13 04:09:15,614 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 236 transitions. [2018-04-13 04:09:15,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-04-13 04:09:15,615 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:09:15,615 INFO L355 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:09:15,615 INFO L408 AbstractCegarLoop]: === Iteration 59 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:09:15,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1280404323, now seen corresponding path program 43 times [2018-04-13 04:09:15,615 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:09:15,615 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:09:15,616 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:09:15,616 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:09:15,616 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:09:15,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:09:15,653 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:09:15,663 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:09:15,663 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:09:15,663 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:09:15,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:09:16,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:09:16,062 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:09:16,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:09:16,065 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:09:16,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:09:16,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:09:16,080 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-13 04:09:16,080 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:09:16,089 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:09:16,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:09:16,090 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:09:16,096 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:09:16,096 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:09:16,096 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-13 04:09:16,097 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:09:16,100 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-13 04:09:16,100 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:09:17,493 INFO L134 CoverageAnalysis]: Checked inductivity of 4644 backedges. 0 proven. 4644 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:09:17,493 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:09:17,493 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-04-13 04:09:17,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-04-13 04:09:17,494 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-04-13 04:09:17,494 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2861, Unknown=0, NotChecked=0, Total=2970 [2018-04-13 04:09:17,494 INFO L87 Difference]: Start difference. First operand 235 states and 236 transitions. Second operand 55 states. [2018-04-13 04:09:21,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:09:21,756 INFO L93 Difference]: Finished difference Result 242 states and 243 transitions. [2018-04-13 04:09:21,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-04-13 04:09:21,756 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 234 [2018-04-13 04:09:21,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:09:21,757 INFO L225 Difference]: With dead ends: 242 [2018-04-13 04:09:21,757 INFO L226 Difference]: Without dead ends: 242 [2018-04-13 04:09:21,758 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1411 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=331, Invalid=10799, Unknown=0, NotChecked=0, Total=11130 [2018-04-13 04:09:21,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-04-13 04:09:21,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 240. [2018-04-13 04:09:21,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-04-13 04:09:21,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 241 transitions. [2018-04-13 04:09:21,760 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 241 transitions. Word has length 234 [2018-04-13 04:09:21,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:09:21,760 INFO L459 AbstractCegarLoop]: Abstraction has 240 states and 241 transitions. [2018-04-13 04:09:21,760 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-04-13 04:09:21,760 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 241 transitions. [2018-04-13 04:09:21,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-04-13 04:09:21,761 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:09:21,762 INFO L355 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:09:21,762 INFO L408 AbstractCegarLoop]: === Iteration 60 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:09:21,762 INFO L82 PathProgramCache]: Analyzing trace with hash -78130360, now seen corresponding path program 44 times [2018-04-13 04:09:21,762 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:09:21,762 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:09:21,763 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:09:21,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:09:21,763 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:09:21,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:09:21,807 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:09:21,815 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:09:21,815 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:09:21,815 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:09:21,815 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:09:22,203 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:09:22,203 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:09:22,282 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:09:22,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:09:22,286 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:09:22,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:09:22,289 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-13 04:09:22,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, 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-13 04:09:22,305 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 04:09:22,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:09:22,319 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-04-13 04:09:23,665 INFO L134 CoverageAnalysis]: Checked inductivity of 4862 backedges. 0 proven. 4862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:09:23,665 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:09:23,666 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-04-13 04:09:23,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-04-13 04:09:23,666 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-04-13 04:09:23,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=3188, Unknown=0, NotChecked=0, Total=3306 [2018-04-13 04:09:23,666 INFO L87 Difference]: Start difference. First operand 240 states and 241 transitions. Second operand 58 states. [2018-04-13 04:09:27,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:09:27,680 INFO L93 Difference]: Finished difference Result 247 states and 248 transitions. [2018-04-13 04:09:27,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-04-13 04:09:27,714 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 239 [2018-04-13 04:09:27,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:09:27,715 INFO L225 Difference]: With dead ends: 247 [2018-04-13 04:09:27,716 INFO L226 Difference]: Without dead ends: 247 [2018-04-13 04:09:27,717 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1728 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=358, Invalid=12074, Unknown=0, NotChecked=0, Total=12432 [2018-04-13 04:09:27,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-04-13 04:09:27,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 245. [2018-04-13 04:09:27,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-04-13 04:09:27,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 246 transitions. [2018-04-13 04:09:27,720 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 246 transitions. Word has length 239 [2018-04-13 04:09:27,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:09:27,720 INFO L459 AbstractCegarLoop]: Abstraction has 245 states and 246 transitions. [2018-04-13 04:09:27,720 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-04-13 04:09:27,720 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 246 transitions. [2018-04-13 04:09:27,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-04-13 04:09:27,721 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:09:27,721 INFO L355 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:09:27,721 INFO L408 AbstractCegarLoop]: === Iteration 61 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:09:27,722 INFO L82 PathProgramCache]: Analyzing trace with hash 167744131, now seen corresponding path program 45 times [2018-04-13 04:09:27,722 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:09:27,722 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:09:27,722 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:09:27,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:09:27,722 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:09:27,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:09:27,793 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:09:27,806 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:09:27,806 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:09:27,806 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:09:27,807 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:09:28,728 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-04-13 04:09:28,728 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:09:28,762 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:09:28,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:09:28,765 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:09:28,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:09:28,768 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-13 04:09:28,779 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-13 04:09:28,779 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 04:09:28,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:09:28,784 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-04-13 04:09:30,076 INFO L134 CoverageAnalysis]: Checked inductivity of 5085 backedges. 0 proven. 5085 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:09:30,077 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:09:30,077 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-04-13 04:09:30,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-04-13 04:09:30,077 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-04-13 04:09:30,077 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3079, Unknown=0, NotChecked=0, Total=3192 [2018-04-13 04:09:30,077 INFO L87 Difference]: Start difference. First operand 245 states and 246 transitions. Second operand 57 states. [2018-04-13 04:09:34,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:09:34,107 INFO L93 Difference]: Finished difference Result 252 states and 253 transitions. [2018-04-13 04:09:34,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-04-13 04:09:34,107 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 244 [2018-04-13 04:09:34,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:09:34,108 INFO L225 Difference]: With dead ends: 252 [2018-04-13 04:09:34,108 INFO L226 Difference]: Without dead ends: 252 [2018-04-13 04:09:34,109 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1520 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=343, Invalid=11647, Unknown=0, NotChecked=0, Total=11990 [2018-04-13 04:09:34,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-04-13 04:09:34,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 250. [2018-04-13 04:09:34,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-04-13 04:09:34,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 251 transitions. [2018-04-13 04:09:34,111 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 251 transitions. Word has length 244 [2018-04-13 04:09:34,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:09:34,111 INFO L459 AbstractCegarLoop]: Abstraction has 250 states and 251 transitions. [2018-04-13 04:09:34,111 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-04-13 04:09:34,111 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 251 transitions. [2018-04-13 04:09:34,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-04-13 04:09:34,111 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:09:34,112 INFO L355 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:09:34,112 INFO L408 AbstractCegarLoop]: === Iteration 62 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:09:34,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1577394216, now seen corresponding path program 46 times [2018-04-13 04:09:34,112 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:09:34,112 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:09:34,112 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:09:34,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:09:34,112 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:09:34,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:09:34,154 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:09:34,168 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:09:34,169 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:09:34,169 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:09:34,169 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 04:09:34,649 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 04:09:34,649 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:09:34,688 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:09:34,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:09:34,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:09:34,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:09:34,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:09:34,699 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-13 04:09:34,699 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:09:34,710 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:09:34,711 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-13 04:09:34,711 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:09:34,716 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:09:34,717 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:09:34,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-13 04:09:34,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:09:34,720 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-13 04:09:34,720 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:09:36,212 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 5313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:09:36,212 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:09:36,212 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-04-13 04:09:36,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-04-13 04:09:36,212 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-04-13 04:09:36,212 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3191, Unknown=0, NotChecked=0, Total=3306 [2018-04-13 04:09:36,213 INFO L87 Difference]: Start difference. First operand 250 states and 251 transitions. Second operand 58 states. [2018-04-13 04:09:40,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:09:40,734 INFO L93 Difference]: Finished difference Result 257 states and 258 transitions. [2018-04-13 04:09:40,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-04-13 04:09:40,734 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 249 [2018-04-13 04:09:40,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:09:40,735 INFO L225 Difference]: With dead ends: 257 [2018-04-13 04:09:40,735 INFO L226 Difference]: Without dead ends: 257 [2018-04-13 04:09:40,736 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1577 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=349, Invalid=12083, Unknown=0, NotChecked=0, Total=12432 [2018-04-13 04:09:40,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-04-13 04:09:40,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 255. [2018-04-13 04:09:40,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-04-13 04:09:40,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 256 transitions. [2018-04-13 04:09:40,737 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 256 transitions. Word has length 249 [2018-04-13 04:09:40,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:09:40,737 INFO L459 AbstractCegarLoop]: Abstraction has 255 states and 256 transitions. [2018-04-13 04:09:40,737 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-04-13 04:09:40,737 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 256 transitions. [2018-04-13 04:09:40,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-04-13 04:09:40,738 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:09:40,738 INFO L355 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:09:40,738 INFO L408 AbstractCegarLoop]: === Iteration 63 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:09:40,738 INFO L82 PathProgramCache]: Analyzing trace with hash 2046775715, now seen corresponding path program 47 times [2018-04-13 04:09:40,738 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:09:40,738 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:09:40,739 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:09:40,739 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:09:40,739 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:09:40,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:09:40,783 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:09:40,797 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:09:40,797 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:09:40,797 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:09:40,797 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 04:09:48,804 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-04-13 04:09:48,804 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:09:48,868 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:09:48,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:09:48,872 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:09:48,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:09:48,876 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:09:48,879 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-13 04:09:48,879 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:09:48,889 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:09:48,890 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-13 04:09:48,890 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:09:48,899 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:09:48,900 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:09:48,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-13 04:09:48,900 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:09:48,906 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-13 04:09:48,906 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:28 [2018-04-13 04:09:49,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-04-13 04:09:49,090 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:09:49,094 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:09:49,094 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:18 [2018-04-13 04:09:50,542 INFO L134 CoverageAnalysis]: Checked inductivity of 5546 backedges. 0 proven. 5546 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:09:50,542 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:09:50,542 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-04-13 04:09:50,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-04-13 04:09:50,543 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-04-13 04:09:50,543 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=3192, Unknown=0, NotChecked=0, Total=3306 [2018-04-13 04:09:50,543 INFO L87 Difference]: Start difference. First operand 255 states and 256 transitions. Second operand 58 states. [2018-04-13 04:09:55,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:09:55,753 INFO L93 Difference]: Finished difference Result 262 states and 263 transitions. [2018-04-13 04:09:55,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-04-13 04:09:55,754 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 254 [2018-04-13 04:09:55,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:09:55,754 INFO L225 Difference]: With dead ends: 262 [2018-04-13 04:09:55,754 INFO L226 Difference]: Without dead ends: 262 [2018-04-13 04:09:55,755 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1410 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=341, Invalid=11869, Unknown=0, NotChecked=0, Total=12210 [2018-04-13 04:09:55,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-04-13 04:09:55,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2018-04-13 04:09:55,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-04-13 04:09:55,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 261 transitions. [2018-04-13 04:09:55,756 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 261 transitions. Word has length 254 [2018-04-13 04:09:55,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:09:55,756 INFO L459 AbstractCegarLoop]: Abstraction has 260 states and 261 transitions. [2018-04-13 04:09:55,756 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-04-13 04:09:55,757 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 261 transitions. [2018-04-13 04:09:55,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-04-13 04:09:55,757 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:09:55,757 INFO L355 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:09:55,757 INFO L408 AbstractCegarLoop]: === Iteration 64 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:09:55,757 INFO L82 PathProgramCache]: Analyzing trace with hash 966776072, now seen corresponding path program 48 times [2018-04-13 04:09:55,757 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:09:55,757 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:09:55,758 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:09:55,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:09:55,758 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:09:55,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:09:55,805 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:09:55,813 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:09:55,813 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:09:55,813 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:09:55,813 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 04:09:56,763 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-04-13 04:09:56,763 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:09:56,799 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:09:56,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-13 04:09:56,805 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:09:56,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:09:56,810 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:09:56,814 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-13 04:09:56,814 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:09:56,823 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:09:56,824 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:09:56,824 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-13 04:09:56,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:09:56,829 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:09:56,829 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:09:56,833 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-13 04:09:56,833 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-13 04:09:58,506 INFO L134 CoverageAnalysis]: Checked inductivity of 5784 backedges. 0 proven. 5784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:09:58,506 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:09:58,506 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-04-13 04:09:58,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-04-13 04:09:58,507 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-04-13 04:09:58,507 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=3306, Unknown=0, NotChecked=0, Total=3422 [2018-04-13 04:09:58,507 INFO L87 Difference]: Start difference. First operand 260 states and 261 transitions. Second operand 59 states. [2018-04-13 04:10:03,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:10:03,938 INFO L93 Difference]: Finished difference Result 267 states and 268 transitions. [2018-04-13 04:10:03,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-04-13 04:10:03,938 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 259 [2018-04-13 04:10:03,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:10:03,939 INFO L225 Difference]: With dead ends: 267 [2018-04-13 04:10:03,939 INFO L226 Difference]: Without dead ends: 267 [2018-04-13 04:10:03,940 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1532 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=352, Invalid=12530, Unknown=0, NotChecked=0, Total=12882 [2018-04-13 04:10:03,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-04-13 04:10:03,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 265. [2018-04-13 04:10:03,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-04-13 04:10:03,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 266 transitions. [2018-04-13 04:10:03,942 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 266 transitions. Word has length 259 [2018-04-13 04:10:03,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:10:03,942 INFO L459 AbstractCegarLoop]: Abstraction has 265 states and 266 transitions. [2018-04-13 04:10:03,942 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-04-13 04:10:03,942 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 266 transitions. [2018-04-13 04:10:03,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-04-13 04:10:03,942 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:10:03,942 INFO L355 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:10:03,943 INFO L408 AbstractCegarLoop]: === Iteration 65 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:10:03,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1966254275, now seen corresponding path program 49 times [2018-04-13 04:10:03,943 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:10:03,943 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:10:03,943 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:10:03,943 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:10:03,943 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:10:03,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:10:03,990 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:10:04,003 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:10:04,003 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:10:04,003 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:10:04,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:10:04,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:10:04,428 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:10:04,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:10:04,433 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:10:04,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, 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-13 04:10:04,438 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:10:04,442 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-13 04:10:04,442 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:10:04,451 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:10:04,451 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:10:04,452 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-13 04:10:04,452 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:10:04,456 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-13 04:10:04,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:10:04,459 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-13 04:10:04,459 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:10:06,158 INFO L134 CoverageAnalysis]: Checked inductivity of 6027 backedges. 0 proven. 6027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:10:06,158 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:10:06,158 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-04-13 04:10:06,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-04-13 04:10:06,159 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-04-13 04:10:06,159 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3539, Unknown=0, NotChecked=0, Total=3660 [2018-04-13 04:10:06,159 INFO L87 Difference]: Start difference. First operand 265 states and 266 transitions. Second operand 61 states. [2018-04-13 04:10:11,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:10:11,490 INFO L93 Difference]: Finished difference Result 272 states and 273 transitions. [2018-04-13 04:10:11,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-04-13 04:10:11,490 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 264 [2018-04-13 04:10:11,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:10:11,491 INFO L225 Difference]: With dead ends: 272 [2018-04-13 04:10:11,491 INFO L226 Difference]: Without dead ends: 272 [2018-04-13 04:10:11,491 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1750 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=367, Invalid=13439, Unknown=0, NotChecked=0, Total=13806 [2018-04-13 04:10:11,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-04-13 04:10:11,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 270. [2018-04-13 04:10:11,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-04-13 04:10:11,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 271 transitions. [2018-04-13 04:10:11,493 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 271 transitions. Word has length 264 [2018-04-13 04:10:11,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:10:11,493 INFO L459 AbstractCegarLoop]: Abstraction has 270 states and 271 transitions. [2018-04-13 04:10:11,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-04-13 04:10:11,493 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 271 transitions. [2018-04-13 04:10:11,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-04-13 04:10:11,494 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:10:11,494 INFO L355 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:10:11,494 INFO L408 AbstractCegarLoop]: === Iteration 66 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:10:11,494 INFO L82 PathProgramCache]: Analyzing trace with hash -226102808, now seen corresponding path program 50 times [2018-04-13 04:10:11,494 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:10:11,495 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:10:11,495 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:10:11,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:10:11,495 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:10:11,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:10:11,566 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:10:11,580 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:10:11,580 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:10:11,580 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:10:11,580 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:10:13,552 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:10:13,552 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:10:13,595 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:10:13,598 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:10:13,599 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:10:13,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-13 04:10:13,602 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:10:13,606 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-13 04:10:13,606 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:10:13,620 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:10:13,621 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-13 04:10:13,621 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:10:13,628 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:10:13,628 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:10:13,628 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-13 04:10:13,629 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:10:13,634 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-13 04:10:13,634 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-13 04:10:15,393 INFO L134 CoverageAnalysis]: Checked inductivity of 6275 backedges. 0 proven. 6275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:10:15,393 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:10:15,393 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-04-13 04:10:15,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-04-13 04:10:15,394 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-04-13 04:10:15,394 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=3540, Unknown=0, NotChecked=0, Total=3660 [2018-04-13 04:10:15,394 INFO L87 Difference]: Start difference. First operand 270 states and 271 transitions. Second operand 61 states. [2018-04-13 04:10:20,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:10:20,904 INFO L93 Difference]: Finished difference Result 277 states and 278 transitions. [2018-04-13 04:10:20,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-04-13 04:10:20,904 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 269 [2018-04-13 04:10:20,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:10:20,905 INFO L225 Difference]: With dead ends: 277 [2018-04-13 04:10:20,905 INFO L226 Difference]: Without dead ends: 277 [2018-04-13 04:10:20,905 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1646 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=364, Invalid=13442, Unknown=0, NotChecked=0, Total=13806 [2018-04-13 04:10:20,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-04-13 04:10:20,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 275. [2018-04-13 04:10:20,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-04-13 04:10:20,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 276 transitions. [2018-04-13 04:10:20,907 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 276 transitions. Word has length 269 [2018-04-13 04:10:20,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:10:20,907 INFO L459 AbstractCegarLoop]: Abstraction has 275 states and 276 transitions. [2018-04-13 04:10:20,907 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-04-13 04:10:20,907 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 276 transitions. [2018-04-13 04:10:20,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-04-13 04:10:20,907 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:10:20,908 INFO L355 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:10:20,908 INFO L408 AbstractCegarLoop]: === Iteration 67 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:10:20,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1577347101, now seen corresponding path program 51 times [2018-04-13 04:10:20,908 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:10:20,908 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:10:20,908 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:10:20,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:10:20,908 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:10:20,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:10:20,959 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:10:20,980 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:10:20,980 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:10:20,980 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:10:20,980 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:10:21,988 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-04-13 04:10:21,988 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:10:22,033 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:10:22,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:10:22,036 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:10:22,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:10:22,039 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-13 04:10:22,050 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-13 04:10:22,050 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 04:10:22,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:10:22,063 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-04-13 04:10:23,625 INFO L134 CoverageAnalysis]: Checked inductivity of 6528 backedges. 0 proven. 6528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:10:23,625 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:10:23,626 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-04-13 04:10:23,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-04-13 04:10:23,626 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-04-13 04:10:23,626 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3781, Unknown=0, NotChecked=0, Total=3906 [2018-04-13 04:10:23,626 INFO L87 Difference]: Start difference. First operand 275 states and 276 transitions. Second operand 63 states. [2018-04-13 04:10:28,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:10:28,507 INFO L93 Difference]: Finished difference Result 282 states and 283 transitions. [2018-04-13 04:10:28,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-04-13 04:10:28,507 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 274 [2018-04-13 04:10:28,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:10:28,508 INFO L225 Difference]: With dead ends: 282 [2018-04-13 04:10:28,508 INFO L226 Difference]: Without dead ends: 282 [2018-04-13 04:10:28,508 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1871 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=379, Invalid=14383, Unknown=0, NotChecked=0, Total=14762 [2018-04-13 04:10:28,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-04-13 04:10:28,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 280. [2018-04-13 04:10:28,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-04-13 04:10:28,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 281 transitions. [2018-04-13 04:10:28,509 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 281 transitions. Word has length 274 [2018-04-13 04:10:28,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:10:28,510 INFO L459 AbstractCegarLoop]: Abstraction has 280 states and 281 transitions. [2018-04-13 04:10:28,510 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-04-13 04:10:28,510 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 281 transitions. [2018-04-13 04:10:28,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-04-13 04:10:28,510 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:10:28,510 INFO L355 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:10:28,510 INFO L408 AbstractCegarLoop]: === Iteration 68 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:10:28,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1886030136, now seen corresponding path program 52 times [2018-04-13 04:10:28,511 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:10:28,511 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:10:28,511 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:10:28,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:10:28,511 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:10:28,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:10:28,560 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:10:28,573 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:10:28,574 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:10:28,574 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:10:28,574 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 04:10:28,961 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 04:10:28,961 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:10:29,004 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:10:29,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:10:29,007 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:10:29,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:10:29,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:10:29,014 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-13 04:10:29,014 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:10:29,023 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:10:29,024 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-13 04:10:29,024 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:10:29,030 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:10:29,030 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:10:29,030 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-13 04:10:29,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:10:29,035 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-13 04:10:29,035 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:10:30,849 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:10:30,850 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:10:30,850 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-04-13 04:10:30,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-04-13 04:10:30,850 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-04-13 04:10:30,850 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=3905, Unknown=0, NotChecked=0, Total=4032 [2018-04-13 04:10:30,850 INFO L87 Difference]: Start difference. First operand 280 states and 281 transitions. Second operand 64 states. [2018-04-13 04:10:36,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:10:36,359 INFO L93 Difference]: Finished difference Result 287 states and 288 transitions. [2018-04-13 04:10:36,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-04-13 04:10:36,359 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 279 [2018-04-13 04:10:36,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:10:36,360 INFO L225 Difference]: With dead ends: 287 [2018-04-13 04:10:36,360 INFO L226 Difference]: Without dead ends: 287 [2018-04-13 04:10:36,361 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1936 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=385, Invalid=14867, Unknown=0, NotChecked=0, Total=15252 [2018-04-13 04:10:36,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-04-13 04:10:36,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 285. [2018-04-13 04:10:36,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-04-13 04:10:36,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 286 transitions. [2018-04-13 04:10:36,363 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 286 transitions. Word has length 279 [2018-04-13 04:10:36,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:10:36,363 INFO L459 AbstractCegarLoop]: Abstraction has 285 states and 286 transitions. [2018-04-13 04:10:36,363 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-04-13 04:10:36,363 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 286 transitions. [2018-04-13 04:10:36,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-04-13 04:10:36,364 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:10:36,364 INFO L355 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:10:36,364 INFO L408 AbstractCegarLoop]: === Iteration 69 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:10:36,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1807999229, now seen corresponding path program 53 times [2018-04-13 04:10:36,364 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:10:36,365 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:10:36,365 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:10:36,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:10:36,365 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:10:36,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:10:36,418 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:10:36,426 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:10:36,426 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:10:36,426 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:10:36,427 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 04:10:37,663 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-04-13 04:10:37,663 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:10:37,697 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:10:37,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:10:37,700 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:10:37,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:10:37,704 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:10:37,707 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-13 04:10:37,707 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:10:37,719 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:10:37,721 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-13 04:10:37,721 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:10:37,730 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:10:37,731 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:10:37,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-13 04:10:37,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:10:37,740 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-13 04:10:37,740 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:28 [2018-04-13 04:10:38,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:10:38,058 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:10:38,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:10:38,062 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:21 [2018-04-13 04:10:39,943 INFO L134 CoverageAnalysis]: Checked inductivity of 7049 backedges. 0 proven. 7049 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:10:39,943 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:10:39,943 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-04-13 04:10:39,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-04-13 04:10:39,943 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-04-13 04:10:39,943 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4031, Unknown=0, NotChecked=0, Total=4160 [2018-04-13 04:10:39,944 INFO L87 Difference]: Start difference. First operand 285 states and 286 transitions. Second operand 65 states. [2018-04-13 04:10:46,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:10:46,491 INFO L93 Difference]: Finished difference Result 292 states and 293 transitions. [2018-04-13 04:10:46,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-04-13 04:10:46,491 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 284 [2018-04-13 04:10:46,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:10:46,492 INFO L225 Difference]: With dead ends: 292 [2018-04-13 04:10:46,492 INFO L226 Difference]: Without dead ends: 292 [2018-04-13 04:10:46,493 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1915 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=386, Invalid=15114, Unknown=0, NotChecked=0, Total=15500 [2018-04-13 04:10:46,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-04-13 04:10:46,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 290. [2018-04-13 04:10:46,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-04-13 04:10:46,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 291 transitions. [2018-04-13 04:10:46,494 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 291 transitions. Word has length 284 [2018-04-13 04:10:46,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:10:46,494 INFO L459 AbstractCegarLoop]: Abstraction has 290 states and 291 transitions. [2018-04-13 04:10:46,494 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-04-13 04:10:46,494 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 291 transitions. [2018-04-13 04:10:46,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-04-13 04:10:46,495 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:10:46,495 INFO L355 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:10:46,495 INFO L408 AbstractCegarLoop]: === Iteration 70 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:10:46,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1708366936, now seen corresponding path program 54 times [2018-04-13 04:10:46,495 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:10:46,495 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:10:46,496 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:10:46,496 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:10:46,496 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:10:46,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:10:46,554 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:10:46,572 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:10:46,572 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:10:46,572 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:10:46,572 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 04:10:49,309 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-04-13 04:10:49,309 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:10:49,345 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:10:49,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:10:49,348 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:10:49,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:10:49,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:10:49,355 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-13 04:10:49,355 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:10:49,365 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:10:49,365 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:10:49,365 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-13 04:10:49,365 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:10:49,371 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-13 04:10:49,371 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:10:49,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-13 04:10:49,375 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-13 04:10:51,288 INFO L134 CoverageAnalysis]: Checked inductivity of 7317 backedges. 0 proven. 7317 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:10:51,288 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:10:51,288 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-04-13 04:10:51,289 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-04-13 04:10:51,289 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-04-13 04:10:51,289 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=4032, Unknown=0, NotChecked=0, Total=4160 [2018-04-13 04:10:51,289 INFO L87 Difference]: Start difference. First operand 290 states and 291 transitions. Second operand 65 states. [2018-04-13 04:10:57,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:10:57,475 INFO L93 Difference]: Finished difference Result 297 states and 298 transitions. [2018-04-13 04:10:57,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-04-13 04:10:57,475 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 289 [2018-04-13 04:10:57,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:10:57,476 INFO L225 Difference]: With dead ends: 297 [2018-04-13 04:10:57,476 INFO L226 Difference]: Without dead ends: 297 [2018-04-13 04:10:57,477 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1883 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=388, Invalid=15362, Unknown=0, NotChecked=0, Total=15750 [2018-04-13 04:10:57,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-04-13 04:10:57,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 295. [2018-04-13 04:10:57,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-04-13 04:10:57,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 296 transitions. [2018-04-13 04:10:57,478 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 296 transitions. Word has length 289 [2018-04-13 04:10:57,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:10:57,478 INFO L459 AbstractCegarLoop]: Abstraction has 295 states and 296 transitions. [2018-04-13 04:10:57,478 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-04-13 04:10:57,478 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 296 transitions. [2018-04-13 04:10:57,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-04-13 04:10:57,479 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:10:57,479 INFO L355 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:10:57,479 INFO L408 AbstractCegarLoop]: === Iteration 71 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:10:57,479 INFO L82 PathProgramCache]: Analyzing trace with hash -313115101, now seen corresponding path program 55 times [2018-04-13 04:10:57,479 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:10:57,479 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:10:57,480 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:10:57,480 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:10:57,480 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:10:57,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:10:57,542 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:10:57,556 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:10:57,556 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:10:57,556 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:10:57,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:10:58,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:10:58,073 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:10:58,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:10:58,077 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:10:58,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:10:58,080 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:10:58,084 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-13 04:10:58,084 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:10:58,101 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:10:58,102 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-13 04:10:58,102 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:10:58,108 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:10:58,109 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:10:58,109 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-13 04:10:58,109 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:10:58,112 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-13 04:10:58,112 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:11:00,104 INFO L134 CoverageAnalysis]: Checked inductivity of 7590 backedges. 0 proven. 7590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:11:00,105 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:11:00,105 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-04-13 04:11:00,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-04-13 04:11:00,105 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-04-13 04:11:00,105 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4289, Unknown=0, NotChecked=0, Total=4422 [2018-04-13 04:11:00,105 INFO L87 Difference]: Start difference. First operand 295 states and 296 transitions. Second operand 67 states. [2018-04-13 04:11:06,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:11:06,666 INFO L93 Difference]: Finished difference Result 302 states and 303 transitions. [2018-04-13 04:11:06,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-04-13 04:11:06,666 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 294 [2018-04-13 04:11:06,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:11:06,666 INFO L225 Difference]: With dead ends: 302 [2018-04-13 04:11:06,667 INFO L226 Difference]: Without dead ends: 302 [2018-04-13 04:11:06,667 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2125 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=403, Invalid=16367, Unknown=0, NotChecked=0, Total=16770 [2018-04-13 04:11:06,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-04-13 04:11:06,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 300. [2018-04-13 04:11:06,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-04-13 04:11:06,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 301 transitions. [2018-04-13 04:11:06,669 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 301 transitions. Word has length 294 [2018-04-13 04:11:06,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:11:06,669 INFO L459 AbstractCegarLoop]: Abstraction has 300 states and 301 transitions. [2018-04-13 04:11:06,669 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-04-13 04:11:06,669 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 301 transitions. [2018-04-13 04:11:06,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-04-13 04:11:06,670 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:11:06,670 INFO L355 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:11:06,670 INFO L408 AbstractCegarLoop]: === Iteration 72 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:11:06,670 INFO L82 PathProgramCache]: Analyzing trace with hash -30885752, now seen corresponding path program 56 times [2018-04-13 04:11:06,670 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:11:06,670 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:11:06,670 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:11:06,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:11:06,671 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:11:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:11:06,737 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:11:06,749 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:11:06,749 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:11:06,749 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:11:06,749 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:11:07,784 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:11:07,784 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:11:07,836 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:11:07,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:11:07,839 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:11:07,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:11:07,842 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-13 04:11:07,852 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-13 04:11:07,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 04:11:07,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:11:07,857 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-04-13 04:11:09,810 INFO L134 CoverageAnalysis]: Checked inductivity of 7868 backedges. 0 proven. 7868 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:11:09,810 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:11:09,810 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-04-13 04:11:09,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-04-13 04:11:09,811 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-04-13 04:11:09,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4421, Unknown=0, NotChecked=0, Total=4556 [2018-04-13 04:11:09,811 INFO L87 Difference]: Start difference. First operand 300 states and 301 transitions. Second operand 68 states. [2018-04-13 04:11:15,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:11:15,660 INFO L93 Difference]: Finished difference Result 307 states and 308 transitions. [2018-04-13 04:11:15,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-04-13 04:11:15,660 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 299 [2018-04-13 04:11:15,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:11:15,661 INFO L225 Difference]: With dead ends: 307 [2018-04-13 04:11:15,661 INFO L226 Difference]: Without dead ends: 307 [2018-04-13 04:11:15,662 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2198 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=409, Invalid=16883, Unknown=0, NotChecked=0, Total=17292 [2018-04-13 04:11:15,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-04-13 04:11:15,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 305. [2018-04-13 04:11:15,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-04-13 04:11:15,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 306 transitions. [2018-04-13 04:11:15,663 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 306 transitions. Word has length 299 [2018-04-13 04:11:15,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:11:15,663 INFO L459 AbstractCegarLoop]: Abstraction has 305 states and 306 transitions. [2018-04-13 04:11:15,663 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-04-13 04:11:15,664 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 306 transitions. [2018-04-13 04:11:15,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-04-13 04:11:15,664 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:11:15,664 INFO L355 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:11:15,664 INFO L408 AbstractCegarLoop]: === Iteration 73 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:11:15,664 INFO L82 PathProgramCache]: Analyzing trace with hash 2083255619, now seen corresponding path program 57 times [2018-04-13 04:11:15,664 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:11:15,665 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:11:15,665 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:11:15,665 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:11:15,665 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:11:15,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:11:15,731 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:11:15,739 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:11:15,739 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:11:15,740 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:11:15,740 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:11:17,107 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-04-13 04:11:17,107 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:11:17,177 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:11:17,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-13 04:11:17,180 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:11:17,182 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:11:17,183 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-13 04:11:17,194 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-13 04:11:17,194 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 04:11:17,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:11:17,199 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2018-04-13 04:11:19,164 INFO L134 CoverageAnalysis]: Checked inductivity of 8151 backedges. 0 proven. 8151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:11:19,164 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:11:19,164 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-04-13 04:11:19,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-04-13 04:11:19,164 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-04-13 04:11:19,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=4554, Unknown=0, NotChecked=0, Total=4692 [2018-04-13 04:11:19,165 INFO L87 Difference]: Start difference. First operand 305 states and 306 transitions. Second operand 69 states. [2018-04-13 04:11:25,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:11:25,087 INFO L93 Difference]: Finished difference Result 312 states and 313 transitions. [2018-04-13 04:11:25,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-04-13 04:11:25,087 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 304 [2018-04-13 04:11:25,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:11:25,088 INFO L225 Difference]: With dead ends: 312 [2018-04-13 04:11:25,088 INFO L226 Difference]: Without dead ends: 312 [2018-04-13 04:11:25,089 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2379 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=422, Invalid=17400, Unknown=0, NotChecked=0, Total=17822 [2018-04-13 04:11:25,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-04-13 04:11:25,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 310. [2018-04-13 04:11:25,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-04-13 04:11:25,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 311 transitions. [2018-04-13 04:11:25,091 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 311 transitions. Word has length 304 [2018-04-13 04:11:25,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:11:25,091 INFO L459 AbstractCegarLoop]: Abstraction has 310 states and 311 transitions. [2018-04-13 04:11:25,091 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-04-13 04:11:25,091 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 311 transitions. [2018-04-13 04:11:25,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-04-13 04:11:25,092 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:11:25,092 INFO L355 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:11:25,092 INFO L408 AbstractCegarLoop]: === Iteration 74 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:11:25,092 INFO L82 PathProgramCache]: Analyzing trace with hash -370641560, now seen corresponding path program 58 times [2018-04-13 04:11:25,092 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:11:25,092 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:11:25,092 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:11:25,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:11:25,092 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:11:25,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:11:25,158 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:11:25,168 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:11:25,168 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:11:25,169 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:11:25,169 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 04:11:25,716 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 04:11:25,716 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:11:25,775 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:11:25,778 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:11:25,778 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:11:25,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-13 04:11:25,782 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:11:25,785 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-13 04:11:25,785 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:11:25,801 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:11:25,802 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-13 04:11:25,802 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:11:25,808 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:11:25,809 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:11:25,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:11:25,809 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:11:25,817 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-13 04:11:25,818 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:11:28,164 INFO L134 CoverageAnalysis]: Checked inductivity of 8439 backedges. 0 proven. 8439 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:11:28,165 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:11:28,165 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-04-13 04:11:28,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-04-13 04:11:28,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-04-13 04:11:28,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4691, Unknown=0, NotChecked=0, Total=4830 [2018-04-13 04:11:28,165 INFO L87 Difference]: Start difference. First operand 310 states and 311 transitions. Second operand 70 states. [2018-04-13 04:11:35,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:11:35,285 INFO L93 Difference]: Finished difference Result 317 states and 318 transitions. [2018-04-13 04:11:35,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-04-13 04:11:35,286 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 309 [2018-04-13 04:11:35,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:11:35,286 INFO L225 Difference]: With dead ends: 317 [2018-04-13 04:11:35,286 INFO L226 Difference]: Without dead ends: 317 [2018-04-13 04:11:35,287 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2327 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=421, Invalid=17939, Unknown=0, NotChecked=0, Total=18360 [2018-04-13 04:11:35,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-04-13 04:11:35,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 315. [2018-04-13 04:11:35,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-04-13 04:11:35,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 316 transitions. [2018-04-13 04:11:35,289 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 316 transitions. Word has length 309 [2018-04-13 04:11:35,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:11:35,289 INFO L459 AbstractCegarLoop]: Abstraction has 315 states and 316 transitions. [2018-04-13 04:11:35,289 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-04-13 04:11:35,289 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 316 transitions. [2018-04-13 04:11:35,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-04-13 04:11:35,290 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:11:35,290 INFO L355 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:11:35,290 INFO L408 AbstractCegarLoop]: === Iteration 75 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:11:35,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1562330211, now seen corresponding path program 59 times [2018-04-13 04:11:35,290 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:11:35,290 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:11:35,290 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:11:35,290 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:11:35,290 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:11:35,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:11:35,357 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:11:35,370 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:11:35,370 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:11:35,370 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:11:35,370 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 04:11:37,059 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 60 check-sat command(s) [2018-04-13 04:11:37,059 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:11:37,122 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:11:37,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:11:37,125 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:11:37,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:11:37,128 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-13 04:11:37,140 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-13 04:11:37,140 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 04:11:37,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:11:37,145 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-04-13 04:11:39,099 INFO L134 CoverageAnalysis]: Checked inductivity of 8732 backedges. 0 proven. 8732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:11:39,099 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:11:39,099 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-04-13 04:11:39,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-04-13 04:11:39,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-04-13 04:11:39,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=4692, Unknown=0, NotChecked=0, Total=4830 [2018-04-13 04:11:39,100 INFO L87 Difference]: Start difference. First operand 315 states and 316 transitions. Second operand 70 states. [2018-04-13 04:11:44,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:11:44,987 INFO L93 Difference]: Finished difference Result 322 states and 323 transitions. [2018-04-13 04:11:44,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-04-13 04:11:44,987 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 314 [2018-04-13 04:11:44,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:11:44,988 INFO L225 Difference]: With dead ends: 322 [2018-04-13 04:11:44,988 INFO L226 Difference]: Without dead ends: 322 [2018-04-13 04:11:44,989 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2261 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=418, Invalid=17942, Unknown=0, NotChecked=0, Total=18360 [2018-04-13 04:11:44,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-04-13 04:11:44,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 320. [2018-04-13 04:11:44,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-04-13 04:11:44,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 321 transitions. [2018-04-13 04:11:44,990 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 321 transitions. Word has length 314 [2018-04-13 04:11:44,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:11:44,991 INFO L459 AbstractCegarLoop]: Abstraction has 320 states and 321 transitions. [2018-04-13 04:11:44,991 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-04-13 04:11:44,991 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 321 transitions. [2018-04-13 04:11:44,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-04-13 04:11:44,991 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:11:44,991 INFO L355 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:11:44,991 INFO L408 AbstractCegarLoop]: === Iteration 76 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:11:44,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1370908088, now seen corresponding path program 60 times [2018-04-13 04:11:44,992 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:11:44,992 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:11:44,992 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:11:44,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:11:44,992 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:11:45,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:11:45,062 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:11:45,080 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:11:45,080 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:11:45,080 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:11:45,080 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 04:11:47,186 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 61 check-sat command(s) [2018-04-13 04:11:47,186 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:11:47,288 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:11:47,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:11:47,292 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:11:47,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:11:47,294 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-13 04:11:47,306 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-13 04:11:47,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 04:11:47,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:11:47,312 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-13 04:11:49,407 INFO L134 CoverageAnalysis]: Checked inductivity of 9030 backedges. 0 proven. 9030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:11:49,407 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:11:49,407 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-04-13 04:11:49,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-04-13 04:11:49,407 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-04-13 04:11:49,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=4830, Unknown=0, NotChecked=0, Total=4970 [2018-04-13 04:11:49,408 INFO L87 Difference]: Start difference. First operand 320 states and 321 transitions. Second operand 71 states. [2018-04-13 04:11:56,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:11:56,026 INFO L93 Difference]: Finished difference Result 327 states and 328 transitions. [2018-04-13 04:11:56,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-04-13 04:11:56,027 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 319 [2018-04-13 04:11:56,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:11:56,027 INFO L225 Difference]: With dead ends: 327 [2018-04-13 04:11:56,027 INFO L226 Difference]: Without dead ends: 327 [2018-04-13 04:11:56,028 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2270 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=424, Invalid=18482, Unknown=0, NotChecked=0, Total=18906 [2018-04-13 04:11:56,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-04-13 04:11:56,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 325. [2018-04-13 04:11:56,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-04-13 04:11:56,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 326 transitions. [2018-04-13 04:11:56,030 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 326 transitions. Word has length 319 [2018-04-13 04:11:56,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:11:56,030 INFO L459 AbstractCegarLoop]: Abstraction has 325 states and 326 transitions. [2018-04-13 04:11:56,030 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-04-13 04:11:56,030 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 326 transitions. [2018-04-13 04:11:56,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-04-13 04:11:56,031 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:11:56,031 INFO L355 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:11:56,031 INFO L408 AbstractCegarLoop]: === Iteration 77 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:11:56,031 INFO L82 PathProgramCache]: Analyzing trace with hash 437398403, now seen corresponding path program 61 times [2018-04-13 04:11:56,031 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:11:56,031 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:11:56,031 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:11:56,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:11:56,031 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:11:56,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:11:56,099 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:11:56,109 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:11:56,109 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:11:56,109 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:11:56,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:11:56,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:11:56,772 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:11:56,775 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:11:56,775 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:11:56,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:11:56,780 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:11:56,787 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-13 04:11:56,787 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:11:56,796 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:11:56,797 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-13 04:11:56,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:11:56,802 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:11:56,802 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:11:56,803 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-13 04:11:56,803 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:11:56,806 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-13 04:11:56,806 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:11:59,179 INFO L134 CoverageAnalysis]: Checked inductivity of 9333 backedges. 0 proven. 9333 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:11:59,179 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:11:59,179 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-04-13 04:11:59,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-04-13 04:11:59,180 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-04-13 04:11:59,180 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5111, Unknown=0, NotChecked=0, Total=5256 [2018-04-13 04:11:59,180 INFO L87 Difference]: Start difference. First operand 325 states and 326 transitions. Second operand 73 states. [2018-04-13 04:12:06,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:12:06,900 INFO L93 Difference]: Finished difference Result 332 states and 333 transitions. [2018-04-13 04:12:06,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-04-13 04:12:06,900 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 324 [2018-04-13 04:12:06,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:12:06,901 INFO L225 Difference]: With dead ends: 332 [2018-04-13 04:12:06,901 INFO L226 Difference]: Without dead ends: 332 [2018-04-13 04:12:06,902 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2536 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=439, Invalid=19583, Unknown=0, NotChecked=0, Total=20022 [2018-04-13 04:12:06,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-04-13 04:12:06,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 330. [2018-04-13 04:12:06,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-04-13 04:12:06,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 331 transitions. [2018-04-13 04:12:06,904 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 331 transitions. Word has length 324 [2018-04-13 04:12:06,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:12:06,904 INFO L459 AbstractCegarLoop]: Abstraction has 330 states and 331 transitions. [2018-04-13 04:12:06,904 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-04-13 04:12:06,904 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 331 transitions. [2018-04-13 04:12:06,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2018-04-13 04:12:06,904 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:12:06,905 INFO L355 BasicCegarLoop]: trace histogram [63, 63, 62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:12:06,905 INFO L408 AbstractCegarLoop]: === Iteration 78 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:12:06,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1633016024, now seen corresponding path program 62 times [2018-04-13 04:12:06,905 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:12:06,905 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:12:06,905 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:12:06,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:12:06,905 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:12:06,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:12:06,980 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:12:06,996 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:12:06,997 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:12:06,997 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:12:06,997 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:12:10,079 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:12:10,079 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:12:10,220 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:12:10,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:12:10,225 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:12:10,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:12:10,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:12:10,237 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-13 04:12:10,238 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:12:10,251 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:12:10,252 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-13 04:12:10,252 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:12:10,259 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:12:10,259 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:12:10,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-13 04:12:10,260 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:12:10,264 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-13 04:12:10,264 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-13 04:12:12,802 INFO L134 CoverageAnalysis]: Checked inductivity of 9641 backedges. 0 proven. 9641 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:12:12,802 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:12:12,802 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-04-13 04:12:12,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-04-13 04:12:12,803 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-04-13 04:12:12,803 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=5112, Unknown=0, NotChecked=0, Total=5256 [2018-04-13 04:12:12,803 INFO L87 Difference]: Start difference. First operand 330 states and 331 transitions. Second operand 73 states. [2018-04-13 04:12:20,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:12:20,742 INFO L93 Difference]: Finished difference Result 337 states and 338 transitions. [2018-04-13 04:12:20,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-04-13 04:12:20,742 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 329 [2018-04-13 04:12:20,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:12:20,742 INFO L225 Difference]: With dead ends: 337 [2018-04-13 04:12:20,743 INFO L226 Difference]: Without dead ends: 337 [2018-04-13 04:12:20,743 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2408 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=436, Invalid=19586, Unknown=0, NotChecked=0, Total=20022 [2018-04-13 04:12:20,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-04-13 04:12:20,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2018-04-13 04:12:20,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-04-13 04:12:20,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 336 transitions. [2018-04-13 04:12:20,745 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 336 transitions. Word has length 329 [2018-04-13 04:12:20,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:12:20,745 INFO L459 AbstractCegarLoop]: Abstraction has 335 states and 336 transitions. [2018-04-13 04:12:20,745 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-04-13 04:12:20,745 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 336 transitions. [2018-04-13 04:12:20,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-04-13 04:12:20,746 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:12:20,746 INFO L355 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:12:20,746 INFO L408 AbstractCegarLoop]: === Iteration 79 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:12:20,746 INFO L82 PathProgramCache]: Analyzing trace with hash -899241309, now seen corresponding path program 63 times [2018-04-13 04:12:20,746 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:12:20,746 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:12:20,746 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:12:20,747 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:12:20,747 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:12:20,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:12:20,822 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:12:20,836 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:12:20,836 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:12:20,836 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:12:20,836 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:12:23,969 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2018-04-13 04:12:23,969 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:12:24,064 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:12:24,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 6 treesize of output 5 [2018-04-13 04:12:24,072 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:12:24,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:12:24,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:12:24,079 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-13 04:12:24,080 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:12:24,090 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:12:24,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:12:24,091 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:12:24,097 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:12:24,098 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:12:24,098 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-13 04:12:24,098 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:12:24,102 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-13 04:12:24,102 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-13 04:12:26,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 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-13 04:12:26,185 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:12:26,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:12:26,188 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:18 [2018-04-13 04:12:26,662 INFO L134 CoverageAnalysis]: Checked inductivity of 9954 backedges. 0 proven. 9954 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:12:26,662 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:12:26,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-04-13 04:12:26,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-04-13 04:12:26,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-04-13 04:12:26,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=5256, Unknown=0, NotChecked=0, Total=5402 [2018-04-13 04:12:26,663 INFO L87 Difference]: Start difference. First operand 335 states and 336 transitions. Second operand 74 states. [2018-04-13 04:12:34,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:12:34,162 INFO L93 Difference]: Finished difference Result 342 states and 343 transitions. [2018-04-13 04:12:34,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-04-13 04:12:34,162 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 334 [2018-04-13 04:12:34,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:12:34,163 INFO L225 Difference]: With dead ends: 342 [2018-04-13 04:12:34,163 INFO L226 Difference]: Without dead ends: 342 [2018-04-13 04:12:34,164 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2477 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=442, Invalid=20150, Unknown=0, NotChecked=0, Total=20592 [2018-04-13 04:12:34,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-04-13 04:12:34,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 340. [2018-04-13 04:12:34,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-04-13 04:12:34,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 341 transitions. [2018-04-13 04:12:34,165 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 341 transitions. Word has length 334 [2018-04-13 04:12:34,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:12:34,165 INFO L459 AbstractCegarLoop]: Abstraction has 340 states and 341 transitions. [2018-04-13 04:12:34,165 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-04-13 04:12:34,165 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 341 transitions. [2018-04-13 04:12:34,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-04-13 04:12:34,166 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:12:34,166 INFO L355 BasicCegarLoop]: trace histogram [65, 65, 64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:12:34,166 INFO L408 AbstractCegarLoop]: === Iteration 80 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:12:34,166 INFO L82 PathProgramCache]: Analyzing trace with hash -253223928, now seen corresponding path program 64 times [2018-04-13 04:12:34,167 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:12:34,167 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:12:34,167 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:12:34,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:12:34,167 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:12:34,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:12:34,246 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:12:34,259 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:12:34,259 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:12:34,259 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:12:34,259 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 04:12:34,945 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 04:12:34,945 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:12:35,018 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:12:35,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 6 treesize of output 5 [2018-04-13 04:12:35,021 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:12:35,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:12:35,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:12:35,028 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-13 04:12:35,028 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:12:35,037 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:12:35,038 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-13 04:12:35,038 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:12:35,043 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:12:35,043 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:12:35,044 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-13 04:12:35,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:12:35,047 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-13 04:12:35,047 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:12:37,950 INFO L134 CoverageAnalysis]: Checked inductivity of 10272 backedges. 0 proven. 10272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:12:37,951 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:12:37,951 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-04-13 04:12:37,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-04-13 04:12:37,951 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-04-13 04:12:37,951 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=5548, Unknown=0, NotChecked=0, Total=5700 [2018-04-13 04:12:37,952 INFO L87 Difference]: Start difference. First operand 340 states and 341 transitions. Second operand 76 states. [2018-04-13 04:12:46,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:12:46,360 INFO L93 Difference]: Finished difference Result 347 states and 348 transitions. [2018-04-13 04:12:46,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-04-13 04:12:46,361 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 339 [2018-04-13 04:12:46,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:12:46,361 INFO L225 Difference]: With dead ends: 347 [2018-04-13 04:12:46,362 INFO L226 Difference]: Without dead ends: 347 [2018-04-13 04:12:46,362 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2815 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=460, Invalid=21296, Unknown=0, NotChecked=0, Total=21756 [2018-04-13 04:12:46,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-04-13 04:12:46,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 345. [2018-04-13 04:12:46,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-04-13 04:12:46,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 346 transitions. [2018-04-13 04:12:46,364 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 346 transitions. Word has length 339 [2018-04-13 04:12:46,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:12:46,364 INFO L459 AbstractCegarLoop]: Abstraction has 345 states and 346 transitions. [2018-04-13 04:12:46,364 INFO L460 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-04-13 04:12:46,364 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 346 transitions. [2018-04-13 04:12:46,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2018-04-13 04:12:46,365 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:12:46,365 INFO L355 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:12:46,365 INFO L408 AbstractCegarLoop]: === Iteration 81 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:12:46,365 INFO L82 PathProgramCache]: Analyzing trace with hash 855556547, now seen corresponding path program 65 times [2018-04-13 04:12:46,365 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:12:46,365 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:12:46,366 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:12:46,366 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:12:46,366 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:12:46,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:12:46,497 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:12:46,517 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:12:46,517 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:12:46,517 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:12:46,517 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 04:12:49,503 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 66 check-sat command(s) [2018-04-13 04:12:49,503 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:12:49,660 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:12:49,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-13 04:12:49,663 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:12:49,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:12:49,666 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-13 04:12:49,677 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-13 04:12:49,677 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 04:12:49,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:12:49,683 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-13 04:12:51,920 INFO L134 CoverageAnalysis]: Checked inductivity of 10595 backedges. 0 proven. 10595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:12:51,920 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:12:51,920 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-04-13 04:12:51,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-04-13 04:12:51,920 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-04-13 04:12:51,921 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-04-13 04:12:51,921 INFO L87 Difference]: Start difference. First operand 345 states and 346 transitions. Second operand 75 states. [2018-04-13 04:12:59,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:12:59,411 INFO L93 Difference]: Finished difference Result 352 states and 353 transitions. [2018-04-13 04:12:59,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-04-13 04:12:59,411 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 344 [2018-04-13 04:12:59,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:12:59,412 INFO L225 Difference]: With dead ends: 352 [2018-04-13 04:12:59,412 INFO L226 Difference]: Without dead ends: 352 [2018-04-13 04:12:59,413 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2478 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=445, Invalid=20725, Unknown=0, NotChecked=0, Total=21170 [2018-04-13 04:12:59,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2018-04-13 04:12:59,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 350. [2018-04-13 04:12:59,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-04-13 04:12:59,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 351 transitions. [2018-04-13 04:12:59,415 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 351 transitions. Word has length 344 [2018-04-13 04:12:59,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:12:59,415 INFO L459 AbstractCegarLoop]: Abstraction has 350 states and 351 transitions. [2018-04-13 04:12:59,415 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-04-13 04:12:59,415 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 351 transitions. [2018-04-13 04:12:59,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2018-04-13 04:12:59,416 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:12:59,416 INFO L355 BasicCegarLoop]: trace histogram [67, 67, 66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:12:59,416 INFO L408 AbstractCegarLoop]: === Iteration 82 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:12:59,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1654556440, now seen corresponding path program 66 times [2018-04-13 04:12:59,417 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:12:59,417 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:12:59,417 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:12:59,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:12:59,417 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:12:59,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:12:59,503 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:12:59,513 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:12:59,514 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:12:59,514 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:12:59,514 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 04:13:07,139 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 67 check-sat command(s) [2018-04-13 04:13:07,139 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:13:07,250 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:13:07,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:13:07,253 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:13:07,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:13:07,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:13:07,260 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-13 04:13:07,260 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:13:07,270 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:13:07,271 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-13 04:13:07,271 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:13:07,277 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:13:07,277 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:13:07,278 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-13 04:13:07,278 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:13:07,282 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-13 04:13:07,282 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-13 04:13:10,075 INFO L134 CoverageAnalysis]: Checked inductivity of 10923 backedges. 0 proven. 10923 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:13:10,076 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:13:10,076 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-04-13 04:13:10,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-04-13 04:13:10,076 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-04-13 04:13:10,076 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=5850, Unknown=0, NotChecked=0, Total=6006 [2018-04-13 04:13:10,077 INFO L87 Difference]: Start difference. First operand 350 states and 351 transitions. Second operand 78 states. [2018-04-13 04:13:18,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:13:18,804 INFO L93 Difference]: Finished difference Result 357 states and 358 transitions. [2018-04-13 04:13:18,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-04-13 04:13:18,805 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 349 [2018-04-13 04:13:18,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:13:18,806 INFO L225 Difference]: With dead ends: 357 [2018-04-13 04:13:18,806 INFO L226 Difference]: Without dead ends: 357 [2018-04-13 04:13:18,807 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2838 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=472, Invalid=22480, Unknown=0, NotChecked=0, Total=22952 [2018-04-13 04:13:18,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-04-13 04:13:18,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 355. [2018-04-13 04:13:18,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-04-13 04:13:18,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 356 transitions. [2018-04-13 04:13:18,809 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 356 transitions. Word has length 349 [2018-04-13 04:13:18,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:13:18,809 INFO L459 AbstractCegarLoop]: Abstraction has 355 states and 356 transitions. [2018-04-13 04:13:18,809 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-04-13 04:13:18,809 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 356 transitions. [2018-04-13 04:13:18,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2018-04-13 04:13:18,810 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:13:18,810 INFO L355 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:13:18,810 INFO L408 AbstractCegarLoop]: === Iteration 83 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:13:18,810 INFO L82 PathProgramCache]: Analyzing trace with hash -432246557, now seen corresponding path program 67 times [2018-04-13 04:13:18,810 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:13:18,810 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:13:18,810 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:13:18,810 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:13:18,811 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:13:18,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:13:18,897 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:13:18,914 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:13:18,914 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:13:18,914 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:13:18,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:13:19,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:13:19,805 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:13:19,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:13:19,808 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:13:19,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:13:19,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:13:19,824 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-13 04:13:19,824 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:13:19,833 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:13:19,834 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-13 04:13:19,834 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:13:19,840 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:13:19,840 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:13:19,840 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-13 04:13:19,840 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:13:19,843 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-13 04:13:19,844 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:13:22,689 INFO L134 CoverageAnalysis]: Checked inductivity of 11256 backedges. 0 proven. 11256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:13:22,690 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:13:22,690 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-04-13 04:13:22,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-04-13 04:13:22,690 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-04-13 04:13:22,690 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6005, Unknown=0, NotChecked=0, Total=6162 [2018-04-13 04:13:22,691 INFO L87 Difference]: Start difference. First operand 355 states and 356 transitions. Second operand 79 states. [2018-04-13 04:13:31,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:13:31,416 INFO L93 Difference]: Finished difference Result 362 states and 363 transitions. [2018-04-13 04:13:31,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-04-13 04:13:31,416 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 354 [2018-04-13 04:13:31,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:13:31,417 INFO L225 Difference]: With dead ends: 362 [2018-04-13 04:13:31,417 INFO L226 Difference]: Without dead ends: 362 [2018-04-13 04:13:31,418 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2983 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=475, Invalid=23087, Unknown=0, NotChecked=0, Total=23562 [2018-04-13 04:13:31,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-04-13 04:13:31,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 360. [2018-04-13 04:13:31,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-04-13 04:13:31,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 361 transitions. [2018-04-13 04:13:31,420 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 361 transitions. Word has length 354 [2018-04-13 04:13:31,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:13:31,420 INFO L459 AbstractCegarLoop]: Abstraction has 360 states and 361 transitions. [2018-04-13 04:13:31,420 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-04-13 04:13:31,420 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 361 transitions. [2018-04-13 04:13:31,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2018-04-13 04:13:31,421 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:13:31,421 INFO L355 BasicCegarLoop]: trace histogram [69, 69, 68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:13:31,421 INFO L408 AbstractCegarLoop]: === Iteration 84 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:13:31,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1056193992, now seen corresponding path program 68 times [2018-04-13 04:13:31,421 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:13:31,421 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:13:31,422 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:13:31,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:13:31,422 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:13:31,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:13:31,508 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:13:31,546 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:13:31,546 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:13:31,546 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:13:31,546 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:13:34,781 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:13:34,781 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:13:34,935 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:13:34,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:13:34,939 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:13:34,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 6 treesize of output 5 [2018-04-13 04:13:34,943 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:13:34,946 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-13 04:13:34,947 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:13:34,956 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:13:34,957 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-13 04:13:34,957 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:13:34,965 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:13:34,966 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:13:34,966 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-13 04:13:34,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:13:34,973 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-13 04:13:34,973 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:28 [2018-04-13 04:13:36,165 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-04-13 04:13:36,165 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:13:36,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:13:36,168 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:18 [2018-04-13 04:13:38,302 INFO L134 CoverageAnalysis]: Checked inductivity of 11594 backedges. 0 proven. 11594 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:13:38,302 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:13:38,302 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-04-13 04:13:38,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-04-13 04:13:38,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-04-13 04:13:38,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6161, Unknown=0, NotChecked=0, Total=6320 [2018-04-13 04:13:38,303 INFO L87 Difference]: Start difference. First operand 360 states and 361 transitions. Second operand 80 states. [2018-04-13 04:13:48,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:13:48,516 INFO L93 Difference]: Finished difference Result 367 states and 368 transitions. [2018-04-13 04:13:48,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-04-13 04:13:48,516 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 359 [2018-04-13 04:13:48,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:13:48,517 INFO L225 Difference]: With dead ends: 367 [2018-04-13 04:13:48,517 INFO L226 Difference]: Without dead ends: 367 [2018-04-13 04:13:48,517 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2876 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=476, Invalid=23394, Unknown=0, NotChecked=0, Total=23870 [2018-04-13 04:13:48,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-04-13 04:13:48,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 365. [2018-04-13 04:13:48,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-04-13 04:13:48,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 366 transitions. [2018-04-13 04:13:48,519 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 366 transitions. Word has length 359 [2018-04-13 04:13:48,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:13:48,519 INFO L459 AbstractCegarLoop]: Abstraction has 365 states and 366 transitions. [2018-04-13 04:13:48,519 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-04-13 04:13:48,519 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 366 transitions. [2018-04-13 04:13:48,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2018-04-13 04:13:48,520 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:13:48,520 INFO L355 BasicCegarLoop]: trace histogram [70, 70, 69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:13:48,520 INFO L408 AbstractCegarLoop]: === Iteration 85 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:13:48,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1677834243, now seen corresponding path program 69 times [2018-04-13 04:13:48,521 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:13:48,521 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:13:48,521 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:13:48,521 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:13:48,521 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:13:48,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:13:48,609 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:13:48,630 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:13:48,630 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:13:48,630 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:13:48,630 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:13:50,827 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2018-04-13 04:13:50,827 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:13:51,022 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:13:51,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:13:51,026 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:13:51,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:13:51,029 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-13 04:13:51,040 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-13 04:13:51,040 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 04:13:51,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:13:51,045 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-13 04:13:53,656 INFO L134 CoverageAnalysis]: Checked inductivity of 11937 backedges. 0 proven. 11937 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:13:53,656 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:13:53,656 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-04-13 04:13:53,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-04-13 04:13:53,657 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-04-13 04:13:53,657 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=6162, Unknown=0, NotChecked=0, Total=6320 [2018-04-13 04:13:53,657 INFO L87 Difference]: Start difference. First operand 365 states and 366 transitions. Second operand 80 states. [2018-04-13 04:14:02,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:14:02,211 INFO L93 Difference]: Finished difference Result 372 states and 373 transitions. [2018-04-13 04:14:02,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-04-13 04:14:02,211 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 364 [2018-04-13 04:14:02,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:14:02,212 INFO L225 Difference]: With dead ends: 372 [2018-04-13 04:14:02,212 INFO L226 Difference]: Without dead ends: 372 [2018-04-13 04:14:02,213 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2918 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=478, Invalid=23702, Unknown=0, NotChecked=0, Total=24180 [2018-04-13 04:14:02,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2018-04-13 04:14:02,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 370. [2018-04-13 04:14:02,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2018-04-13 04:14:02,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 371 transitions. [2018-04-13 04:14:02,215 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 371 transitions. Word has length 364 [2018-04-13 04:14:02,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:14:02,216 INFO L459 AbstractCegarLoop]: Abstraction has 370 states and 371 transitions. [2018-04-13 04:14:02,216 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-04-13 04:14:02,216 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 371 transitions. [2018-04-13 04:14:02,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2018-04-13 04:14:02,217 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:14:02,218 INFO L355 BasicCegarLoop]: trace histogram [71, 71, 70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:14:02,218 INFO L408 AbstractCegarLoop]: === Iteration 86 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:14:02,218 INFO L82 PathProgramCache]: Analyzing trace with hash -218207576, now seen corresponding path program 70 times [2018-04-13 04:14:02,218 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:14:02,218 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:14:02,218 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:14:02,219 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:14:02,219 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:14:02,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:14:02,326 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:14:02,346 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:14:02,346 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:14:02,346 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:14:02,346 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 04:14:03,272 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 04:14:03,272 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:14:03,372 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:14:03,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:14:03,376 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:14:03,380 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:14:03,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:14:03,383 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-13 04:14:03,383 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:14:03,394 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:14:03,394 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:14:03,394 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-13 04:14:03,394 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:14:03,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-13 04:14:03,399 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:14:03,402 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-13 04:14:03,403 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:14:06,561 INFO L134 CoverageAnalysis]: Checked inductivity of 12285 backedges. 0 proven. 12285 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:14:06,562 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:14:06,562 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-04-13 04:14:06,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-04-13 04:14:06,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-04-13 04:14:06,563 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6479, Unknown=0, NotChecked=0, Total=6642 [2018-04-13 04:14:06,563 INFO L87 Difference]: Start difference. First operand 370 states and 371 transitions. Second operand 82 states. [2018-04-13 04:14:16,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:14:16,209 INFO L93 Difference]: Finished difference Result 377 states and 378 transitions. [2018-04-13 04:14:16,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-04-13 04:14:16,209 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 369 [2018-04-13 04:14:16,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:14:16,210 INFO L225 Difference]: With dead ends: 377 [2018-04-13 04:14:16,210 INFO L226 Difference]: Without dead ends: 377 [2018-04-13 04:14:16,210 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3221 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=493, Invalid=24947, Unknown=0, NotChecked=0, Total=25440 [2018-04-13 04:14:16,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-04-13 04:14:16,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 375. [2018-04-13 04:14:16,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-04-13 04:14:16,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 376 transitions. [2018-04-13 04:14:16,212 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 376 transitions. Word has length 369 [2018-04-13 04:14:16,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:14:16,213 INFO L459 AbstractCegarLoop]: Abstraction has 375 states and 376 transitions. [2018-04-13 04:14:16,213 INFO L460 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-04-13 04:14:16,213 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 376 transitions. [2018-04-13 04:14:16,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2018-04-13 04:14:16,214 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:14:16,214 INFO L355 BasicCegarLoop]: trace histogram [72, 72, 71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:14:16,214 INFO L408 AbstractCegarLoop]: === Iteration 87 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:14:16,214 INFO L82 PathProgramCache]: Analyzing trace with hash 967874339, now seen corresponding path program 71 times [2018-04-13 04:14:16,214 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:14:16,214 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:14:16,215 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:14:16,215 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:14:16,215 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:14:16,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:14:16,311 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:14:16,323 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:14:16,323 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:14:16,323 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:14:16,324 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 04:14:20,115 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 72 check-sat command(s) [2018-04-13 04:14:20,115 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:14:20,168 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:14:20,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:14:20,171 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:14:20,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:14:20,174 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-13 04:14:20,185 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-13 04:14:20,186 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 04:14:20,191 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:14:20,191 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-13 04:14:20,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-13 04:14:20,417 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:14:20,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:14:20,420 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:17 [2018-04-13 04:14:23,147 INFO L134 CoverageAnalysis]: Checked inductivity of 12638 backedges. 0 proven. 12638 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:14:23,148 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:14:23,148 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-04-13 04:14:23,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-04-13 04:14:23,149 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-04-13 04:14:23,149 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=6480, Unknown=0, NotChecked=0, Total=6642 [2018-04-13 04:14:23,149 INFO L87 Difference]: Start difference. First operand 375 states and 376 transitions. Second operand 82 states. [2018-04-13 04:14:32,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:14:32,613 INFO L93 Difference]: Finished difference Result 382 states and 383 transitions. [2018-04-13 04:14:32,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-04-13 04:14:32,613 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 374 [2018-04-13 04:14:32,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:14:32,614 INFO L225 Difference]: With dead ends: 382 [2018-04-13 04:14:32,614 INFO L226 Difference]: Without dead ends: 382 [2018-04-13 04:14:32,614 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3143 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=490, Invalid=24950, Unknown=0, NotChecked=0, Total=25440 [2018-04-13 04:14:32,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-04-13 04:14:32,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 380. [2018-04-13 04:14:32,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-04-13 04:14:32,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 381 transitions. [2018-04-13 04:14:32,616 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 381 transitions. Word has length 374 [2018-04-13 04:14:32,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:14:32,616 INFO L459 AbstractCegarLoop]: Abstraction has 380 states and 381 transitions. [2018-04-13 04:14:32,616 INFO L460 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-04-13 04:14:32,616 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 381 transitions. [2018-04-13 04:14:32,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2018-04-13 04:14:32,617 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:14:32,617 INFO L355 BasicCegarLoop]: trace histogram [73, 73, 72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:14:32,617 INFO L408 AbstractCegarLoop]: === Iteration 88 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:14:32,617 INFO L82 PathProgramCache]: Analyzing trace with hash 962461576, now seen corresponding path program 72 times [2018-04-13 04:14:32,618 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:14:32,618 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:14:32,618 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:14:32,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:14:32,618 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:14:32,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:14:32,711 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:14:32,734 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:14:32,735 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:14:32,735 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:14:32,735 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 04:14:38,309 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 73 check-sat command(s) [2018-04-13 04:14:38,309 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:14:38,401 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:14:38,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:14:38,404 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:14:38,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:14:38,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:14:38,412 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-13 04:14:38,412 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:14:38,429 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:14:38,430 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-13 04:14:38,430 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:14:38,436 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:14:38,437 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:14:38,437 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-13 04:14:38,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:14:38,441 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-13 04:14:38,441 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-13 04:14:41,618 INFO L134 CoverageAnalysis]: Checked inductivity of 12996 backedges. 0 proven. 12996 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:14:41,619 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:14:41,619 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-04-13 04:14:41,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-04-13 04:14:41,620 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-04-13 04:14:41,620 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=6642, Unknown=0, NotChecked=0, Total=6806 [2018-04-13 04:14:41,620 INFO L87 Difference]: Start difference. First operand 380 states and 381 transitions. Second operand 83 states. [2018-04-13 04:14:51,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:14:51,589 INFO L93 Difference]: Finished difference Result 387 states and 388 transitions. [2018-04-13 04:14:51,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-04-13 04:14:51,590 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 379 [2018-04-13 04:14:51,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:14:51,590 INFO L225 Difference]: With dead ends: 387 [2018-04-13 04:14:51,590 INFO L226 Difference]: Without dead ends: 387 [2018-04-13 04:14:51,591 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3152 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=496, Invalid=25586, Unknown=0, NotChecked=0, Total=26082 [2018-04-13 04:14:51,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-04-13 04:14:51,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 385. [2018-04-13 04:14:51,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-04-13 04:14:51,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 386 transitions. [2018-04-13 04:14:51,593 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 386 transitions. Word has length 379 [2018-04-13 04:14:51,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:14:51,593 INFO L459 AbstractCegarLoop]: Abstraction has 385 states and 386 transitions. [2018-04-13 04:14:51,593 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-04-13 04:14:51,593 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 386 transitions. [2018-04-13 04:14:51,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2018-04-13 04:14:51,594 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:14:51,594 INFO L355 BasicCegarLoop]: trace histogram [74, 74, 73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:14:51,594 INFO L408 AbstractCegarLoop]: === Iteration 89 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:14:51,595 INFO L82 PathProgramCache]: Analyzing trace with hash 573247043, now seen corresponding path program 73 times [2018-04-13 04:14:51,595 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:14:51,595 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:14:51,595 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:14:51,595 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:14:51,595 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:14:51,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:14:51,695 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:14:51,706 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:14:51,706 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:14:51,706 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:14:51,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:14:52,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:14:52,813 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:14:52,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:14:52,819 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:14:52,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:14:52,823 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:14:52,826 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-13 04:14:52,826 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:14:52,835 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:14:52,836 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-13 04:14:52,836 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:14:52,841 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:14:52,841 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:14:52,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-13 04:14:52,842 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:14:52,845 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-13 04:14:52,845 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:14:56,093 INFO L134 CoverageAnalysis]: Checked inductivity of 13359 backedges. 0 proven. 13359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:14:56,094 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:14:56,094 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-04-13 04:14:56,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-04-13 04:14:56,094 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-04-13 04:14:56,094 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=6971, Unknown=0, NotChecked=0, Total=7140 [2018-04-13 04:14:56,095 INFO L87 Difference]: Start difference. First operand 385 states and 386 transitions. Second operand 85 states. [2018-04-13 04:15:06,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:15:06,495 INFO L93 Difference]: Finished difference Result 392 states and 393 transitions. [2018-04-13 04:15:06,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-04-13 04:15:06,495 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 384 [2018-04-13 04:15:06,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:15:06,496 INFO L225 Difference]: With dead ends: 392 [2018-04-13 04:15:06,496 INFO L226 Difference]: Without dead ends: 392 [2018-04-13 04:15:06,497 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 464 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3466 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=511, Invalid=26879, Unknown=0, NotChecked=0, Total=27390 [2018-04-13 04:15:06,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2018-04-13 04:15:06,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 390. [2018-04-13 04:15:06,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2018-04-13 04:15:06,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 391 transitions. [2018-04-13 04:15:06,499 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 391 transitions. Word has length 384 [2018-04-13 04:15:06,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:15:06,499 INFO L459 AbstractCegarLoop]: Abstraction has 390 states and 391 transitions. [2018-04-13 04:15:06,499 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-04-13 04:15:06,499 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 391 transitions. [2018-04-13 04:15:06,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2018-04-13 04:15:06,500 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:15:06,500 INFO L355 BasicCegarLoop]: trace histogram [75, 75, 74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:15:06,500 INFO L408 AbstractCegarLoop]: === Iteration 90 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:15:06,501 INFO L82 PathProgramCache]: Analyzing trace with hash -730792856, now seen corresponding path program 74 times [2018-04-13 04:15:06,501 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:15:06,501 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:15:06,501 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:15:06,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:15:06,501 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:15:06,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:15:06,605 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:15:06,631 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:15:06,631 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:15:06,631 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:15:06,632 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:15:08,709 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:15:08,710 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:15:08,842 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:15:08,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:15:08,845 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:15:08,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:15:08,849 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:15:08,852 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-13 04:15:08,852 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:15:08,862 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:15:08,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, 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-13 04:15:08,863 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:15:08,871 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:15:08,871 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:15:08,871 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-13 04:15:08,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:15:08,878 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-13 04:15:08,878 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:28 [2018-04-13 04:15:11,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-04-13 04:15:11,900 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:15:11,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:15:11,904 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:18 [2018-04-13 04:15:12,999 INFO L134 CoverageAnalysis]: Checked inductivity of 13727 backedges. 0 proven. 13727 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:15:12,999 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:15:12,999 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-04-13 04:15:12,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-04-13 04:15:12,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-04-13 04:15:13,000 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=7139, Unknown=0, NotChecked=0, Total=7310 [2018-04-13 04:15:13,000 INFO L87 Difference]: Start difference. First operand 390 states and 391 transitions. Second operand 86 states. [2018-04-13 04:15:25,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:15:25,259 INFO L93 Difference]: Finished difference Result 397 states and 398 transitions. [2018-04-13 04:15:25,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-04-13 04:15:25,259 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 389 [2018-04-13 04:15:25,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:15:25,260 INFO L225 Difference]: With dead ends: 397 [2018-04-13 04:15:25,260 INFO L226 Difference]: Without dead ends: 397 [2018-04-13 04:15:25,261 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3322 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=512, Invalid=27210, Unknown=0, NotChecked=0, Total=27722 [2018-04-13 04:15:25,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-04-13 04:15:25,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 395. [2018-04-13 04:15:25,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-04-13 04:15:25,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 396 transitions. [2018-04-13 04:15:25,263 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 396 transitions. Word has length 389 [2018-04-13 04:15:25,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:15:25,263 INFO L459 AbstractCegarLoop]: Abstraction has 395 states and 396 transitions. [2018-04-13 04:15:25,263 INFO L460 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-04-13 04:15:25,263 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 396 transitions. [2018-04-13 04:15:25,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2018-04-13 04:15:25,264 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:15:25,265 INFO L355 BasicCegarLoop]: trace histogram [76, 76, 75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:15:25,265 INFO L408 AbstractCegarLoop]: === Iteration 91 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:15:25,265 INFO L82 PathProgramCache]: Analyzing trace with hash 634592611, now seen corresponding path program 75 times [2018-04-13 04:15:25,265 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:15:25,265 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:15:25,265 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:15:25,265 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:15:25,265 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:15:25,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:15:25,382 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:15:25,412 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:15:25,413 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:15:25,413 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:15:25,413 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:15:30,870 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 76 check-sat command(s) [2018-04-13 04:15:30,871 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:15:31,129 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:15:31,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:15:31,133 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:15:31,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:15:31,136 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-13 04:15:31,146 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-13 04:15:31,146 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 04:15:31,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:15:31,151 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-04-13 04:15:34,268 INFO L134 CoverageAnalysis]: Checked inductivity of 14100 backedges. 0 proven. 14100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:15:34,268 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:15:34,268 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-04-13 04:15:34,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-04-13 04:15:34,268 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-04-13 04:15:34,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=7309, Unknown=0, NotChecked=0, Total=7482 [2018-04-13 04:15:34,269 INFO L87 Difference]: Start difference. First operand 395 states and 396 transitions. Second operand 87 states. [2018-04-13 04:15:44,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:15:44,091 INFO L93 Difference]: Finished difference Result 402 states and 403 transitions. [2018-04-13 04:15:44,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-04-13 04:15:44,091 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 394 [2018-04-13 04:15:44,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:15:44,092 INFO L225 Difference]: With dead ends: 402 [2018-04-13 04:15:44,092 INFO L226 Difference]: Without dead ends: 402 [2018-04-13 04:15:44,093 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3635 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=523, Invalid=28207, Unknown=0, NotChecked=0, Total=28730 [2018-04-13 04:15:44,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-04-13 04:15:44,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 400. [2018-04-13 04:15:44,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-04-13 04:15:44,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 401 transitions. [2018-04-13 04:15:44,094 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 401 transitions. Word has length 394 [2018-04-13 04:15:44,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:15:44,095 INFO L459 AbstractCegarLoop]: Abstraction has 400 states and 401 transitions. [2018-04-13 04:15:44,095 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-04-13 04:15:44,095 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 401 transitions. [2018-04-13 04:15:44,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2018-04-13 04:15:44,096 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:15:44,096 INFO L355 BasicCegarLoop]: trace histogram [77, 77, 76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:15:44,096 INFO L408 AbstractCegarLoop]: === Iteration 92 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:15:44,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1458216632, now seen corresponding path program 76 times [2018-04-13 04:15:44,096 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:15:44,096 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:15:44,096 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:15:44,096 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:15:44,097 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:15:44,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:15:44,205 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:15:44,225 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:15:44,225 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:15:44,225 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:15:44,226 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 04:15:45,350 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 04:15:45,351 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:15:45,460 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:15:45,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 6 treesize of output 5 [2018-04-13 04:15:45,464 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:15:45,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:15:45,468 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:15:45,471 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-13 04:15:45,471 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:15:45,480 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:15:45,481 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-13 04:15:45,481 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:15:45,487 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:15:45,487 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:15:45,487 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-13 04:15:45,488 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:15:45,491 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-13 04:15:45,491 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:15:49,064 INFO L134 CoverageAnalysis]: Checked inductivity of 14478 backedges. 0 proven. 14478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:15:49,065 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:15:49,065 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-04-13 04:15:49,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-04-13 04:15:49,065 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-04-13 04:15:49,066 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=7481, Unknown=0, NotChecked=0, Total=7656 [2018-04-13 04:15:49,066 INFO L87 Difference]: Start difference. First operand 400 states and 401 transitions. Second operand 88 states. [2018-04-13 04:15:59,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:15:59,912 INFO L93 Difference]: Finished difference Result 407 states and 408 transitions. [2018-04-13 04:15:59,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-04-13 04:15:59,913 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 399 [2018-04-13 04:15:59,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:15:59,914 INFO L225 Difference]: With dead ends: 407 [2018-04-13 04:15:59,914 INFO L226 Difference]: Without dead ends: 407 [2018-04-13 04:15:59,915 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3724 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=529, Invalid=28883, Unknown=0, NotChecked=0, Total=29412 [2018-04-13 04:15:59,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2018-04-13 04:15:59,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 405. [2018-04-13 04:15:59,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-04-13 04:15:59,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 406 transitions. [2018-04-13 04:15:59,917 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 406 transitions. Word has length 399 [2018-04-13 04:15:59,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:15:59,917 INFO L459 AbstractCegarLoop]: Abstraction has 405 states and 406 transitions. [2018-04-13 04:15:59,917 INFO L460 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-04-13 04:15:59,917 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 406 transitions. [2018-04-13 04:15:59,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2018-04-13 04:15:59,918 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:15:59,918 INFO L355 BasicCegarLoop]: trace histogram [78, 78, 77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:15:59,918 INFO L408 AbstractCegarLoop]: === Iteration 93 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:15:59,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1165310845, now seen corresponding path program 77 times [2018-04-13 04:15:59,918 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:15:59,918 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:15:59,919 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:15:59,919 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:15:59,919 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:16:00,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:16:00,134 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:16:00,147 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:16:00,147 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:16:00,147 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:16:00,147 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 04:16:03,923 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 78 check-sat command(s) [2018-04-13 04:16:03,924 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:16:04,074 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:16:04,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:16:04,077 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:16:04,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 6 treesize of output 5 [2018-04-13 04:16:04,083 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:16:04,087 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-13 04:16:04,087 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:16:04,096 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:16:04,097 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:16:04,097 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-13 04:16:04,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:16:04,104 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-13 04:16:04,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:16:04,109 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-13 04:16:04,109 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:28 [2018-04-13 04:16:04,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:16:04,970 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:16:04,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:16:04,977 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:18 [2018-04-13 04:16:08,730 INFO L134 CoverageAnalysis]: Checked inductivity of 14861 backedges. 0 proven. 14861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:16:08,731 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:16:08,731 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-04-13 04:16:08,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-04-13 04:16:08,731 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-04-13 04:16:08,731 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=7482, Unknown=0, NotChecked=0, Total=7656 [2018-04-13 04:16:08,732 INFO L87 Difference]: Start difference. First operand 405 states and 406 transitions. Second operand 88 states. [2018-04-13 04:16:20,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:16:20,639 INFO L93 Difference]: Finished difference Result 412 states and 413 transitions. [2018-04-13 04:16:20,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-04-13 04:16:20,639 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 404 [2018-04-13 04:16:20,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:16:20,640 INFO L225 Difference]: With dead ends: 412 [2018-04-13 04:16:20,640 INFO L226 Difference]: Without dead ends: 412 [2018-04-13 04:16:20,640 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3442 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=521, Invalid=28549, Unknown=0, NotChecked=0, Total=29070 [2018-04-13 04:16:20,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2018-04-13 04:16:20,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 410. [2018-04-13 04:16:20,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-04-13 04:16:20,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 411 transitions. [2018-04-13 04:16:20,642 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 411 transitions. Word has length 404 [2018-04-13 04:16:20,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:16:20,642 INFO L459 AbstractCegarLoop]: Abstraction has 410 states and 411 transitions. [2018-04-13 04:16:20,642 INFO L460 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-04-13 04:16:20,642 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 411 transitions. [2018-04-13 04:16:20,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2018-04-13 04:16:20,643 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:16:20,644 INFO L355 BasicCegarLoop]: trace histogram [79, 79, 78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:16:20,644 INFO L408 AbstractCegarLoop]: === Iteration 94 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:16:20,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1633079768, now seen corresponding path program 78 times [2018-04-13 04:16:20,644 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:16:20,644 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:16:20,644 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:16:20,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:16:20,644 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:16:20,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:16:20,755 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:16:20,772 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:16:20,772 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:16:20,772 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:16:20,773 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 04:16:24,247 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 79 check-sat command(s) [2018-04-13 04:16:24,248 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:16:24,381 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:16:24,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:16:24,384 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:16:24,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:16:24,396 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-13 04:16:24,406 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-13 04:16:24,406 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 04:16:24,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:16:24,412 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-13 04:16:27,685 INFO L134 CoverageAnalysis]: Checked inductivity of 15249 backedges. 0 proven. 15249 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:16:27,686 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:16:27,686 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-04-13 04:16:27,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-04-13 04:16:27,686 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-04-13 04:16:27,686 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=7830, Unknown=0, NotChecked=0, Total=8010 [2018-04-13 04:16:27,687 INFO L87 Difference]: Start difference. First operand 410 states and 411 transitions. Second operand 90 states. [2018-04-13 04:16:38,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:16:38,289 INFO L93 Difference]: Finished difference Result 417 states and 418 transitions. [2018-04-13 04:16:38,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-04-13 04:16:38,289 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 409 [2018-04-13 04:16:38,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:16:38,290 INFO L225 Difference]: With dead ends: 417 [2018-04-13 04:16:38,290 INFO L226 Difference]: Without dead ends: 417 [2018-04-13 04:16:38,291 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3816 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=544, Invalid=30256, Unknown=0, NotChecked=0, Total=30800 [2018-04-13 04:16:38,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-04-13 04:16:38,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 415. [2018-04-13 04:16:38,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2018-04-13 04:16:38,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 416 transitions. [2018-04-13 04:16:38,293 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 416 transitions. Word has length 409 [2018-04-13 04:16:38,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:16:38,293 INFO L459 AbstractCegarLoop]: Abstraction has 415 states and 416 transitions. [2018-04-13 04:16:38,293 INFO L460 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-04-13 04:16:38,293 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 416 transitions. [2018-04-13 04:16:38,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2018-04-13 04:16:38,294 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:16:38,294 INFO L355 BasicCegarLoop]: trace histogram [80, 80, 79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:16:38,294 INFO L408 AbstractCegarLoop]: === Iteration 95 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:16:38,294 INFO L82 PathProgramCache]: Analyzing trace with hash -474741853, now seen corresponding path program 79 times [2018-04-13 04:16:38,294 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:16:38,294 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:16:38,295 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:16:38,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:16:38,295 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:16:38,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:16:38,415 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:16:38,437 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:16:38,437 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:16:38,437 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:16:38,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:16:39,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:16:39,801 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:16:39,934 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:16:39,934 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:16:39,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-13 04:16:39,942 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:16:39,945 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-13 04:16:39,945 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:16:39,955 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:16:39,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:16:39,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:16:39,961 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:16:39,962 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:16:39,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:16:39,963 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:16:39,966 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-13 04:16:39,966 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:16:43,797 INFO L134 CoverageAnalysis]: Checked inductivity of 15642 backedges. 0 proven. 15642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:16:43,797 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:16:43,797 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-04-13 04:16:43,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-04-13 04:16:43,797 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-04-13 04:16:43,798 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=8009, Unknown=0, NotChecked=0, Total=8190 [2018-04-13 04:16:43,798 INFO L87 Difference]: Start difference. First operand 415 states and 416 transitions. Second operand 91 states. [2018-04-13 04:16:55,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:16:55,260 INFO L93 Difference]: Finished difference Result 422 states and 423 transitions. [2018-04-13 04:16:55,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-04-13 04:16:55,260 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 414 [2018-04-13 04:16:55,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:16:55,261 INFO L225 Difference]: With dead ends: 422 [2018-04-13 04:16:55,261 INFO L226 Difference]: Without dead ends: 422 [2018-04-13 04:16:55,262 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3985 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=547, Invalid=30959, Unknown=0, NotChecked=0, Total=31506 [2018-04-13 04:16:55,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2018-04-13 04:16:55,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 420. [2018-04-13 04:16:55,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2018-04-13 04:16:55,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 421 transitions. [2018-04-13 04:16:55,264 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 421 transitions. Word has length 414 [2018-04-13 04:16:55,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:16:55,264 INFO L459 AbstractCegarLoop]: Abstraction has 420 states and 421 transitions. [2018-04-13 04:16:55,264 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-04-13 04:16:55,265 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 421 transitions. [2018-04-13 04:16:55,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2018-04-13 04:16:55,266 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:16:55,266 INFO L355 BasicCegarLoop]: trace histogram [81, 81, 80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:16:55,266 INFO L408 AbstractCegarLoop]: === Iteration 96 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:16:55,266 INFO L82 PathProgramCache]: Analyzing trace with hash 2131387144, now seen corresponding path program 80 times [2018-04-13 04:16:55,266 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:16:55,266 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:16:55,266 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:16:55,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:16:55,266 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:16:55,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:16:55,398 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:16:55,414 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:16:55,414 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:16:55,414 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:16:55,415 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:16:58,279 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:16:58,279 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:16:58,362 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:16:58,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:16:58,365 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:16:58,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:16:58,368 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:16:58,371 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-13 04:16:58,371 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:16:58,380 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:16:58,381 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:16:58,381 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-13 04:16:58,381 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:16:58,388 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-13 04:16:58,389 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:16:58,394 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-13 04:16:58,394 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:28 [2018-04-13 04:17:00,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-04-13 04:17:00,422 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:17:00,426 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:17:00,426 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:18 [2018-04-13 04:17:03,237 INFO L134 CoverageAnalysis]: Checked inductivity of 16040 backedges. 0 proven. 16040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:17:03,237 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:17:03,237 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-04-13 04:17:03,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-04-13 04:17:03,237 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-04-13 04:17:03,238 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=8189, Unknown=0, NotChecked=0, Total=8372 [2018-04-13 04:17:03,238 INFO L87 Difference]: Start difference. First operand 420 states and 421 transitions. Second operand 92 states. [2018-04-13 04:17:17,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:17:17,530 INFO L93 Difference]: Finished difference Result 427 states and 428 transitions. [2018-04-13 04:17:17,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-04-13 04:17:17,530 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 419 [2018-04-13 04:17:17,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:17:17,531 INFO L225 Difference]: With dead ends: 427 [2018-04-13 04:17:17,531 INFO L226 Difference]: Without dead ends: 427 [2018-04-13 04:17:17,532 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 505 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3863 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=548, Invalid=31314, Unknown=0, NotChecked=0, Total=31862 [2018-04-13 04:17:17,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2018-04-13 04:17:17,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 425. [2018-04-13 04:17:17,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-04-13 04:17:17,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 426 transitions. [2018-04-13 04:17:17,534 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 426 transitions. Word has length 419 [2018-04-13 04:17:17,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:17:17,534 INFO L459 AbstractCegarLoop]: Abstraction has 425 states and 426 transitions. [2018-04-13 04:17:17,534 INFO L460 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-04-13 04:17:17,534 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 426 transitions. [2018-04-13 04:17:17,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2018-04-13 04:17:17,536 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:17:17,536 INFO L355 BasicCegarLoop]: trace histogram [82, 82, 81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:17:17,536 INFO L408 AbstractCegarLoop]: === Iteration 97 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:17:17,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1378933443, now seen corresponding path program 81 times [2018-04-13 04:17:17,536 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:17:17,537 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:17:17,537 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:17:17,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:17:17,537 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:17:17,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:17:17,662 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:17:17,682 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:17:17,682 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:17:17,682 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:17:17,683 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:17:22,085 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 82 check-sat command(s) [2018-04-13 04:17:22,085 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:17:22,509 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:17:22,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:17:22,522 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:17:22,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:17:22,526 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:17:22,529 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-13 04:17:22,529 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:17:22,538 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:17:22,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-13 04:17:22,539 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:17:22,547 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:17:22,547 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:17:22,547 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-13 04:17:22,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:17:22,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-13 04:17:22,553 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:28 [2018-04-13 04:17:26,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, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-13 04:17:26,834 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:17:26,839 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-13 04:17:26,839 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:23 [2018-04-13 04:17:27,494 INFO L134 CoverageAnalysis]: Checked inductivity of 16443 backedges. 0 proven. 16443 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:17:27,495 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:17:27,495 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-04-13 04:17:27,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-04-13 04:17:27,495 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-04-13 04:17:27,495 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=8190, Unknown=0, NotChecked=0, Total=8372 [2018-04-13 04:17:27,496 INFO L87 Difference]: Start difference. First operand 425 states and 426 transitions. Second operand 92 states. [2018-04-13 04:17:41,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:17:41,990 INFO L93 Difference]: Finished difference Result 432 states and 433 transitions. [2018-04-13 04:17:41,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-04-13 04:17:41,990 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 424 [2018-04-13 04:17:41,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:17:41,991 INFO L225 Difference]: With dead ends: 432 [2018-04-13 04:17:41,991 INFO L226 Difference]: Without dead ends: 432 [2018-04-13 04:17:41,992 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 511 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3908 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=550, Invalid=31670, Unknown=0, NotChecked=0, Total=32220 [2018-04-13 04:17:41,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2018-04-13 04:17:41,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 430. [2018-04-13 04:17:41,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-04-13 04:17:41,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 431 transitions. [2018-04-13 04:17:41,994 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 431 transitions. Word has length 424 [2018-04-13 04:17:41,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:17:41,994 INFO L459 AbstractCegarLoop]: Abstraction has 430 states and 431 transitions. [2018-04-13 04:17:41,994 INFO L460 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-04-13 04:17:41,994 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 431 transitions. [2018-04-13 04:17:41,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2018-04-13 04:17:41,995 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:17:41,995 INFO L355 BasicCegarLoop]: trace histogram [83, 83, 82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:17:41,995 INFO L408 AbstractCegarLoop]: === Iteration 98 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:17:41,995 INFO L82 PathProgramCache]: Analyzing trace with hash -694747160, now seen corresponding path program 82 times [2018-04-13 04:17:41,995 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:17:41,995 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:17:41,996 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:17:41,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:17:41,996 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:17:42,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:17:42,129 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:17:42,160 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:17:42,160 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:17:42,160 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:17:42,161 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 04:17:43,671 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 04:17:43,671 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:17:43,802 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:17:43,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-13 04:17:43,805 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:17:43,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:17:43,808 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:17:43,811 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-13 04:17:43,811 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:17:43,820 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:17:43,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, 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-13 04:17:43,821 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:17:43,834 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:17:43,834 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:17:43,835 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-13 04:17:43,835 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:17:43,838 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-13 04:17:43,838 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:17:47,889 INFO L134 CoverageAnalysis]: Checked inductivity of 16851 backedges. 0 proven. 16851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:17:47,889 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:17:47,914 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-04-13 04:17:47,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-04-13 04:17:47,914 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-04-13 04:17:47,915 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=8555, Unknown=0, NotChecked=0, Total=8742 [2018-04-13 04:17:47,915 INFO L87 Difference]: Start difference. First operand 430 states and 431 transitions. Second operand 94 states. [2018-04-13 04:18:00,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:18:00,566 INFO L93 Difference]: Finished difference Result 437 states and 438 transitions. [2018-04-13 04:18:00,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-04-13 04:18:00,566 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 429 [2018-04-13 04:18:00,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:18:00,567 INFO L225 Difference]: With dead ends: 437 [2018-04-13 04:18:00,567 INFO L226 Difference]: Without dead ends: 437 [2018-04-13 04:18:00,568 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4259 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=565, Invalid=33107, Unknown=0, NotChecked=0, Total=33672 [2018-04-13 04:18:00,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2018-04-13 04:18:00,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 435. [2018-04-13 04:18:00,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-04-13 04:18:00,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 436 transitions. [2018-04-13 04:18:00,570 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 436 transitions. Word has length 429 [2018-04-13 04:18:00,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:18:00,570 INFO L459 AbstractCegarLoop]: Abstraction has 435 states and 436 transitions. [2018-04-13 04:18:00,571 INFO L460 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-04-13 04:18:00,571 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 436 transitions. [2018-04-13 04:18:00,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2018-04-13 04:18:00,572 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:18:00,572 INFO L355 BasicCegarLoop]: trace histogram [84, 84, 83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:18:00,572 INFO L408 AbstractCegarLoop]: === Iteration 99 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:18:00,572 INFO L82 PathProgramCache]: Analyzing trace with hash -2073867805, now seen corresponding path program 83 times [2018-04-13 04:18:00,572 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:18:00,572 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:18:00,572 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:18:00,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:18:00,572 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:18:00,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:18:00,714 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:18:00,738 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:18:00,738 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:18:00,739 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:18:00,739 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-13 04:18:05,944 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 84 check-sat command(s) [2018-04-13 04:18:05,944 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:18:06,129 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:18:06,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:18:06,132 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:18:06,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:18:06,135 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-13 04:18:06,162 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-13 04:18:06,162 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 04:18:06,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:18:06,168 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-13 04:18:09,684 INFO L134 CoverageAnalysis]: Checked inductivity of 17264 backedges. 0 proven. 17264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:18:09,684 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:18:09,684 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-04-13 04:18:09,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-04-13 04:18:09,685 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-04-13 04:18:09,685 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=8373, Unknown=0, NotChecked=0, Total=8556 [2018-04-13 04:18:09,685 INFO L87 Difference]: Start difference. First operand 435 states and 436 transitions. Second operand 93 states. [2018-04-13 04:18:21,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:18:21,145 INFO L93 Difference]: Finished difference Result 442 states and 443 transitions. [2018-04-13 04:18:21,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-04-13 04:18:21,145 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 434 [2018-04-13 04:18:21,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:18:21,146 INFO L225 Difference]: With dead ends: 442 [2018-04-13 04:18:21,146 INFO L226 Difference]: Without dead ends: 442 [2018-04-13 04:18:21,147 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 522 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3909 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=553, Invalid=32389, Unknown=0, NotChecked=0, Total=32942 [2018-04-13 04:18:21,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2018-04-13 04:18:21,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 440. [2018-04-13 04:18:21,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2018-04-13 04:18:21,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 441 transitions. [2018-04-13 04:18:21,149 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 441 transitions. Word has length 434 [2018-04-13 04:18:21,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:18:21,149 INFO L459 AbstractCegarLoop]: Abstraction has 440 states and 441 transitions. [2018-04-13 04:18:21,149 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-04-13 04:18:21,150 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 441 transitions. [2018-04-13 04:18:21,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2018-04-13 04:18:21,151 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:18:21,151 INFO L355 BasicCegarLoop]: trace histogram [85, 85, 84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:18:21,151 INFO L408 AbstractCegarLoop]: === Iteration 100 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:18:21,151 INFO L82 PathProgramCache]: Analyzing trace with hash -735247160, now seen corresponding path program 84 times [2018-04-13 04:18:21,151 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:18:21,151 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:18:21,152 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:18:21,152 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:18:21,152 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:18:21,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:18:21,301 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:18:21,318 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:18:21,318 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:18:21,318 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:18:21,319 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-13 04:18:26,653 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 85 check-sat command(s) [2018-04-13 04:18:26,653 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:18:26,721 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:18:26,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:18:26,724 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:18:26,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:18:26,729 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:18:26,733 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-13 04:18:26,733 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:18:26,750 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:18:26,751 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-13 04:18:26,751 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:18:26,759 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:18:26,760 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:18:26,760 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-13 04:18:26,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:18:26,764 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-13 04:18:26,764 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-13 04:18:31,010 INFO L134 CoverageAnalysis]: Checked inductivity of 17682 backedges. 0 proven. 17682 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:18:31,010 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:18:31,010 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-04-13 04:18:31,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-04-13 04:18:31,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-04-13 04:18:31,011 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=8742, Unknown=0, NotChecked=0, Total=8930 [2018-04-13 04:18:31,011 INFO L87 Difference]: Start difference. First operand 440 states and 441 transitions. Second operand 95 states. [2018-04-13 04:18:44,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:18:44,757 INFO L93 Difference]: Finished difference Result 447 states and 448 transitions. [2018-04-13 04:18:44,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-04-13 04:18:44,757 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 439 [2018-04-13 04:18:44,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:18:44,758 INFO L225 Difference]: With dead ends: 447 [2018-04-13 04:18:44,758 INFO L226 Difference]: Without dead ends: 447 [2018-04-13 04:18:44,759 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4178 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=568, Invalid=33842, Unknown=0, NotChecked=0, Total=34410 [2018-04-13 04:18:44,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-04-13 04:18:44,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 445. [2018-04-13 04:18:44,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-04-13 04:18:44,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 446 transitions. [2018-04-13 04:18:44,761 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 446 transitions. Word has length 439 [2018-04-13 04:18:44,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:18:44,761 INFO L459 AbstractCegarLoop]: Abstraction has 445 states and 446 transitions. [2018-04-13 04:18:44,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-04-13 04:18:44,761 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 446 transitions. [2018-04-13 04:18:44,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2018-04-13 04:18:44,763 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:18:44,763 INFO L355 BasicCegarLoop]: trace histogram [86, 86, 85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:18:44,763 INFO L408 AbstractCegarLoop]: === Iteration 101 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:18:44,763 INFO L82 PathProgramCache]: Analyzing trace with hash -433237757, now seen corresponding path program 85 times [2018-04-13 04:18:44,763 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:18:44,763 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:18:44,763 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:18:44,763 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:18:44,764 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:18:44,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:18:44,949 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:18:44,977 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:18:44,977 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:18:44,992 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:18:44,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:18:46,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:18:46,760 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:18:46,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:18:46,763 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:18:46,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:18:46,767 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:18:46,770 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-13 04:18:46,770 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:18:46,787 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:18:46,787 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:18:46,787 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-13 04:18:46,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:18:46,792 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-13 04:18:46,792 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:18:46,796 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-13 04:18:46,796 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:18:51,187 INFO L134 CoverageAnalysis]: Checked inductivity of 18105 backedges. 0 proven. 18105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:18:51,187 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:18:51,187 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-04-13 04:18:51,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-04-13 04:18:51,187 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-04-13 04:18:51,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=9119, Unknown=0, NotChecked=0, Total=9312 [2018-04-13 04:18:51,188 INFO L87 Difference]: Start difference. First operand 445 states and 446 transitions. Second operand 97 states. [2018-04-13 04:19:04,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:19:04,956 INFO L93 Difference]: Finished difference Result 452 states and 453 transitions. [2018-04-13 04:19:04,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-04-13 04:19:04,957 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 444 [2018-04-13 04:19:04,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:19:04,958 INFO L225 Difference]: With dead ends: 452 [2018-04-13 04:19:04,958 INFO L226 Difference]: Without dead ends: 452 [2018-04-13 04:19:04,959 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4540 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=583, Invalid=35327, Unknown=0, NotChecked=0, Total=35910 [2018-04-13 04:19:04,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2018-04-13 04:19:04,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 450. [2018-04-13 04:19:04,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2018-04-13 04:19:04,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 451 transitions. [2018-04-13 04:19:04,961 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 451 transitions. Word has length 444 [2018-04-13 04:19:04,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:19:04,961 INFO L459 AbstractCegarLoop]: Abstraction has 450 states and 451 transitions. [2018-04-13 04:19:04,961 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-04-13 04:19:04,961 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 451 transitions. [2018-04-13 04:19:04,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2018-04-13 04:19:04,962 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:19:04,962 INFO L355 BasicCegarLoop]: trace histogram [87, 87, 86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:19:04,962 INFO L408 AbstractCegarLoop]: === Iteration 102 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:19:04,963 INFO L82 PathProgramCache]: Analyzing trace with hash 690647464, now seen corresponding path program 86 times [2018-04-13 04:19:04,963 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:19:04,963 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:19:04,963 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:19:04,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-13 04:19:04,963 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:19:05,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:19:05,140 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:19:05,157 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:19:05,157 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:19:05,157 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:19:05,157 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-13 04:19:08,505 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-13 04:19:08,505 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:19:08,663 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:19:08,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:19:08,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:19:08,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:19:08,668 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-13 04:19:08,679 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-13 04:19:08,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-13 04:19:08,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-13 04:19:08,684 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-04-13 04:19:12,537 INFO L134 CoverageAnalysis]: Checked inductivity of 18533 backedges. 0 proven. 18533 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:19:12,538 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:19:12,538 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-04-13 04:19:12,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-04-13 04:19:12,538 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-04-13 04:19:12,539 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=9311, Unknown=0, NotChecked=0, Total=9506 [2018-04-13 04:19:12,539 INFO L87 Difference]: Start difference. First operand 450 states and 451 transitions. Second operand 98 states. [2018-04-13 04:19:25,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:19:25,493 INFO L93 Difference]: Finished difference Result 457 states and 458 transitions. [2018-04-13 04:19:25,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-04-13 04:19:25,493 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 449 [2018-04-13 04:19:25,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:19:25,494 INFO L225 Difference]: With dead ends: 457 [2018-04-13 04:19:25,494 INFO L226 Difference]: Without dead ends: 457 [2018-04-13 04:19:25,495 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 542 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4637 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=589, Invalid=36083, Unknown=0, NotChecked=0, Total=36672 [2018-04-13 04:19:25,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-04-13 04:19:25,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 455. [2018-04-13 04:19:25,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2018-04-13 04:19:25,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 456 transitions. [2018-04-13 04:19:25,497 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 456 transitions. Word has length 449 [2018-04-13 04:19:25,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:19:25,498 INFO L459 AbstractCegarLoop]: Abstraction has 455 states and 456 transitions. [2018-04-13 04:19:25,498 INFO L460 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-04-13 04:19:25,498 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 456 transitions. [2018-04-13 04:19:25,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2018-04-13 04:19:25,499 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:19:25,499 INFO L355 BasicCegarLoop]: trace histogram [88, 88, 87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:19:25,499 INFO L408 AbstractCegarLoop]: === Iteration 103 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:19:25,499 INFO L82 PathProgramCache]: Analyzing trace with hash -252645341, now seen corresponding path program 87 times [2018-04-13 04:19:25,499 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:19:25,499 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:19:25,500 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:19:25,500 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:19:25,500 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:19:25,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:19:25,658 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:19:25,674 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:19:25,674 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:19:25,674 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:19:25,674 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-13 04:19:30,533 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 88 check-sat command(s) [2018-04-13 04:19:30,533 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:19:30,950 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:19:30,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:19:30,953 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:19:30,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-13 04:19:30,957 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:19:30,961 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-13 04:19:30,961 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:19:30,979 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:19:30,979 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:19:30,980 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-13 04:19:30,980 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:19:30,985 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-13 04:19:30,985 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:19:30,988 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-13 04:19:30,989 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:19:35,642 INFO L134 CoverageAnalysis]: Checked inductivity of 18966 backedges. 0 proven. 18966 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:19:35,643 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:19:35,643 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-04-13 04:19:35,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-04-13 04:19:35,643 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-04-13 04:19:35,644 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=9505, Unknown=0, NotChecked=0, Total=9702 [2018-04-13 04:19:35,644 INFO L87 Difference]: Start difference. First operand 455 states and 456 transitions. Second operand 99 states. [2018-04-13 04:19:49,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:19:49,576 INFO L93 Difference]: Finished difference Result 462 states and 463 transitions. [2018-04-13 04:19:49,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-04-13 04:19:49,576 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 454 [2018-04-13 04:19:49,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:19:49,577 INFO L225 Difference]: With dead ends: 462 [2018-04-13 04:19:49,577 INFO L226 Difference]: Without dead ends: 462 [2018-04-13 04:19:49,578 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 548 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4733 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=595, Invalid=36847, Unknown=0, NotChecked=0, Total=37442 [2018-04-13 04:19:49,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2018-04-13 04:19:49,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 460. [2018-04-13 04:19:49,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-04-13 04:19:49,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 461 transitions. [2018-04-13 04:19:49,580 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 461 transitions. Word has length 454 [2018-04-13 04:19:49,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:19:49,581 INFO L459 AbstractCegarLoop]: Abstraction has 460 states and 461 transitions. [2018-04-13 04:19:49,581 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-04-13 04:19:49,581 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 461 transitions. [2018-04-13 04:19:49,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2018-04-13 04:19:49,582 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:19:49,582 INFO L355 BasicCegarLoop]: trace histogram [89, 89, 88, 88, 88, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:19:49,582 INFO L408 AbstractCegarLoop]: === Iteration 104 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:19:49,582 INFO L82 PathProgramCache]: Analyzing trace with hash -378714488, now seen corresponding path program 88 times [2018-04-13 04:19:49,582 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:19:49,582 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:19:49,582 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:19:49,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:19:49,582 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:19:49,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:19:49,777 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:19:49,807 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:19:49,807 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:19:49,807 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:19:49,808 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-13 04:19:51,597 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-13 04:19:51,597 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-13 04:19:51,749 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-13 04:19:51,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-13 04:19:51,752 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:19:51,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-13 04:19:51,756 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:19:51,759 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-13 04:19:51,760 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-13 04:19:51,771 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:19:51,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-13 04:19:51,772 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-13 04:19:51,778 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:19:51,778 INFO L700 Elim1Store]: detected not equals via solver [2018-04-13 04:19:51,778 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-13 04:19:51,778 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-13 04:19:51,783 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-13 04:19:51,783 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-13 04:19:56,519 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 19404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-13 04:19:56,519 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-13 04:19:56,520 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-04-13 04:19:56,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-04-13 04:19:56,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-04-13 04:19:56,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=9701, Unknown=0, NotChecked=0, Total=9900 [2018-04-13 04:19:56,520 INFO L87 Difference]: Start difference. First operand 460 states and 461 transitions. Second operand 100 states. [2018-04-13 04:20:11,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-13 04:20:11,267 INFO L93 Difference]: Finished difference Result 467 states and 468 transitions. [2018-04-13 04:20:11,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-04-13 04:20:11,267 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 459 [2018-04-13 04:20:11,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-13 04:20:11,268 INFO L225 Difference]: With dead ends: 467 [2018-04-13 04:20:11,268 INFO L226 Difference]: Without dead ends: 467 [2018-04-13 04:20:11,269 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 360 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4838 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=601, Invalid=37619, Unknown=0, NotChecked=0, Total=38220 [2018-04-13 04:20:11,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2018-04-13 04:20:11,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 465. [2018-04-13 04:20:11,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2018-04-13 04:20:11,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 466 transitions. [2018-04-13 04:20:11,272 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 466 transitions. Word has length 459 [2018-04-13 04:20:11,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-13 04:20:11,273 INFO L459 AbstractCegarLoop]: Abstraction has 465 states and 466 transitions. [2018-04-13 04:20:11,273 INFO L460 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-04-13 04:20:11,273 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 466 transitions. [2018-04-13 04:20:11,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2018-04-13 04:20:11,275 INFO L347 BasicCegarLoop]: Found error trace [2018-04-13 04:20:11,275 INFO L355 BasicCegarLoop]: trace histogram [90, 90, 89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-13 04:20:11,275 INFO L408 AbstractCegarLoop]: === Iteration 105 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-13 04:20:11,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1267738435, now seen corresponding path program 89 times [2018-04-13 04:20:11,276 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-13 04:20:11,276 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-13 04:20:11,276 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:20:11,276 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-13 04:20:11,276 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-13 04:20:11,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-13 04:20:11,469 WARN L250 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-13 04:20:11,500 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-13 04:20:11,500 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-13 04:20:11,500 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-13 04:20:11,500 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 Received shutdown request... [2018-04-13 04:20:12,447 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 90 check-sat command(s) [2018-04-13 04:20:12,447 INFO L243 tOrderPrioritization]: Conjunction of SSA is unknown [2018-04-13 04:20:12,473 INFO L293 seRefinementStrategy]: Strategy SmtInterpolRefinementStrategy was unsuccessful and could not determine trace feasibility. [2018-04-13 04:20:12,473 INFO L421 BasicCegarLoop]: Counterexample might be feasible [2018-04-13 04:20:12,504 WARN L200 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-04-13 04:20:12,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 04:20:12 BoogieIcfgContainer [2018-04-13 04:20:12,505 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-13 04:20:12,506 INFO L168 Benchmark]: Toolchain (without parser) took 775093.11 ms. Allocated memory was 395.8 MB in the beginning and 2.7 GB in the end (delta: 2.3 GB). Free memory was 331.9 MB in the beginning and 799.8 MB in the end (delta: -467.9 MB). Peak memory consumption was 1.8 GB. Max. memory is 5.3 GB. [2018-04-13 04:20:12,507 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 395.8 MB. Free memory is still 359.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-13 04:20:12,507 INFO L168 Benchmark]: CACSL2BoogieTranslator took 229.06 ms. Allocated memory is still 395.8 MB. Free memory was 330.6 MB in the beginning and 306.8 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. [2018-04-13 04:20:12,507 INFO L168 Benchmark]: Boogie Preprocessor took 38.79 ms. Allocated memory is still 395.8 MB. Free memory was 306.8 MB in the beginning and 305.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-04-13 04:20:12,507 INFO L168 Benchmark]: RCFGBuilder took 365.67 ms. Allocated memory was 395.8 MB in the beginning and 604.0 MB in the end (delta: 208.1 MB). Free memory was 305.5 MB in the beginning and 541.0 MB in the end (delta: -235.5 MB). Peak memory consumption was 24.1 MB. Max. memory is 5.3 GB. [2018-04-13 04:20:12,508 INFO L168 Benchmark]: TraceAbstraction took 774456.94 ms. Allocated memory was 604.0 MB in the beginning and 2.7 GB in the end (delta: 2.1 GB). Free memory was 541.0 MB in the beginning and 799.8 MB in the end (delta: -258.8 MB). Peak memory consumption was 1.8 GB. Max. memory is 5.3 GB. [2018-04-13 04:20:12,509 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.13 ms. Allocated memory is still 395.8 MB. Free memory is still 359.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 229.06 ms. Allocated memory is still 395.8 MB. Free memory was 330.6 MB in the beginning and 306.8 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.79 ms. Allocated memory is still 395.8 MB. Free memory was 306.8 MB in the beginning and 305.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 365.67 ms. Allocated memory was 395.8 MB in the beginning and 604.0 MB in the end (delta: 208.1 MB). Free memory was 305.5 MB in the beginning and 541.0 MB in the end (delta: -235.5 MB). Peak memory consumption was 24.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 774456.94 ms. Allocated memory was 604.0 MB in the beginning and 2.7 GB in the end (delta: 2.1 GB). Free memory was 541.0 MB in the beginning and 799.8 MB in the end (delta: -258.8 MB). Peak memory consumption was 1.8 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 542]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L546] int length1 = __VERIFIER_nondet_int(); [L547] int length2 = __VERIFIER_nondet_int(); [L548] COND FALSE !(length1 < 1) [L551] COND FALSE !(length2 < 1) [L554] COND FALSE !(length1 < length2) [L555] EXPR, FCALL __builtin_alloca (length1 * sizeof(char)) [L555] char* nondetArea = (char*) __builtin_alloca (length1 * sizeof(char)); [L556] EXPR, FCALL __builtin_alloca (length2 * sizeof(char)) [L556] char* nondetString = (char*) __builtin_alloca (length2 * sizeof(char)); [L557] FCALL nondetString[length2-1] = '\0' [L558] CALL cstpcpy(nondetArea,nondetString) [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] EXPR, FCALL *to = *from [L542] COND TRUE (*to = *from) != '\0' [L542] ++from [L542] ++from [L542] ++to [L542] ++to [L542] EXPR, FCALL \read(*from) [L542] FCALL *to = *from - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 46 locations, 7 error locations. UNKNOWN Result, 774.4s OverallTime, 105 OverallIterations, 90 TraceHistogramMax, 477.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9409 SDtfs, 18962 SDslu, 566608 SDs, 0 SdLazy, 830688 SolverSat, 4453 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 258.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 26094 GetRequests, 16559 SyntacticMatches, 5 SemanticMatches, 9530 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 154213 ImplicationChecksByTransitivity, 322.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=465occurred in iteration=104, 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, 104 MinimizatonAttempts, 271 StatesRemovedByMinimization, 98 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 125.3s SatisfiabilityAnalysisTime, 169.7s InterpolantComputationTime, 44041 NumberOfCodeBlocks, 44025 NumberOfCodeBlocksAsserted, 2237 NumberOfCheckSat, 21528 ConstructedInterpolants, 106 QuantifiedInterpolants, 114425838 SizeOfPredicates, 1086 NumberOfNonLiveVariables, 91248 ConjunctsInSsa, 27482 ConjunctsInUnsatCore, 105 InterpolantComputations, 11 PerfectInterpolantSequences, 26/579702 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-13_04-20-12-516.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-13_04-20-12-516.csv Completed graceful shutdown