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_cstrlcpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 15:19:18,362 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 15:19:18,363 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 15:19:18,375 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 15:19:18,376 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 15:19:18,376 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 15:19:18,377 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 15:19:18,379 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 15:19:18,381 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 15:19:18,381 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 15:19:18,382 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 15:19:18,382 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 15:19:18,383 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 15:19:18,384 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 15:19:18,385 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 15:19:18,386 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 15:19:18,388 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 15:19:18,389 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 15:19:18,390 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 15:19:18,391 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 15:19:18,393 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 15:19:18,393 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 15:19:18,393 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 15:19:18,394 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 15:19:18,395 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 15:19:18,396 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 15:19:18,396 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 15:19:18,396 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 15:19:18,397 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 15:19:18,397 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 15:19:18,398 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 15:19:18,398 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-04-11 15:19:18,418 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 15:19:18,418 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 15:19:18,419 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 15:19:18,419 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 15:19:18,419 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 15:19:18,419 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 15:19:18,419 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 15:19:18,420 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 15:19:18,420 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 15:19:18,420 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 15:19:18,420 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 15:19:18,420 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 15:19:18,420 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 15:19:18,420 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 15:19:18,420 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 15:19:18,420 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 15:19:18,420 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 15:19:18,421 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 15:19:18,421 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 15:19:18,421 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 15:19:18,421 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 15:19:18,421 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 15:19:18,421 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 15:19:18,421 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-11 15:19:18,448 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 15:19:18,456 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 15:19:18,458 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 15:19:18,460 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 15:19:18,460 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 15:19:18,461 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,791 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG9b1609c29 [2018-04-11 15:19:18,923 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 15:19:18,923 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 15:19:18,923 INFO L168 CDTParser]: Scanning openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,930 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 15:19:18,930 INFO L215 ultiparseSymbolTable]: [2018-04-11 15:19:18,930 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 15:19:18,930 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____bswap_64 ('__bswap_64') in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,930 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpy ('cstrlcpy') in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,930 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____bswap_32 ('__bswap_32') in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,931 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,931 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 15:19:18,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____ssize_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____mode_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__fsfilcnt_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____intptr_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____socklen_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__pid_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__int32_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__ino_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____fsfilcnt64_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____timer_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__size_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__key_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____nlink_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__off_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____int8_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__timer_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,932 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__caddr_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,932 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__mode_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,932 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__div_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,932 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____u_short in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,932 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____uint64_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,932 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__gid_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,932 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____blkcnt64_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,932 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____uid_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,932 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____fsword_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,932 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__ssize_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,932 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__u_short in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,932 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____qaddr_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,932 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____dev_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,932 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____fsblkcnt_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,932 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____int64_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,932 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____useconds_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,932 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__id_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,932 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__pthread_condattr_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,933 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____blksize_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,933 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____caddr_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,933 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__fd_set in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,933 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____u_int in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,933 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__dev_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,933 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__time_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,933 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__pthread_rwlock_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,933 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__pthread_key_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,933 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__fsid_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,933 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__register_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,933 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____clock_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,933 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____daddr_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,933 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__pthread_barrierattr_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,933 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__int64_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,933 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__pthread_mutex_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,933 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__u_quad_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,933 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__ushort in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,933 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__ldiv_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,933 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____rlim64_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,934 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____fsfilcnt_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,934 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__u_int64_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,934 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____key_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,934 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____uint8_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,934 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__loff_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,934 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____time_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,934 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__int8_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,934 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____quad_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,934 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____off_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,934 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____fsid_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,934 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__u_long in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,934 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__clock_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,934 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__pthread_barrier_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,934 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____uint16_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,934 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____gid_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,934 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____WAIT_STATUS in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,934 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____syscall_slong_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,935 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__pthread_cond_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,935 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__u_char in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,935 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____loff_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,935 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__daddr_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,935 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__quad_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,935 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__blkcnt_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,935 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__sigset_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,935 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__u_int16_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,935 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____blkcnt_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,935 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__ulong in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,935 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__suseconds_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,935 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____u_long in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,935 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____int16_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,935 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__fd_mask in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,935 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__pthread_spinlock_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,935 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__pthread_rwlockattr_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,935 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____ino_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,936 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____sigset_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,936 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__uint in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,936 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____ino64_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,936 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____fd_mask in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,936 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__nlink_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,936 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__blksize_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,936 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__lldiv_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,936 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____id_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,936 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__pthread_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,936 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____syscall_ulong_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,936 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__int16_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,936 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____uint32_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,936 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__pthread_attr_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,936 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__wchar_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,936 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__u_int8_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,936 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__pthread_once_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,936 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____sig_atomic_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,936 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__uid_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,937 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____clockid_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,937 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__clockid_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,937 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__u_int32_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,937 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__u_int in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,937 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____int32_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,937 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____pthread_list_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,937 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__fsblkcnt_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,937 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____rlim_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,937 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____pid_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,937 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____u_quad_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,937 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__pthread_mutexattr_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,937 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____fsblkcnt64_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,937 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____u_char in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,937 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____off64_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,937 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____suseconds_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:18,952 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG9b1609c29 [2018-04-11 15:19:18,955 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 15:19:18,957 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 15:19:18,957 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 15:19:18,957 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 15:19:18,962 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 15:19:18,962 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 03:19:18" (1/1) ... [2018-04-11 15:19:18,964 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39cb06ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:19:18, skipping insertion in model container [2018-04-11 15:19:18,964 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 03:19:18" (1/1) ... [2018-04-11 15:19:18,980 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 15:19:19,002 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 15:19:19,118 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 15:19:19,151 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 15:19:19,157 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-11 15:19:19,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:19:19 WrapperNode [2018-04-11 15:19:19,191 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 15:19:19,191 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 15:19:19,192 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 15:19:19,192 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 15:19:19,203 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:19:19" (1/1) ... [2018-04-11 15:19:19,203 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:19:19" (1/1) ... [2018-04-11 15:19:19,215 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:19:19" (1/1) ... [2018-04-11 15:19:19,215 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:19:19" (1/1) ... [2018-04-11 15:19:19,223 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:19:19" (1/1) ... [2018-04-11 15:19:19,227 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:19:19" (1/1) ... [2018-04-11 15:19:19,230 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:19:19" (1/1) ... [2018-04-11 15:19:19,233 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 15:19:19,234 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 15:19:19,234 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 15:19:19,234 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 15:19:19,235 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:19:19" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 15:19:19,330 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 15:19:19,330 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 15:19:19,331 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-11 15:19:19,331 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-11 15:19:19,331 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpy [2018-04-11 15:19:19,331 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 15:19:19,331 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-11 15:19:19,331 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-11 15:19:19,331 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 15:19:19,331 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 15:19:19,331 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 15:19:19,332 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 15:19:19,332 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 15:19:19,332 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 15:19:19,332 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 15:19:19,332 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 15:19:19,332 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 15:19:19,332 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 15:19:19,332 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 15:19:19,332 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 15:19:19,333 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 15:19:19,333 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 15:19:19,333 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 15:19:19,333 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 15:19:19,333 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 15:19:19,333 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 15:19:19,333 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 15:19:19,333 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 15:19:19,333 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 15:19:19,334 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 15:19:19,334 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 15:19:19,334 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 15:19:19,334 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 15:19:19,334 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 15:19:19,334 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 15:19:19,334 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 15:19:19,334 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 15:19:19,335 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 15:19:19,335 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 15:19:19,335 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 15:19:19,335 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 15:19:19,335 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 15:19:19,335 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 15:19:19,335 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 15:19:19,335 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 15:19:19,335 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 15:19:19,336 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 15:19:19,336 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 15:19:19,336 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 15:19:19,336 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 15:19:19,336 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 15:19:19,336 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 15:19:19,336 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 15:19:19,336 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 15:19:19,336 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 15:19:19,336 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 15:19:19,337 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 15:19:19,337 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 15:19:19,337 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 15:19:19,337 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 15:19:19,337 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 15:19:19,337 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 15:19:19,337 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 15:19:19,337 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 15:19:19,337 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 15:19:19,337 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 15:19:19,338 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 15:19:19,338 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 15:19:19,338 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 15:19:19,338 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 15:19:19,338 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 15:19:19,338 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 15:19:19,338 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 15:19:19,338 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 15:19:19,338 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 15:19:19,338 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 15:19:19,339 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 15:19:19,339 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 15:19:19,339 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 15:19:19,339 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 15:19:19,339 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 15:19:19,339 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 15:19:19,339 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 15:19:19,339 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 15:19:19,339 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 15:19:19,339 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 15:19:19,340 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 15:19:19,340 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 15:19:19,340 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 15:19:19,340 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 15:19:19,340 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 15:19:19,340 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 15:19:19,340 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 15:19:19,340 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 15:19:19,340 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 15:19:19,340 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 15:19:19,341 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 15:19:19,341 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 15:19:19,341 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 15:19:19,341 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 15:19:19,341 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 15:19:19,341 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 15:19:19,341 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 15:19:19,341 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 15:19:19,341 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 15:19:19,341 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 15:19:19,342 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 15:19:19,342 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 15:19:19,342 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 15:19:19,342 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpy [2018-04-11 15:19:19,342 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 15:19:19,342 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 15:19:19,342 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 15:19:19,342 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 15:19:19,342 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 15:19:19,342 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 15:19:19,343 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 15:19:19,343 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 15:19:19,634 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 15:19:19,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 03:19:19 BoogieIcfgContainer [2018-04-11 15:19:19,635 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 15:19:19,635 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 15:19:19,635 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 15:19:19,638 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 15:19:19,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 03:19:18" (1/3) ... [2018-04-11 15:19:19,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57e13539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 03:19:19, skipping insertion in model container [2018-04-11 15:19:19,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:19:19" (2/3) ... [2018-04-11 15:19:19,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57e13539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 03:19:19, skipping insertion in model container [2018-04-11 15:19:19,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 03:19:19" (3/3) ... [2018-04-11 15:19:19,640 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:19,646 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 15:19:19,651 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-04-11 15:19:19,681 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 15:19:19,681 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 15:19:19,682 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 15:19:19,682 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 15:19:19,682 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 15:19:19,682 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 15:19:19,682 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 15:19:19,682 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 15:19:19,682 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 15:19:19,683 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 15:19:19,693 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-04-11 15:19:19,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-11 15:19:19,698 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:19:19,699 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:19:19,699 INFO L408 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:19:19,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1063371436, now seen corresponding path program 1 times [2018-04-11 15:19:19,703 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:19:19,703 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:19:19,732 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:19,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:19:19,733 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:19,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:19,779 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:19:19,794 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:19:19,794 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:19:19,794 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:19:19,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:19:19,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:19,829 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:19:19,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:19:19,865 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:19,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:19,869 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 15:19:19,886 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:19,887 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:19,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 15:19:19,889 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:19,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:19:19,896 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-04-11 15:19:19,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:19:19,909 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:19:19,910 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 15:19:19,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:19:19,920 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:19:19,920 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:19:19,922 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 5 states. [2018-04-11 15:19:20,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:19:20,034 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-04-11 15:19:20,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 15:19:20,036 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-04-11 15:19:20,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:19:20,042 INFO L225 Difference]: With dead ends: 54 [2018-04-11 15:19:20,042 INFO L226 Difference]: Without dead ends: 51 [2018-04-11 15:19:20,043 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-04-11 15:19:20,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-04-11 15:19:20,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-04-11 15:19:20,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-04-11 15:19:20,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2018-04-11 15:19:20,070 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 13 [2018-04-11 15:19:20,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:19:20,070 INFO L459 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2018-04-11 15:19:20,070 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:19:20,070 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-04-11 15:19:20,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-11 15:19:20,071 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:19:20,071 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:19:20,071 INFO L408 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:19:20,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1063371435, now seen corresponding path program 1 times [2018-04-11 15:19:20,071 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:19:20,071 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:19:20,072 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:20,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:19:20,072 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:20,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:20,087 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:19:20,092 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:19:20,092 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:19:20,092 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:19:20,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:19:20,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:20,120 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:19:20,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 6 treesize of output 5 [2018-04-11 15:19:20,127 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:20,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:19:20,133 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:20,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:20,139 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:19:20,156 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:20,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:19:20,158 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:20,183 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:20,183 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:20,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:19:20,184 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:20,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:20,193 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:19:20,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:19:20,214 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:19:20,214 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 15:19:20,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 15:19:20,215 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 15:19:20,215 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:19:20,216 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 6 states. [2018-04-11 15:19:20,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:19:20,299 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2018-04-11 15:19:20,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:19:20,300 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-04-11 15:19:20,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:19:20,300 INFO L225 Difference]: With dead ends: 50 [2018-04-11 15:19:20,301 INFO L226 Difference]: Without dead ends: 50 [2018-04-11 15:19:20,301 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-04-11 15:19:20,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-04-11 15:19:20,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-04-11 15:19:20,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-04-11 15:19:20,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-04-11 15:19:20,305 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 13 [2018-04-11 15:19:20,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:19:20,306 INFO L459 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-04-11 15:19:20,306 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 15:19:20,306 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-04-11 15:19:20,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-11 15:19:20,306 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:19:20,306 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:19:20,306 INFO L408 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:19:20,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1395223911, now seen corresponding path program 1 times [2018-04-11 15:19:20,307 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:19:20,307 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:19:20,308 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:20,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:19:20,308 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:20,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:20,316 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:19:20,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:19:20,340 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:19:20,340 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:19:20,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 15:19:20,340 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 15:19:20,340 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:19:20,341 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 4 states. [2018-04-11 15:19:20,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:19:20,389 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2018-04-11 15:19:20,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 15:19:20,389 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-04-11 15:19:20,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:19:20,390 INFO L225 Difference]: With dead ends: 49 [2018-04-11 15:19:20,390 INFO L226 Difference]: Without dead ends: 49 [2018-04-11 15:19:20,390 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:19:20,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-04-11 15:19:20,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-04-11 15:19:20,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-04-11 15:19:20,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2018-04-11 15:19:20,394 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 14 [2018-04-11 15:19:20,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:19:20,394 INFO L459 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2018-04-11 15:19:20,395 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 15:19:20,395 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2018-04-11 15:19:20,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-11 15:19:20,395 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:19:20,395 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:19:20,396 INFO L408 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:19:20,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1395223912, now seen corresponding path program 1 times [2018-04-11 15:19:20,396 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:19:20,396 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:19:20,397 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:20,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:19:20,397 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:20,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:20,408 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:19:20,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:19:20,449 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:19:20,449 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 15:19:20,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:19:20,449 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:19:20,450 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:19:20,450 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand 5 states. [2018-04-11 15:19:20,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:19:20,472 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2018-04-11 15:19:20,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:19:20,472 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-04-11 15:19:20,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:19:20,473 INFO L225 Difference]: With dead ends: 48 [2018-04-11 15:19:20,473 INFO L226 Difference]: Without dead ends: 48 [2018-04-11 15:19:20,473 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:19:20,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-04-11 15:19:20,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-04-11 15:19:20,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-04-11 15:19:20,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2018-04-11 15:19:20,476 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 14 [2018-04-11 15:19:20,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:19:20,476 INFO L459 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2018-04-11 15:19:20,476 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:19:20,476 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2018-04-11 15:19:20,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-11 15:19:20,476 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:19:20,476 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:19:20,476 INFO L408 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:19:20,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1589078277, now seen corresponding path program 1 times [2018-04-11 15:19:20,476 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:19:20,477 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:19:20,477 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:20,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:19:20,477 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:20,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:20,490 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:19:20,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-11 15:19:20,523 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:19:20,523 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 15:19:20,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:19:20,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:19:20,524 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:19:20,524 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand 5 states. [2018-04-11 15:19:20,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:19:20,558 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2018-04-11 15:19:20,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 15:19:20,559 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-04-11 15:19:20,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:19:20,560 INFO L225 Difference]: With dead ends: 47 [2018-04-11 15:19:20,560 INFO L226 Difference]: Without dead ends: 47 [2018-04-11 15:19:20,560 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-11 15:19:20,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-04-11 15:19:20,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-04-11 15:19:20,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-04-11 15:19:20,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2018-04-11 15:19:20,562 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 20 [2018-04-11 15:19:20,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:19:20,563 INFO L459 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2018-04-11 15:19:20,563 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:19:20,563 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2018-04-11 15:19:20,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-11 15:19:20,563 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:19:20,563 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:19:20,563 INFO L408 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:19:20,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1589078278, now seen corresponding path program 1 times [2018-04-11 15:19:20,563 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:19:20,563 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:19:20,564 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:20,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:19:20,564 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:20,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:20,576 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:19:20,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:19:20,673 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:19:20,673 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 15:19:20,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 15:19:20,674 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 15:19:20,674 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-11 15:19:20,674 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand 8 states. [2018-04-11 15:19:20,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:19:20,778 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2018-04-11 15:19:20,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 15:19:20,778 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-04-11 15:19:20,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:19:20,780 INFO L225 Difference]: With dead ends: 62 [2018-04-11 15:19:20,780 INFO L226 Difference]: Without dead ends: 62 [2018-04-11 15:19:20,781 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-04-11 15:19:20,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-04-11 15:19:20,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 53. [2018-04-11 15:19:20,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-04-11 15:19:20,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2018-04-11 15:19:20,783 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 20 [2018-04-11 15:19:20,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:19:20,784 INFO L459 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-04-11 15:19:20,784 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 15:19:20,784 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2018-04-11 15:19:20,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-11 15:19:20,784 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:19:20,784 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] [2018-04-11 15:19:20,784 INFO L408 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:19:20,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1991019242, now seen corresponding path program 1 times [2018-04-11 15:19:20,784 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:19:20,784 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:19:20,785 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:20,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:19:20,785 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:20,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:20,795 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:19:20,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:19:20,856 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:19:20,856 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 15:19:20,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 15:19:20,856 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 15:19:20,856 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:19:20,856 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 6 states. [2018-04-11 15:19:20,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:19:20,911 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2018-04-11 15:19:20,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:19:20,912 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-04-11 15:19:20,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:19:20,913 INFO L225 Difference]: With dead ends: 52 [2018-04-11 15:19:20,913 INFO L226 Difference]: Without dead ends: 52 [2018-04-11 15:19:20,913 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-04-11 15:19:20,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-04-11 15:19:20,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-04-11 15:19:20,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-04-11 15:19:20,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2018-04-11 15:19:20,916 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 21 [2018-04-11 15:19:20,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:19:20,916 INFO L459 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2018-04-11 15:19:20,916 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 15:19:20,916 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2018-04-11 15:19:20,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-11 15:19:20,916 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:19:20,917 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] [2018-04-11 15:19:20,917 INFO L408 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:19:20,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1991019243, now seen corresponding path program 1 times [2018-04-11 15:19:20,917 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:19:20,917 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:19:20,917 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:20,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:19:20,917 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:20,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:20,925 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:19:20,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:19:20,992 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:19:20,992 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 15:19:20,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 15:19:20,993 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 15:19:20,993 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-04-11 15:19:20,993 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand 9 states. [2018-04-11 15:19:21,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:19:21,108 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2018-04-11 15:19:21,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 15:19:21,108 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-04-11 15:19:21,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:19:21,109 INFO L225 Difference]: With dead ends: 62 [2018-04-11 15:19:21,109 INFO L226 Difference]: Without dead ends: 62 [2018-04-11 15:19:21,109 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-04-11 15:19:21,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-04-11 15:19:21,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 53. [2018-04-11 15:19:21,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-04-11 15:19:21,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2018-04-11 15:19:21,112 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 21 [2018-04-11 15:19:21,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:19:21,113 INFO L459 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-04-11 15:19:21,113 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 15:19:21,113 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2018-04-11 15:19:21,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-11 15:19:21,113 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:19:21,113 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:19:21,115 INFO L408 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:19:21,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1903975895, now seen corresponding path program 1 times [2018-04-11 15:19:21,115 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:19:21,115 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:19:21,116 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:21,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:19:21,116 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:21,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:21,124 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:19:21,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:19:21,160 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:19:21,160 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 15:19:21,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 15:19:21,161 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 15:19:21,161 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:19:21,161 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 6 states. [2018-04-11 15:19:21,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:19:21,204 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2018-04-11 15:19:21,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:19:21,204 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-04-11 15:19:21,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:19:21,205 INFO L225 Difference]: With dead ends: 52 [2018-04-11 15:19:21,205 INFO L226 Difference]: Without dead ends: 52 [2018-04-11 15:19:21,205 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-04-11 15:19:21,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-04-11 15:19:21,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-04-11 15:19:21,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-04-11 15:19:21,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2018-04-11 15:19:21,208 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 22 [2018-04-11 15:19:21,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:19:21,208 INFO L459 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2018-04-11 15:19:21,208 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 15:19:21,209 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2018-04-11 15:19:21,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-11 15:19:21,209 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:19:21,209 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:19:21,209 INFO L408 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:19:21,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1903975894, now seen corresponding path program 1 times [2018-04-11 15:19:21,209 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:19:21,210 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:19:21,210 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:21,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:19:21,211 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:21,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:21,219 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:19:21,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:19:21,272 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:19:21,272 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 15:19:21,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 15:19:21,272 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 15:19:21,272 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-04-11 15:19:21,272 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand 9 states. [2018-04-11 15:19:21,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:19:21,369 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2018-04-11 15:19:21,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 15:19:21,370 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-04-11 15:19:21,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:19:21,370 INFO L225 Difference]: With dead ends: 59 [2018-04-11 15:19:21,370 INFO L226 Difference]: Without dead ends: 59 [2018-04-11 15:19:21,371 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-04-11 15:19:21,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-04-11 15:19:21,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2018-04-11 15:19:21,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-04-11 15:19:21,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2018-04-11 15:19:21,374 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 22 [2018-04-11 15:19:21,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:19:21,375 INFO L459 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2018-04-11 15:19:21,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 15:19:21,375 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2018-04-11 15:19:21,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-11 15:19:21,375 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:19:21,375 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:19:21,376 INFO L408 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:19:21,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1592054348, now seen corresponding path program 1 times [2018-04-11 15:19:21,376 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:19:21,376 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:19:21,376 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:21,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:19:21,376 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:21,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:21,383 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:19:21,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:19:21,440 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:19:21,440 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 15:19:21,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 15:19:21,441 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 15:19:21,441 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:19:21,441 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand 6 states. [2018-04-11 15:19:21,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:19:21,485 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2018-04-11 15:19:21,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:19:21,486 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-04-11 15:19:21,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:19:21,486 INFO L225 Difference]: With dead ends: 54 [2018-04-11 15:19:21,486 INFO L226 Difference]: Without dead ends: 54 [2018-04-11 15:19:21,486 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-04-11 15:19:21,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-04-11 15:19:21,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-04-11 15:19:21,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-04-11 15:19:21,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2018-04-11 15:19:21,489 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 22 [2018-04-11 15:19:21,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:19:21,490 INFO L459 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2018-04-11 15:19:21,490 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 15:19:21,490 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2018-04-11 15:19:21,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-04-11 15:19:21,490 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:19:21,490 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:19:21,491 INFO L408 AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:19:21,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1592054349, now seen corresponding path program 1 times [2018-04-11 15:19:21,491 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:19:21,491 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:19:21,491 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:21,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:19:21,492 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:21,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:21,498 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:19:21,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:19:21,562 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:19:21,563 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 15:19:21,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 15:19:21,563 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 15:19:21,563 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-11 15:19:21,563 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand 9 states. [2018-04-11 15:19:21,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:19:21,682 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2018-04-11 15:19:21,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 15:19:21,682 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-04-11 15:19:21,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:19:21,683 INFO L225 Difference]: With dead ends: 64 [2018-04-11 15:19:21,683 INFO L226 Difference]: Without dead ends: 64 [2018-04-11 15:19:21,683 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-04-11 15:19:21,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-04-11 15:19:21,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2018-04-11 15:19:21,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-04-11 15:19:21,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2018-04-11 15:19:21,686 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 22 [2018-04-11 15:19:21,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:19:21,691 INFO L459 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2018-04-11 15:19:21,691 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 15:19:21,691 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2018-04-11 15:19:21,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-11 15:19:21,692 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:19:21,692 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:19:21,692 INFO L408 AbstractCegarLoop]: === Iteration 13 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:19:21,692 INFO L82 PathProgramCache]: Analyzing trace with hash -2110691807, now seen corresponding path program 1 times [2018-04-11 15:19:21,692 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:19:21,692 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:19:21,693 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:21,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:19:21,693 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:21,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:21,720 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:19:21,770 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 15:19:21,770 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:19:21,770 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 15:19:21,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 15:19:21,771 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 15:19:21,771 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:19:21,771 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand 6 states. [2018-04-11 15:19:21,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:19:21,792 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-04-11 15:19:21,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:19:21,792 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-04-11 15:19:21,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:19:21,793 INFO L225 Difference]: With dead ends: 55 [2018-04-11 15:19:21,793 INFO L226 Difference]: Without dead ends: 55 [2018-04-11 15:19:21,793 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-04-11 15:19:21,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-04-11 15:19:21,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-04-11 15:19:21,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-04-11 15:19:21,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2018-04-11 15:19:21,795 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 26 [2018-04-11 15:19:21,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:19:21,796 INFO L459 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-04-11 15:19:21,796 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 15:19:21,796 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2018-04-11 15:19:21,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-11 15:19:21,796 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:19:21,796 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:19:21,796 INFO L408 AbstractCegarLoop]: === Iteration 14 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:19:21,797 INFO L82 PathProgramCache]: Analyzing trace with hash -531063271, now seen corresponding path program 1 times [2018-04-11 15:19:21,797 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:19:21,797 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:19:21,797 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:21,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:19:21,798 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:21,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:21,809 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:19:21,816 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:19:21,816 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:19:21,816 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:19:21,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:19:21,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:21,837 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:19:21,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:19:21,847 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:19:21,847 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 15:19:21,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 15:19:21,847 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 15:19:21,847 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:19:21,847 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 4 states. [2018-04-11 15:19:21,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:19:21,863 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2018-04-11 15:19:21,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 15:19:21,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-04-11 15:19:21,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:19:21,864 INFO L225 Difference]: With dead ends: 59 [2018-04-11 15:19:21,864 INFO L226 Difference]: Without dead ends: 59 [2018-04-11 15:19:21,864 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:19:21,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-04-11 15:19:21,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2018-04-11 15:19:21,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-04-11 15:19:21,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2018-04-11 15:19:21,867 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 26 [2018-04-11 15:19:21,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:19:21,867 INFO L459 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2018-04-11 15:19:21,867 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 15:19:21,867 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2018-04-11 15:19:21,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-11 15:19:21,868 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:19:21,868 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:19:21,868 INFO L408 AbstractCegarLoop]: === Iteration 15 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:19:21,868 INFO L82 PathProgramCache]: Analyzing trace with hash 867982438, now seen corresponding path program 1 times [2018-04-11 15:19:21,868 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:19:21,868 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:19:21,869 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:21,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:19:21,869 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:21,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:21,880 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:19:21,919 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 15:19:21,919 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:19:21,919 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 15:19:21,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 15:19:21,920 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 15:19:21,920 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:19:21,920 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand 6 states. [2018-04-11 15:19:21,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:19:21,947 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2018-04-11 15:19:21,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:19:21,947 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-04-11 15:19:21,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:19:21,947 INFO L225 Difference]: With dead ends: 56 [2018-04-11 15:19:21,947 INFO L226 Difference]: Without dead ends: 56 [2018-04-11 15:19:21,948 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-04-11 15:19:21,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-04-11 15:19:21,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-04-11 15:19:21,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-04-11 15:19:21,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2018-04-11 15:19:21,950 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 27 [2018-04-11 15:19:21,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:19:21,951 INFO L459 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2018-04-11 15:19:21,951 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 15:19:21,951 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2018-04-11 15:19:21,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-11 15:19:21,951 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:19:21,952 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:19:21,952 INFO L408 AbstractCegarLoop]: === Iteration 16 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:19:21,952 INFO L82 PathProgramCache]: Analyzing trace with hash 717922773, now seen corresponding path program 1 times [2018-04-11 15:19:21,952 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:19:21,952 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:19:21,953 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:21,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:19:21,953 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:21,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:21,965 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:19:22,037 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:19:22,037 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:19:22,037 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-11 15:19:22,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 15:19:22,038 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 15:19:22,038 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-04-11 15:19:22,038 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand 10 states. [2018-04-11 15:19:22,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:19:22,164 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2018-04-11 15:19:22,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 15:19:22,164 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-04-11 15:19:22,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:19:22,165 INFO L225 Difference]: With dead ends: 97 [2018-04-11 15:19:22,165 INFO L226 Difference]: Without dead ends: 97 [2018-04-11 15:19:22,165 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2018-04-11 15:19:22,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-04-11 15:19:22,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 86. [2018-04-11 15:19:22,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-04-11 15:19:22,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 98 transitions. [2018-04-11 15:19:22,168 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 98 transitions. Word has length 27 [2018-04-11 15:19:22,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:19:22,169 INFO L459 AbstractCegarLoop]: Abstraction has 86 states and 98 transitions. [2018-04-11 15:19:22,169 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 15:19:22,169 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 98 transitions. [2018-04-11 15:19:22,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-11 15:19:22,170 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:19:22,170 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:19:22,170 INFO L408 AbstractCegarLoop]: === Iteration 17 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:19:22,170 INFO L82 PathProgramCache]: Analyzing trace with hash 1140624599, now seen corresponding path program 1 times [2018-04-11 15:19:22,170 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:19:22,170 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:19:22,171 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:22,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:19:22,171 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:22,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:22,187 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:19:22,317 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:19:22,317 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:19:22,317 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:19:22,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:19:22,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:22,349 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:19:22,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:19:22,353 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:22,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:22,362 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 15:19:22,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 15:19:22,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:19:22,386 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:22,387 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:22,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:22,391 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-04-11 15:19:22,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-04-11 15:19:22,479 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-04-11 15:19:22,480 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:19:22,483 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:19:22,491 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-11 15:19:22,492 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:54 [2018-04-11 15:19:22,591 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:19:22,591 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:19:22,591 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2018-04-11 15:19:22,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 15:19:22,592 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 15:19:22,592 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2018-04-11 15:19:22,592 INFO L87 Difference]: Start difference. First operand 86 states and 98 transitions. Second operand 21 states. [2018-04-11 15:19:23,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:19:23,038 INFO L93 Difference]: Finished difference Result 127 states and 143 transitions. [2018-04-11 15:19:23,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 15:19:23,038 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 27 [2018-04-11 15:19:23,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:19:23,039 INFO L225 Difference]: With dead ends: 127 [2018-04-11 15:19:23,039 INFO L226 Difference]: Without dead ends: 127 [2018-04-11 15:19:23,039 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2018-04-11 15:19:23,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-04-11 15:19:23,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 91. [2018-04-11 15:19:23,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-04-11 15:19:23,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 105 transitions. [2018-04-11 15:19:23,043 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 105 transitions. Word has length 27 [2018-04-11 15:19:23,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:19:23,043 INFO L459 AbstractCegarLoop]: Abstraction has 91 states and 105 transitions. [2018-04-11 15:19:23,043 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 15:19:23,044 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 105 transitions. [2018-04-11 15:19:23,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 15:19:23,044 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:19:23,045 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:19:23,045 INFO L408 AbstractCegarLoop]: === Iteration 18 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:19:23,045 INFO L82 PathProgramCache]: Analyzing trace with hash 999624161, now seen corresponding path program 1 times [2018-04-11 15:19:23,045 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:19:23,045 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:19:23,046 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:23,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:19:23,046 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:23,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:23,056 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:19:23,064 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:19:23,065 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:19:23,065 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:19:23,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:19:23,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:23,088 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:19:23,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:19:23,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:23,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-11 15:19:23,097 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:23,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:23,101 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:19:23,118 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:23,119 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:23,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:19:23,119 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:23,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:19:23,127 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:23,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:23,133 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:19:23,244 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:19:23,244 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:19:23,244 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-11 15:19:23,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 15:19:23,244 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 15:19:23,244 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-04-11 15:19:23,244 INFO L87 Difference]: Start difference. First operand 91 states and 105 transitions. Second operand 13 states. [2018-04-11 15:19:23,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:19:23,527 INFO L93 Difference]: Finished difference Result 100 states and 115 transitions. [2018-04-11 15:19:23,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 15:19:23,528 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2018-04-11 15:19:23,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:19:23,528 INFO L225 Difference]: With dead ends: 100 [2018-04-11 15:19:23,528 INFO L226 Difference]: Without dead ends: 100 [2018-04-11 15:19:23,528 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2018-04-11 15:19:23,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-04-11 15:19:23,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 92. [2018-04-11 15:19:23,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-04-11 15:19:23,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 106 transitions. [2018-04-11 15:19:23,530 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 106 transitions. Word has length 28 [2018-04-11 15:19:23,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:19:23,530 INFO L459 AbstractCegarLoop]: Abstraction has 92 states and 106 transitions. [2018-04-11 15:19:23,530 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 15:19:23,530 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 106 transitions. [2018-04-11 15:19:23,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 15:19:23,531 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:19:23,531 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:19:23,531 INFO L408 AbstractCegarLoop]: === Iteration 19 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:19:23,531 INFO L82 PathProgramCache]: Analyzing trace with hash 923537165, now seen corresponding path program 1 times [2018-04-11 15:19:23,531 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:19:23,531 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:19:23,532 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:23,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:19:23,532 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:23,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:23,538 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:19:23,543 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:19:23,543 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:19:23,544 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:19:23,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:19:23,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:23,571 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:19:23,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:19:23,584 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:23,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:19:23,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:23,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:23,594 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:19:23,611 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:23,611 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:23,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:19:23,612 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:23,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:19:23,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:23,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:23,625 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:19:23,707 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:19:23,707 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:19:23,707 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-11 15:19:23,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 15:19:23,708 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 15:19:23,708 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2018-04-11 15:19:23,708 INFO L87 Difference]: Start difference. First operand 92 states and 106 transitions. Second operand 11 states. [2018-04-11 15:19:23,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:19:23,905 INFO L93 Difference]: Finished difference Result 107 states and 123 transitions. [2018-04-11 15:19:23,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 15:19:23,906 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-04-11 15:19:23,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:19:23,906 INFO L225 Difference]: With dead ends: 107 [2018-04-11 15:19:23,906 INFO L226 Difference]: Without dead ends: 107 [2018-04-11 15:19:23,907 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2018-04-11 15:19:23,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-04-11 15:19:23,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 95. [2018-04-11 15:19:23,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-04-11 15:19:23,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 110 transitions. [2018-04-11 15:19:23,910 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 110 transitions. Word has length 29 [2018-04-11 15:19:23,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:19:23,910 INFO L459 AbstractCegarLoop]: Abstraction has 95 states and 110 transitions. [2018-04-11 15:19:23,910 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 15:19:23,910 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 110 transitions. [2018-04-11 15:19:23,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 15:19:23,911 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:19:23,911 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:19:23,911 INFO L408 AbstractCegarLoop]: === Iteration 20 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:19:23,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1163118827, now seen corresponding path program 1 times [2018-04-11 15:19:23,911 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:19:23,911 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:19:23,912 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:23,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:19:23,912 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:23,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:23,920 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:19:23,923 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:19:23,923 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:19:23,923 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:19:23,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:19:23,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:23,944 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:19:23,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:19:23,951 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:23,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:23,954 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 15:19:23,967 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:23,968 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:23,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, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:19:23,969 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:23,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:23,974 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-04-11 15:19:23,997 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 14 treesize of output 11 [2018-04-11 15:19:23,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 15:19:23,999 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:24,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:24,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:19:24,018 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-04-11 15:19:24,077 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 22 treesize of output 23 [2018-04-11 15:19:24,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:19:24,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:24,083 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:24,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-11 15:19:24,092 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:40, output treesize:36 [2018-04-11 15:19:24,137 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2018-04-11 15:19:24,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 15:19:24,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:24,145 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:19:24,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2018-04-11 15:19:24,146 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:24,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:24,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:24,156 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:46, output treesize:3 [2018-04-11 15:19:24,168 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:19:24,168 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:19:24,168 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-04-11 15:19:24,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 15:19:24,168 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 15:19:24,168 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-04-11 15:19:24,168 INFO L87 Difference]: Start difference. First operand 95 states and 110 transitions. Second operand 13 states. [2018-04-11 15:19:24,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:19:24,519 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2018-04-11 15:19:24,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 15:19:24,519 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-04-11 15:19:24,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:19:24,520 INFO L225 Difference]: With dead ends: 112 [2018-04-11 15:19:24,520 INFO L226 Difference]: Without dead ends: 112 [2018-04-11 15:19:24,520 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=451, Unknown=0, NotChecked=0, Total=552 [2018-04-11 15:19:24,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-04-11 15:19:24,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 92. [2018-04-11 15:19:24,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-04-11 15:19:24,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2018-04-11 15:19:24,522 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 30 [2018-04-11 15:19:24,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:19:24,522 INFO L459 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2018-04-11 15:19:24,523 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 15:19:24,523 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2018-04-11 15:19:24,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 15:19:24,523 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:19:24,523 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:19:24,523 INFO L408 AbstractCegarLoop]: === Iteration 21 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:19:24,523 INFO L82 PathProgramCache]: Analyzing trace with hash -321005100, now seen corresponding path program 1 times [2018-04-11 15:19:24,523 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:19:24,524 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:19:24,524 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:24,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:19:24,524 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:24,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:24,530 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:19:24,532 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:19:24,532 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:19:24,532 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:19:24,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:19:24,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:24,541 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:19:24,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:19:24,591 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:19:24,591 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 15:19:24,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 15:19:24,591 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 15:19:24,591 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:19:24,592 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand 4 states. [2018-04-11 15:19:24,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:19:24,603 INFO L93 Difference]: Finished difference Result 98 states and 107 transitions. [2018-04-11 15:19:24,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 15:19:24,603 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-04-11 15:19:24,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:19:24,604 INFO L225 Difference]: With dead ends: 98 [2018-04-11 15:19:24,604 INFO L226 Difference]: Without dead ends: 98 [2018-04-11 15:19:24,604 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:19:24,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-04-11 15:19:24,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 92. [2018-04-11 15:19:24,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-04-11 15:19:24,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2018-04-11 15:19:24,606 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 30 [2018-04-11 15:19:24,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:19:24,609 INFO L459 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2018-04-11 15:19:24,609 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 15:19:24,610 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2018-04-11 15:19:24,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 15:19:24,610 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:19:24,610 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:19:24,610 INFO L408 AbstractCegarLoop]: === Iteration 22 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:19:24,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1029105321, now seen corresponding path program 1 times [2018-04-11 15:19:24,610 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:19:24,611 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:19:24,611 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:24,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:19:24,611 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:24,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:24,618 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:19:24,623 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:19:24,623 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:19:24,623 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:19:24,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:19:24,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:24,644 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:19:24,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:19:24,651 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:24,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:24,652 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 15:19:24,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:19:24,660 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:24,667 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:24,668 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:24,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:19:24,668 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:24,673 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:24,673 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-11 15:19:24,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 15:19:24,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:19:24,694 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:24,695 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:24,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:24,701 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-04-11 15:19:24,765 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-11 15:19:24,768 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:19:24,768 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:24,774 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:24,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 15:19:24,784 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:37 [2018-04-11 15:19:24,847 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 27 [2018-04-11 15:19:24,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 15:19:24,853 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:24,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-04-11 15:19:24,863 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 15:19:24,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:19:24,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:19:24,876 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:51, output treesize:54 [2018-04-11 15:19:24,937 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:19:24,937 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:19:24,938 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-11 15:19:24,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 15:19:24,938 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 15:19:24,938 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-04-11 15:19:24,938 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand 14 states. [2018-04-11 15:19:25,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:19:25,352 INFO L93 Difference]: Finished difference Result 108 states and 120 transitions. [2018-04-11 15:19:25,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 15:19:25,354 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 30 [2018-04-11 15:19:25,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:19:25,355 INFO L225 Difference]: With dead ends: 108 [2018-04-11 15:19:25,355 INFO L226 Difference]: Without dead ends: 108 [2018-04-11 15:19:25,355 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2018-04-11 15:19:25,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-04-11 15:19:25,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 96. [2018-04-11 15:19:25,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-04-11 15:19:25,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2018-04-11 15:19:25,357 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 30 [2018-04-11 15:19:25,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:19:25,358 INFO L459 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2018-04-11 15:19:25,358 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 15:19:25,358 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2018-04-11 15:19:25,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 15:19:25,358 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:19:25,358 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:19:25,358 INFO L408 AbstractCegarLoop]: === Iteration 23 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:19:25,359 INFO L82 PathProgramCache]: Analyzing trace with hash -464827512, now seen corresponding path program 1 times [2018-04-11 15:19:25,359 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:19:25,359 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:19:25,359 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:25,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:19:25,360 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:25,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:25,368 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:19:25,528 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:19:25,528 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:19:25,528 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:19:25,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:19:25,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:25,556 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:19:25,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:19:25,561 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:25,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:25,565 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-11 15:19:25,589 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 15:19:25,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:19:25,591 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:25,593 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:25,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:25,597 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:23 [2018-04-11 15:19:25,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-04-11 15:19:25,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-04-11 15:19:25,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:19:25,723 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:19:25,731 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-11 15:19:25,731 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:54 [2018-04-11 15:19:25,802 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:19:25,803 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:19:25,803 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-04-11 15:19:25,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 15:19:25,803 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 15:19:25,803 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2018-04-11 15:19:25,803 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand 21 states. [2018-04-11 15:19:26,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:19:26,215 INFO L93 Difference]: Finished difference Result 118 states and 129 transitions. [2018-04-11 15:19:26,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 15:19:26,215 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 32 [2018-04-11 15:19:26,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:19:26,216 INFO L225 Difference]: With dead ends: 118 [2018-04-11 15:19:26,216 INFO L226 Difference]: Without dead ends: 118 [2018-04-11 15:19:26,216 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=110, Invalid=702, Unknown=0, NotChecked=0, Total=812 [2018-04-11 15:19:26,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-04-11 15:19:26,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 96. [2018-04-11 15:19:26,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-04-11 15:19:26,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2018-04-11 15:19:26,218 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 32 [2018-04-11 15:19:26,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:19:26,219 INFO L459 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2018-04-11 15:19:26,219 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 15:19:26,219 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2018-04-11 15:19:26,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 15:19:26,219 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:19:26,219 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:19:26,220 INFO L408 AbstractCegarLoop]: === Iteration 24 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:19:26,220 INFO L82 PathProgramCache]: Analyzing trace with hash -964301604, now seen corresponding path program 1 times [2018-04-11 15:19:26,220 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:19:26,220 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:19:26,221 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:26,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:19:26,221 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:26,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:26,230 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:19:26,232 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:19:26,232 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:19:26,232 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:19:26,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:19:26,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:26,250 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:19:26,283 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:26,284 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-11 15:19:26,288 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-11 15:19:26,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:26,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:26,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 15:19:26,297 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-11 15:19:26,322 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true [2018-04-11 15:19:26,327 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true [2018-04-11 15:19:26,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:19:26,332 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:19:26,332 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 15:19:26,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 15:19:26,333 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 15:19:26,333 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=22, Unknown=2, NotChecked=18, Total=56 [2018-04-11 15:19:26,333 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand 8 states. [2018-04-11 15:19:26,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:19:26,416 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2018-04-11 15:19:26,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 15:19:26,416 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2018-04-11 15:19:26,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:19:26,417 INFO L225 Difference]: With dead ends: 95 [2018-04-11 15:19:26,417 INFO L226 Difference]: Without dead ends: 58 [2018-04-11 15:19:26,417 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 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-11 15:19:26,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-04-11 15:19:26,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-04-11 15:19:26,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-04-11 15:19:26,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2018-04-11 15:19:26,419 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 33 [2018-04-11 15:19:26,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:19:26,419 INFO L459 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2018-04-11 15:19:26,419 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 15:19:26,419 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2018-04-11 15:19:26,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 15:19:26,420 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:19:26,420 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:19:26,420 INFO L408 AbstractCegarLoop]: === Iteration 25 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:19:26,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1721008833, now seen corresponding path program 2 times [2018-04-11 15:19:26,420 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:19:26,420 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:19:26,421 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:26,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:19:26,421 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:26,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:26,437 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:19:26,448 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:19:26,449 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:19:26,449 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:19:26,449 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:19:26,490 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:19:26,490 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:19:26,494 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:19:26,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:19:26,498 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:26,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:26,501 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 15:19:26,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:19:26,512 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:26,519 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:26,520 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:26,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:19:26,521 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:26,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:26,526 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2018-04-11 15:19:26,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 15:19:26,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:19:26,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:26,550 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:26,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:26,557 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2018-04-11 15:19:26,663 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-11 15:19:26,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 8 treesize of output 7 [2018-04-11 15:19:26,667 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:26,670 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:26,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:26,678 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:23 [2018-04-11 15:19:26,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-04-11 15:19:26,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-04-11 15:19:26,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:19:26,730 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:19:26,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:19:26,736 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:38 [2018-04-11 15:19:26,796 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:19:26,796 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:19:26,797 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-11 15:19:26,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 15:19:26,797 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 15:19:26,797 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2018-04-11 15:19:26,797 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 16 states. [2018-04-11 15:19:27,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:19:27,193 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2018-04-11 15:19:27,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 15:19:27,193 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 33 [2018-04-11 15:19:27,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:19:27,193 INFO L225 Difference]: With dead ends: 80 [2018-04-11 15:19:27,193 INFO L226 Difference]: Without dead ends: 80 [2018-04-11 15:19:27,194 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2018-04-11 15:19:27,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-04-11 15:19:27,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 63. [2018-04-11 15:19:27,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-04-11 15:19:27,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2018-04-11 15:19:27,195 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 33 [2018-04-11 15:19:27,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:19:27,195 INFO L459 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2018-04-11 15:19:27,195 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 15:19:27,195 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2018-04-11 15:19:27,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-11 15:19:27,195 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:19:27,195 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:19:27,195 INFO L408 AbstractCegarLoop]: === Iteration 26 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:19:27,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1811666231, now seen corresponding path program 2 times [2018-04-11 15:19:27,196 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:19:27,196 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:19:27,196 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:27,196 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:19:27,196 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:27,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:27,203 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:19:27,205 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:19:27,205 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:19:27,205 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:19:27,205 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:19:27,246 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:19:27,247 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:19:27,254 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:19:27,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:19:27,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:27,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:27,269 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-11 15:19:27,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:19:27,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:19:27,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:19:27,307 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:29 [2018-04-11 15:19:27,783 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:19:27,783 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:19:27,783 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 15:19:27,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 15:19:27,784 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 15:19:27,784 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-04-11 15:19:27,784 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand 17 states. [2018-04-11 15:19:28,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:19:28,600 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2018-04-11 15:19:28,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 15:19:28,600 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 34 [2018-04-11 15:19:28,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:19:28,600 INFO L225 Difference]: With dead ends: 65 [2018-04-11 15:19:28,601 INFO L226 Difference]: Without dead ends: 65 [2018-04-11 15:19:28,601 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=90, Invalid=722, Unknown=0, NotChecked=0, Total=812 [2018-04-11 15:19:28,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-04-11 15:19:28,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2018-04-11 15:19:28,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-04-11 15:19:28,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2018-04-11 15:19:28,602 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 34 [2018-04-11 15:19:28,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:19:28,602 INFO L459 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2018-04-11 15:19:28,602 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 15:19:28,602 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2018-04-11 15:19:28,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-11 15:19:28,602 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:19:28,602 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:19:28,602 INFO L408 AbstractCegarLoop]: === Iteration 27 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:19:28,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1421890336, now seen corresponding path program 2 times [2018-04-11 15:19:28,603 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:19:28,603 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:19:28,603 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:28,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:19:28,603 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:28,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:28,616 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:19:28,625 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:19:28,626 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:19:28,626 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:19:28,626 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:19:28,658 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:19:28,660 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:19:28,663 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:19:28,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:19:28,674 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:28,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:28,678 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-11 15:19:28,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:19:28,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:28,701 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:28,702 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:28,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:19:28,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:28,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:28,708 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-04-11 15:19:28,731 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 14 treesize of output 11 [2018-04-11 15:19:28,733 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 15:19:28,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:28,735 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:28,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:28,744 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2018-04-11 15:19:28,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-04-11 15:19: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 13 treesize of output 12 [2018-04-11 15:19:28,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:28,769 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:28,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:28,777 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:52, output treesize:48 [2018-04-11 15:19:28,906 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:19:28,908 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 32 treesize of output 36 [2018-04-11 15:19:28,910 INFO L682 Elim1Store]: detected equality via solver [2018-04-11 15:19:28,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2018-04-11 15:19:28,914 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:28,921 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:28,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 15:19:28,933 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:66, output treesize:52 [2018-04-11 15:19:29,253 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:29,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 36 [2018-04-11 15:19:29,258 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2018-04-11 15:19:29,258 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:29,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2018-04-11 15:19:29,267 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 15:19:29,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:19:29,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:19:29,285 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:67, output treesize:46 [2018-04-11 15:19:29,349 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:19:29,349 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:19:29,350 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-11 15:19:29,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 15:19:29,350 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 15:19:29,350 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2018-04-11 15:19:29,350 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand 21 states. [2018-04-11 15:19:32,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:19:32,570 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2018-04-11 15:19:32,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 15:19:32,570 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 34 [2018-04-11 15:19:32,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:19:32,571 INFO L225 Difference]: With dead ends: 77 [2018-04-11 15:19:32,571 INFO L226 Difference]: Without dead ends: 77 [2018-04-11 15:19:32,571 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=139, Invalid=1120, Unknown=1, NotChecked=0, Total=1260 [2018-04-11 15:19:32,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-04-11 15:19:32,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 68. [2018-04-11 15:19:32,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-04-11 15:19:32,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2018-04-11 15:19:32,572 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 34 [2018-04-11 15:19:32,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:19:32,572 INFO L459 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2018-04-11 15:19:32,572 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 15:19:32,573 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2018-04-11 15:19:32,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-11 15:19:32,573 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:19:32,573 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:19:32,573 INFO L408 AbstractCegarLoop]: === Iteration 28 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:19:32,573 INFO L82 PathProgramCache]: Analyzing trace with hash 327037559, now seen corresponding path program 2 times [2018-04-11 15:19:32,573 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:19:32,573 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:19:32,573 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:32,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:19:32,574 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:32,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:32,582 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:19:32,595 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:19:32,595 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:19:32,595 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:19:32,595 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:19:32,617 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:19:32,617 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:19:32,620 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:19:32,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:19:32,627 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:32,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:19:32,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:32,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:32,639 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:19:32,658 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:32,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:19:32,659 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:32,670 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:32,670 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:32,671 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:19:32,671 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:32,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:32,677 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:19:32,785 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:19:32,785 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:19:32,785 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-11 15:19:32,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 15:19:32,786 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 15:19:32,786 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2018-04-11 15:19:32,786 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand 15 states. [2018-04-11 15:19:33,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:19:33,075 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2018-04-11 15:19:33,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 15:19:33,075 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 35 [2018-04-11 15:19:33,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:19:33,076 INFO L225 Difference]: With dead ends: 89 [2018-04-11 15:19:33,076 INFO L226 Difference]: Without dead ends: 89 [2018-04-11 15:19:33,076 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=521, Unknown=0, NotChecked=0, Total=600 [2018-04-11 15:19:33,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-04-11 15:19:33,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 71. [2018-04-11 15:19:33,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-04-11 15:19:33,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2018-04-11 15:19:33,078 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 35 [2018-04-11 15:19:33,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:19:33,078 INFO L459 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2018-04-11 15:19:33,078 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 15:19:33,078 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2018-04-11 15:19:33,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-11 15:19:33,079 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:19:33,079 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:19:33,079 INFO L408 AbstractCegarLoop]: === Iteration 29 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:19:33,079 INFO L82 PathProgramCache]: Analyzing trace with hash -282513281, now seen corresponding path program 1 times [2018-04-11 15:19:33,079 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:19:33,079 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:19:33,080 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:33,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:19:33,080 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:33,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:33,090 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:19:33,097 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:19:33,097 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:19:33,097 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:19:33,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:19:33,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:33,122 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:19:33,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 6 treesize of output 5 [2018-04-11 15:19:33,126 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:33,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:33,129 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 15:19:33,141 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:33,142 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:33,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:19:33,142 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:33,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:19:33,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:33,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:33,154 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2018-04-11 15:19:33,175 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 15:19:33,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 13 treesize of output 12 [2018-04-11 15:19:33,177 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:33,178 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:33,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:33,184 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-04-11 15:19:33,269 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-11 15:19:33,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:19:33,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:33,276 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:33,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:33,284 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:27 [2018-04-11 15:19:33,308 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-11 15:19:33,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:19:33,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:33,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:33,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 15:19:33,322 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:34 [2018-04-11 15:19:33,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-04-11 15:19:33,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 15:19:33,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:33,383 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-04-11 15:19:33,383 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 15:19:33,387 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:19:33,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:19:33,394 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2018-04-11 15:19:33,453 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:19:33,453 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:19:33,453 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-11 15:19:33,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 15:19:33,453 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 15:19:33,454 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2018-04-11 15:19:33,454 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand 18 states. [2018-04-11 15:19:33,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:19:33,919 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2018-04-11 15:19:33,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-11 15:19:33,919 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 36 [2018-04-11 15:19:33,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:19:33,919 INFO L225 Difference]: With dead ends: 84 [2018-04-11 15:19:33,920 INFO L226 Difference]: Without dead ends: 84 [2018-04-11 15:19:33,920 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2018-04-11 15:19:33,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-04-11 15:19:33,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 71. [2018-04-11 15:19:33,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-04-11 15:19:33,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2018-04-11 15:19:33,922 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 36 [2018-04-11 15:19:33,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:19:33,922 INFO L459 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2018-04-11 15:19:33,922 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 15:19:33,922 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2018-04-11 15:19:33,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 15:19:33,922 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:19:33,922 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:19:33,922 INFO L408 AbstractCegarLoop]: === Iteration 30 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:19:33,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1790080990, now seen corresponding path program 2 times [2018-04-11 15:19:33,922 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:19:33,922 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:19:33,923 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:33,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:19:33,923 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:33,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:33,935 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:19:33,945 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:19:33,945 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:19:33,945 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:19:33,946 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:19:33,987 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:19:33,987 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:19:33,990 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:19:34,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:19:34,004 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:34,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:34,006 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 15:19:34,014 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:34,015 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:34,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:19:34,016 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:34,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:19:34,022 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:34,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:34,026 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-11 15:19:34,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 15:19:34,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:19:34,048 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:34,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:34,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:34,058 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:27 [2018-04-11 15:19:34,142 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-11 15:19:34,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:19:34,145 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:34,150 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:34,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:34,159 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:23 [2018-04-11 15:19:34,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-04-11 15:19:34,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-04-11 15:19:34,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:19:34,211 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:19:34,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:19:34,220 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:38 [2018-04-11 15:19:34,298 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:19:34,298 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:19:34,298 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-11 15:19:34,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 15:19:34,300 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 15:19:34,300 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2018-04-11 15:19:34,300 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand 16 states. [2018-04-11 15:19:34,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:19:34,704 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2018-04-11 15:19:34,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 15:19:34,704 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 38 [2018-04-11 15:19:34,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:19:34,704 INFO L225 Difference]: With dead ends: 87 [2018-04-11 15:19:34,704 INFO L226 Difference]: Without dead ends: 87 [2018-04-11 15:19:34,705 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2018-04-11 15:19:34,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-04-11 15:19:34,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 71. [2018-04-11 15:19:34,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-04-11 15:19:34,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2018-04-11 15:19:34,706 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 38 [2018-04-11 15:19:34,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:19:34,706 INFO L459 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2018-04-11 15:19:34,706 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 15:19:34,706 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2018-04-11 15:19:34,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 15:19:34,706 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:19:34,707 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:19:34,707 INFO L408 AbstractCegarLoop]: === Iteration 31 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:19:34,707 INFO L82 PathProgramCache]: Analyzing trace with hash -2011124713, now seen corresponding path program 3 times [2018-04-11 15:19:34,707 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:19:34,707 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:19:34,707 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:34,707 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:19:34,707 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:34,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:34,714 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:19:34,729 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:19:34,729 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:19:34,729 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:19:34,729 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:19:34,757 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-11 15:19:34,758 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:19:34,760 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:19:34,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-11 15:19:34,764 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:34,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:34,765 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 15:19:34,772 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:34,772 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:34,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:19:34,773 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:34,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:19:34,778 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:34,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:34,782 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-11 15:19:34,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-04-11 15:19:34,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 15:19:34,801 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:34,803 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:34,806 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:34,806 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-11 15:19:34,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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-11 15:19:34,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:19:34,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:34,856 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:34,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 15:19:34,861 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:23 [2018-04-11 15:19:34,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-04-11 15:19:34,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 15:19:34,910 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:34,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-04-11 15:19:34,920 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 15:19:34,924 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:19:34,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:19:34,931 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2018-04-11 15:19:34,992 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-04-11 15:19:34,993 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:19:34,993 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-11 15:19:34,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 15:19:34,993 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 15:19:34,993 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-04-11 15:19:34,994 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand 14 states. [2018-04-11 15:19:35,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:19:35,421 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2018-04-11 15:19:35,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 15:19:35,421 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2018-04-11 15:19:35,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:19:35,422 INFO L225 Difference]: With dead ends: 82 [2018-04-11 15:19:35,422 INFO L226 Difference]: Without dead ends: 64 [2018-04-11 15:19:35,422 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=485, Unknown=0, NotChecked=0, Total=600 [2018-04-11 15:19:35,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-04-11 15:19:35,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-04-11 15:19:35,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-04-11 15:19:35,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2018-04-11 15:19:35,423 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 38 [2018-04-11 15:19:35,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:19:35,424 INFO L459 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2018-04-11 15:19:35,424 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 15:19:35,424 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-04-11 15:19:35,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-11 15:19:35,424 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:19:35,424 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:19:35,424 INFO L408 AbstractCegarLoop]: === Iteration 32 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:19:35,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1391271637, now seen corresponding path program 3 times [2018-04-11 15:19:35,425 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:19:35,425 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:19:35,425 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:35,425 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:19:35,425 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:35,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:35,438 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:19:35,441 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:19:35,441 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:19:35,441 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:19:35,441 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:19:35,478 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-11 15:19:35,478 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:19:35,482 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:19:35,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:19:35,485 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:35,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:35,489 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 15:19:35,499 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:35,500 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:35,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:19:35,501 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:35,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:19:35,510 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:35,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:35,515 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2018-04-11 15:19:35,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-04-11 15:19:35,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 15:19:35,536 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:35,537 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:35,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:35,541 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-04-11 15:19:35,600 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 25 treesize of output 26 [2018-04-11 15:19:35,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 10 treesize of output 9 [2018-04-11 15:19:35,602 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:35,605 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:35,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:35,612 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:25 [2018-04-11 15:19:35,669 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-11 15:19:35,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:19:35,671 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:35,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:35,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:35,680 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:15 [2018-04-11 15:19:35,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-04-11 15:19:35,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-04-11 15:19:35,736 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:19:35,739 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:19:35,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:19:35,744 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:32 [2018-04-11 15:19:35,818 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:19:35,819 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:19:35,819 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-11 15:19:35,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 15:19:35,819 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 15:19:35,819 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2018-04-11 15:19:35,819 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 19 states. [2018-04-11 15:19:36,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:19:36,221 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2018-04-11 15:19:36,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 15:19:36,221 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 39 [2018-04-11 15:19:36,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:19:36,221 INFO L225 Difference]: With dead ends: 91 [2018-04-11 15:19:36,222 INFO L226 Difference]: Without dead ends: 91 [2018-04-11 15:19:36,222 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=716, Unknown=0, NotChecked=0, Total=812 [2018-04-11 15:19:36,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-04-11 15:19:36,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 69. [2018-04-11 15:19:36,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-04-11 15:19:36,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2018-04-11 15:19:36,223 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 39 [2018-04-11 15:19:36,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:19:36,223 INFO L459 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2018-04-11 15:19:36,223 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 15:19:36,238 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2018-04-11 15:19:36,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-11 15:19:36,238 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:19:36,238 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:19:36,238 INFO L408 AbstractCegarLoop]: === Iteration 33 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:19:36,239 INFO L82 PathProgramCache]: Analyzing trace with hash -179747827, now seen corresponding path program 3 times [2018-04-11 15:19:36,239 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:19:36,239 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:19:36,239 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:36,239 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:19:36,239 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:36,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:36,248 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:19:36,274 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:19:36,275 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:19:36,275 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:19:36,275 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:19:36,316 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-11 15:19:36,317 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:19:36,319 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:19:36,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:19:36,324 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:36,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:19:36,328 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:36,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:36,331 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:19:36,341 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:36,342 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:36,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, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:19:36,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:36,348 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:19:36,348 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:36,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:36,352 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:19:36,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-04-11 15:19:36,756 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:36,773 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-11 15:19:36,774 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:62, output treesize:52 [2018-04-11 15:19:36,826 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:19:36,826 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:19:36,827 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-11 15:19:36,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 15:19:36,827 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 15:19:36,827 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2018-04-11 15:19:36,827 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand 20 states. [2018-04-11 15:19:37,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:19:37,792 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2018-04-11 15:19:37,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-11 15:19:37,793 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2018-04-11 15:19:37,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:19:37,793 INFO L225 Difference]: With dead ends: 71 [2018-04-11 15:19:37,793 INFO L226 Difference]: Without dead ends: 71 [2018-04-11 15:19:37,793 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=114, Invalid=1076, Unknown=0, NotChecked=0, Total=1190 [2018-04-11 15:19:37,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-04-11 15:19:37,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2018-04-11 15:19:37,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-04-11 15:19:37,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2018-04-11 15:19:37,794 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 40 [2018-04-11 15:19:37,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:19:37,795 INFO L459 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2018-04-11 15:19:37,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 15:19:37,795 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2018-04-11 15:19:37,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-11 15:19:37,795 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:19:37,795 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:19:37,795 INFO L408 AbstractCegarLoop]: === Iteration 34 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:19:37,795 INFO L82 PathProgramCache]: Analyzing trace with hash -569523722, now seen corresponding path program 2 times [2018-04-11 15:19:37,795 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:19:37,795 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:19:37,796 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:37,796 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:19:37,796 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:37,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:37,802 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:19:37,818 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:19:37,818 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:19:37,818 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:19:37,819 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:19:37,843 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:19:37,843 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:19:37,846 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:19:37,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-11 15:19:37,849 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:37,854 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:19:37,854 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:37,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:37,858 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:19:37,871 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:37,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:19:37,872 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:37,901 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:37,902 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:37,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:19:37,903 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:37,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:37,911 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2018-04-11 15:19:37,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 15:19:37,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:19:37,942 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:37,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:37,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:37,949 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-04-11 15:19:38,062 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-11 15:19:38,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:19:38,064 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:38,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:38,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:38,077 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:34 [2018-04-11 15:19:38,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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-11 15:19:38,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:19:38,157 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:38,160 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:38,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 15:19:38,171 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:50 [2018-04-11 15:19:38,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2018-04-11 15:19:38,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 15:19:38,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:38,276 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-11 15:19:38,276 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 15:19:38,279 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:19:38,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 15:19:38,291 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:62, output treesize:68 [2018-04-11 15:19:38,390 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:19:38,390 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:19:38,391 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-11 15:19:38,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 15:19:38,391 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 15:19:38,391 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=412, Unknown=0, NotChecked=0, Total=462 [2018-04-11 15:19:38,391 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand 22 states. [2018-04-11 15:19:38,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:19:38,908 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2018-04-11 15:19:38,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 15:19:38,909 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2018-04-11 15:19:38,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:19:38,909 INFO L225 Difference]: With dead ends: 78 [2018-04-11 15:19:38,909 INFO L226 Difference]: Without dead ends: 78 [2018-04-11 15:19:38,909 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=104, Invalid=826, Unknown=0, NotChecked=0, Total=930 [2018-04-11 15:19:38,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-04-11 15:19:38,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2018-04-11 15:19:38,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-04-11 15:19:38,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2018-04-11 15:19:38,911 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 40 [2018-04-11 15:19:38,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:19:38,911 INFO L459 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2018-04-11 15:19:38,911 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 15:19:38,911 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2018-04-11 15:19:38,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-11 15:19:38,912 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:19:38,912 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:19:38,912 INFO L408 AbstractCegarLoop]: === Iteration 35 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:19:38,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1277256095, now seen corresponding path program 3 times [2018-04-11 15:19:38,912 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:19:38,912 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:19:38,913 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:38,913 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:19:38,913 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:38,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:38,923 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:19:38,947 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:19:38,947 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:19:38,947 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:19:38,947 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:19:38,977 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-11 15:19:38,977 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:19:38,981 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:19:38,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:19:38,997 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:39,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:19:39,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:39,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:39,007 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:19:39,023 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:39,026 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:19:39,026 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:39,036 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:39,037 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:39,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:19:39,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:39,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:39,043 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:19:39,200 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:19:39,200 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:19:39,201 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 15:19:39,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 15:19:39,201 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 15:19:39,201 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-04-11 15:19:39,201 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 17 states. [2018-04-11 15:19:39,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:19:39,648 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2018-04-11 15:19:39,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 15:19:39,648 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 41 [2018-04-11 15:19:39,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:19:39,648 INFO L225 Difference]: With dead ends: 95 [2018-04-11 15:19:39,648 INFO L226 Difference]: Without dead ends: 95 [2018-04-11 15:19:39,648 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=718, Unknown=0, NotChecked=0, Total=812 [2018-04-11 15:19:39,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-04-11 15:19:39,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 77. [2018-04-11 15:19:39,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-04-11 15:19:39,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2018-04-11 15:19:39,650 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 41 [2018-04-11 15:19:39,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:19:39,650 INFO L459 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2018-04-11 15:19:39,650 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 15:19:39,650 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2018-04-11 15:19:39,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-11 15:19:39,650 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:19:39,650 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:19:39,650 INFO L408 AbstractCegarLoop]: === Iteration 36 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:19:39,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1523990997, now seen corresponding path program 3 times [2018-04-11 15:19:39,650 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:19:39,651 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:19:39,651 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:39,651 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:19:39,651 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:39,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:39,662 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:19:39,693 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:19:39,693 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:19:39,693 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:19:39,693 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:19:39,733 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-11 15:19:39,733 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:19:39,737 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:19:39,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-11 15:19:39,741 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:39,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:39,746 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-11 15:19:39,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:19:39,761 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:39,771 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:39,772 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:39,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:19:39,772 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:39,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:39,777 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-04-11 15:19:39,800 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 15:19:39,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:19:39,802 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:39,803 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:39,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:39,807 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:30, output treesize:26 [2018-04-11 15:19:39,907 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-11 15:19:39,909 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:19:39,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:39,913 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:39,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:39,922 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:25 [2018-04-11 15:19:39,979 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-11 15:19:39,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:19:39,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:39,984 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:39,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:39,990 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:27 [2018-04-11 15:19:40,077 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-11 15:19:40,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:19:40,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:40,083 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:40,088 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 15:19:40,088 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-04-11 15:19:40,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2018-04-11 15:19:40,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 15:19:40,135 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:40,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-11 15:19:40,142 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 15:19:40,146 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:19:40,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:19:40,151 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:38, output treesize:30 [2018-04-11 15:19:40,210 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:19:40,211 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:19:40,211 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-11 15:19:40,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 15:19:40,211 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 15:19:40,211 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=495, Unknown=0, NotChecked=0, Total=552 [2018-04-11 15:19:40,211 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 24 states. [2018-04-11 15:19:40,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:19:40,741 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2018-04-11 15:19:40,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 15:19:40,742 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 42 [2018-04-11 15:19:40,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:19:40,742 INFO L225 Difference]: With dead ends: 85 [2018-04-11 15:19:40,742 INFO L226 Difference]: Without dead ends: 85 [2018-04-11 15:19:40,743 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=1063, Unknown=0, NotChecked=0, Total=1190 [2018-04-11 15:19:40,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-04-11 15:19:40,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 77. [2018-04-11 15:19:40,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-04-11 15:19:40,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2018-04-11 15:19:40,744 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 42 [2018-04-11 15:19:40,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:19:40,744 INFO L459 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2018-04-11 15:19:40,744 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 15:19:40,744 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2018-04-11 15:19:40,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-11 15:19:40,744 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:19:40,744 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:19:40,744 INFO L408 AbstractCegarLoop]: === Iteration 37 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:19:40,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1621062732, now seen corresponding path program 3 times [2018-04-11 15:19:40,745 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:19:40,745 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:19:40,745 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:40,745 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:19:40,745 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:40,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:40,753 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:19:40,755 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:19:40,755 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:19:40,755 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:19:40,756 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:19:40,788 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-11 15:19:40,788 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:19:40,791 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:19:40,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:19:40,793 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:40,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:40,795 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 15:19:40,803 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:40,803 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:40,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:19:40,804 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:40,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:19:40,809 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:40,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:40,812 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2018-04-11 15:19:40,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 15:19:40,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:19:40,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:40,852 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:40,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:40,858 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-04-11 15:19:40,947 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-11 15:19:40,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:19:40,949 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:40,954 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:40,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:40,969 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:22 [2018-04-11 15:19:41,036 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-11 15:19:41,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 8 treesize of output 7 [2018-04-11 15:19:41,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:41,040 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:41,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:41,045 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:18 [2018-04-11 15:19:41,073 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-11 15:19:41,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-11 15:19:41,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:19:41,079 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:19:41,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:19:41,083 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:30 [2018-04-11 15:19:41,132 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:19:41,133 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:19:41,133 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-11 15:19:41,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 15:19:41,133 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 15:19:41,133 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2018-04-11 15:19:41,133 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 19 states. [2018-04-11 15:19:41,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:19:41,449 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2018-04-11 15:19:41,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-11 15:19:41,450 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 44 [2018-04-11 15:19:41,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:19:41,450 INFO L225 Difference]: With dead ends: 83 [2018-04-11 15:19:41,450 INFO L226 Difference]: Without dead ends: 83 [2018-04-11 15:19:41,450 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2018-04-11 15:19:41,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-04-11 15:19:41,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2018-04-11 15:19:41,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-04-11 15:19:41,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2018-04-11 15:19:41,452 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 44 [2018-04-11 15:19:41,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:19:41,452 INFO L459 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2018-04-11 15:19:41,452 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 15:19:41,452 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2018-04-11 15:19:41,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-11 15:19:41,453 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:19:41,453 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:19:41,453 INFO L408 AbstractCegarLoop]: === Iteration 38 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:19:41,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1127301139, now seen corresponding path program 4 times [2018-04-11 15:19:41,453 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:19:41,453 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:19:41,454 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:41,454 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:19:41,454 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:41,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:41,464 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:19:41,482 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:19:41,482 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:19:41,482 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:19:41,482 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:19:41,514 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:19:41,514 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:19:41,518 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:19:41,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:19:41,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:41,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:41,534 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 15:19:41,540 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:41,541 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:41,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:19:41,541 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:41,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:19:41,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:41,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:41,550 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-11 15:19:41,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 15:19:41,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:19:41,567 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:41,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:41,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:41,573 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-04-11 15:19:41,622 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-11 15:19:41,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:19:41,623 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:41,627 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:41,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:41,633 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2018-04-11 15:19:41,648 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-11 15:19:41,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:19:41,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:41,653 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:41,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 15:19:41,657 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-04-11 15:19:41,703 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-04-11 15:19:41,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 15:19:41,704 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:41,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-04-11 15:19:41,722 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 15:19:41,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:19:41,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:19:41,731 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2018-04-11 15:19:41,805 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-11 15:19:41,805 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:19:41,806 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 15:19:41,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 15:19:41,806 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 15:19:41,806 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-04-11 15:19:41,806 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 17 states. [2018-04-11 15:19:42,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:19:42,087 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2018-04-11 15:19:42,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 15:19:42,087 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 44 [2018-04-11 15:19:42,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:19:42,088 INFO L225 Difference]: With dead ends: 88 [2018-04-11 15:19:42,088 INFO L226 Difference]: Without dead ends: 70 [2018-04-11 15:19:42,088 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2018-04-11 15:19:42,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-04-11 15:19:42,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-04-11 15:19:42,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-04-11 15:19:42,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2018-04-11 15:19:42,089 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 44 [2018-04-11 15:19:42,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:19:42,089 INFO L459 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2018-04-11 15:19:42,090 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 15:19:42,090 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2018-04-11 15:19:42,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-11 15:19:42,090 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:19:42,090 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:19:42,090 INFO L408 AbstractCegarLoop]: === Iteration 39 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:19:42,090 INFO L82 PathProgramCache]: Analyzing trace with hash 237455381, now seen corresponding path program 4 times [2018-04-11 15:19:42,090 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:19:42,090 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:19:42,091 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:42,091 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:19:42,091 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:42,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:42,101 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:19:42,121 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:19:42,122 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:19:42,122 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:19:42,122 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:19:42,168 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:19:42,168 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:19:42,172 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:19:42,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:19:42,180 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:42,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:42,181 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 15:19:42,188 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:42,189 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:42,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:19:42,189 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:42,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:19:42,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:42,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:42,199 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-11 15:19:42,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-04-11 15:19:42,216 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 15:19:42,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:42,217 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:42,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:42,220 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-11 15:19:42,266 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-11 15:19:42,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-11 15:19:42,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:42,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:42,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:42,279 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-04-11 15:19:42,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-04-11 15:19:42,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:19:42,287 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:42,291 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:42,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:42,294 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-04-11 15:19:42,306 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-11 15:19:42,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:19:42,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:42,310 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:42,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:42,314 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2018-04-11 15:19:42,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-04-11 15:19:42,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-04-11 15:19:42,338 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:19:42,340 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:19:42,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:19:42,345 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-04-11 15:19:42,390 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-04-11 15:19:42,390 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:19:42,390 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-11 15:19:42,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 15:19:42,390 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 15:19:42,391 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-04-11 15:19:42,391 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 16 states. [2018-04-11 15:19:42,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:19:42,708 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-04-11 15:19:42,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 15:19:42,708 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 45 [2018-04-11 15:19:42,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:19:42,709 INFO L225 Difference]: With dead ends: 73 [2018-04-11 15:19:42,709 INFO L226 Difference]: Without dead ends: 73 [2018-04-11 15:19:42,709 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2018-04-11 15:19:42,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-04-11 15:19:42,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 69. [2018-04-11 15:19:42,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-04-11 15:19:42,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-04-11 15:19:42,710 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 45 [2018-04-11 15:19:42,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:19:42,710 INFO L459 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-04-11 15:19:42,710 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 15:19:42,710 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-04-11 15:19:42,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-11 15:19:42,711 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:19:42,711 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:19:42,711 INFO L408 AbstractCegarLoop]: === Iteration 40 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:19:42,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1228817821, now seen corresponding path program 4 times [2018-04-11 15:19:42,711 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:19:42,711 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:19:42,711 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:42,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:19:42,712 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:42,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:42,718 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:19:42,721 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:19:42,721 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:19:42,721 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:19:42,721 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:19:42,743 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:19:42,743 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:19:42,746 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:19:42,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-11 15:19:42,749 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:42,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:19:42,754 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:42,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:42,766 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:19:42,800 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:42,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:19:42,827 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:42,837 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:42,838 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:42,839 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:19:42,839 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:42,843 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:42,843 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:19:43,235 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:19:43,235 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:19:43,235 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-11 15:19:43,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 15:19:43,236 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 15:19:43,236 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2018-04-11 15:19:43,236 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 19 states. [2018-04-11 15:19:43,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:19:43,990 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2018-04-11 15:19:43,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-11 15:19:43,990 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 46 [2018-04-11 15:19:43,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:19:43,990 INFO L225 Difference]: With dead ends: 76 [2018-04-11 15:19:43,990 INFO L226 Difference]: Without dead ends: 76 [2018-04-11 15:19:43,990 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=100, Invalid=956, Unknown=0, NotChecked=0, Total=1056 [2018-04-11 15:19:43,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-04-11 15:19:43,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2018-04-11 15:19:43,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-04-11 15:19:43,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2018-04-11 15:19:43,992 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 46 [2018-04-11 15:19:43,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:19:43,992 INFO L459 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2018-04-11 15:19:43,992 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 15:19:43,992 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2018-04-11 15:19:43,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-11 15:19:43,992 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:19:43,992 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:19:43,992 INFO L408 AbstractCegarLoop]: === Iteration 41 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:19:43,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1618593716, now seen corresponding path program 5 times [2018-04-11 15:19:43,992 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:19:43,992 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:19:43,993 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:43,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:19:43,993 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:43,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:43,999 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:19:44,004 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:19:44,004 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:19:44,004 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:19:44,004 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:19:44,027 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-04-11 15:19:44,028 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:19:44,030 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:19:44,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:19:44,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:44,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:44,052 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-04-11 15:19:44,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:19:44,068 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:44,080 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:44,081 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:44,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 15:19:44,082 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:44,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:44,108 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:31 [2018-04-11 15:19:44,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 15:19:44,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 13 treesize of output 12 [2018-04-11 15:19:44,133 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:44,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:44,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:44,141 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-04-11 15:19:44,268 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-11 15:19:44,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:19:44,270 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:44,273 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:44,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:44,282 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:37 [2018-04-11 15:19:44,359 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-11 15:19:44,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:19:44,361 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:44,366 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:44,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:44,379 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:37 [2018-04-11 15:19:44,475 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-11 15:19:44,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:19:44,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:44,482 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:44,492 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 15:19:44,492 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:36 [2018-04-11 15:19:44,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:19:44,573 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:44,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2018-04-11 15:19:44,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 15:19:44,581 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:44,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-11 15:19:44,587 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 15:19:44,589 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:19:44,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:19:44,594 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:48, output treesize:30 [2018-04-11 15:19:44,660 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:19:44,660 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:19:44,660 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-11 15:19:44,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 15:19:44,661 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 15:19:44,661 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=537, Unknown=0, NotChecked=0, Total=600 [2018-04-11 15:19:44,661 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 25 states. [2018-04-11 15:19:45,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:19:45,151 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2018-04-11 15:19:45,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 15:19:45,151 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 46 [2018-04-11 15:19:45,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:19:45,151 INFO L225 Difference]: With dead ends: 83 [2018-04-11 15:19:45,151 INFO L226 Difference]: Without dead ends: 83 [2018-04-11 15:19:45,152 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=117, Invalid=1005, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 15:19:45,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-04-11 15:19:45,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2018-04-11 15:19:45,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-04-11 15:19:45,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2018-04-11 15:19:45,153 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 46 [2018-04-11 15:19:45,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:19:45,153 INFO L459 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2018-04-11 15:19:45,153 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 15:19:45,154 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2018-04-11 15:19:45,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-11 15:19:45,154 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:19:45,154 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:19:45,154 INFO L408 AbstractCegarLoop]: === Iteration 42 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:19:45,154 INFO L82 PathProgramCache]: Analyzing trace with hash 561312459, now seen corresponding path program 4 times [2018-04-11 15:19:45,154 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:19:45,154 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:19:45,154 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:45,155 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:19:45,155 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:45,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:45,161 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:19:45,174 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:19:45,174 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:19:45,174 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:19:45,174 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:19:45,197 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:19:45,197 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:19:45,200 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:19:45,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:19:45,203 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:45,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:19:45,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:45,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:45,212 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:19:45,224 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:45,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:19:45,227 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:45,234 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:45,235 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:45,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:19:45,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:45,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:45,240 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:19:45,461 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:19:45,461 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:19:45,461 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-11 15:19:45,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 15:19:45,462 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 15:19:45,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2018-04-11 15:19:45,462 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand 19 states. [2018-04-11 15:19:45,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:19:45,892 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2018-04-11 15:19:45,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-11 15:19:45,892 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 47 [2018-04-11 15:19:45,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:19:45,893 INFO L225 Difference]: With dead ends: 100 [2018-04-11 15:19:45,893 INFO L226 Difference]: Without dead ends: 100 [2018-04-11 15:19:45,893 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=945, Unknown=0, NotChecked=0, Total=1056 [2018-04-11 15:19:45,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-04-11 15:19:45,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 82. [2018-04-11 15:19:45,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-04-11 15:19:45,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2018-04-11 15:19:45,895 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 47 [2018-04-11 15:19:45,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:19:45,895 INFO L459 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2018-04-11 15:19:45,895 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 15:19:45,895 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2018-04-11 15:19:45,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-11 15:19:45,895 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:19:45,895 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:19:45,896 INFO L408 AbstractCegarLoop]: === Iteration 43 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:19:45,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1609925973, now seen corresponding path program 6 times [2018-04-11 15:19:45,896 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:19:45,896 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:19:45,896 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:45,896 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:19:45,896 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:45,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:45,907 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:19:45,926 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:19:45,926 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:19:45,926 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:19:45,926 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:19:45,972 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-04-11 15:19:45,973 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:19:45,977 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:19:45,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:19:45,986 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:45,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:45,990 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-11 15:19:46,004 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:19:46,004 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:46,013 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:46,014 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:46,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:19:46,015 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:46,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:46,021 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-04-11 15:19:46,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 15:19:46,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:19:46,056 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:46,058 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:46,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:46,066 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-04-11 15:19:46,165 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-11 15:19:46,167 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:19:46,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:46,171 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:46,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:46,181 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:28 [2018-04-11 15:19:46,253 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-11 15:19:46,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:19:46,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:46,259 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:46,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:46,268 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:30 [2018-04-11 15:19:46,349 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-11 15:19:46,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:19:46,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:46,355 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:46,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:46,365 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:30 [2018-04-11 15:19:46,455 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-11 15:19:46,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 8 treesize of output 7 [2018-04-11 15:19:46,457 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:46,459 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:46,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:19:46,463 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-04-11 15:19:46,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2018-04-11 15:19:46,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-11 15:19:46,527 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:19:46,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:19:46,536 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-11 15:19:46,536 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:30 [2018-04-11 15:19:46,605 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:19:46,605 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:19:46,605 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-11 15:19:46,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-11 15:19:46,606 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-11 15:19:46,606 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2018-04-11 15:19:46,606 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand 28 states. [2018-04-11 15:19:47,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:19:47,251 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2018-04-11 15:19:47,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 15:19:47,251 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 48 [2018-04-11 15:19:47,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:19:47,252 INFO L225 Difference]: With dead ends: 90 [2018-04-11 15:19:47,252 INFO L226 Difference]: Without dead ends: 90 [2018-04-11 15:19:47,252 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=141, Invalid=1341, Unknown=0, NotChecked=0, Total=1482 [2018-04-11 15:19:47,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-04-11 15:19:47,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 82. [2018-04-11 15:19:47,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-04-11 15:19:47,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2018-04-11 15:19:47,253 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 48 [2018-04-11 15:19:47,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:19:47,253 INFO L459 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2018-04-11 15:19:47,253 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-11 15:19:47,254 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2018-04-11 15:19:47,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 15:19:47,254 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:19:47,254 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:19:47,254 INFO L408 AbstractCegarLoop]: === Iteration 44 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:19:47,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1751770890, now seen corresponding path program 4 times [2018-04-11 15:19:47,254 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:19:47,254 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:19:47,254 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:47,255 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:19:47,255 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:47,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:47,262 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:19:47,266 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:19:47,266 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:19:47,267 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:19:47,267 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:19:47,292 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:19:47,292 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:19:47,295 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:19:47,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:19:47,297 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:47,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:47,298 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 15:19:47,302 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:47,311 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:47,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:19:47,312 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:47,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:19:47,316 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:47,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:47,319 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-11 15:19:47,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-04-11 15:19:47,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 15:19:47,332 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:47,333 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:47,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:47,335 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-11 15:19:47,401 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-11 15:19:47,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:19:47,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:47,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:47,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:47,412 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-04-11 15:19:47,419 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-11 15:19:47,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:19:47,420 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:47,425 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:47,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:47,429 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-04-11 15:19:47,442 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-11 15:19:47,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:19:47,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:47,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:47,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:47,450 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2018-04-11 15:19:47,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-04-11 15:19:47,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-04-11 15:19:47,476 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:19:47,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:19:47,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:19:47,483 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-04-11 15:19:47,558 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-04-11 15:19:47,559 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:19:47,559 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-11 15:19:47,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 15:19:47,559 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 15:19:47,559 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-04-11 15:19:47,560 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand 16 states. [2018-04-11 15:19:47,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:19:47,895 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2018-04-11 15:19:47,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 15:19:47,895 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 50 [2018-04-11 15:19:47,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:19:47,896 INFO L225 Difference]: With dead ends: 90 [2018-04-11 15:19:47,896 INFO L226 Difference]: Without dead ends: 90 [2018-04-11 15:19:47,896 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2018-04-11 15:19:47,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-04-11 15:19:47,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 82. [2018-04-11 15:19:47,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-04-11 15:19:47,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2018-04-11 15:19:47,897 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 50 [2018-04-11 15:19:47,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:19:47,897 INFO L459 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2018-04-11 15:19:47,897 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 15:19:47,897 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2018-04-11 15:19:47,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 15:19:47,897 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:19:47,898 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:19:47,898 INFO L408 AbstractCegarLoop]: === Iteration 45 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:19:47,898 INFO L82 PathProgramCache]: Analyzing trace with hash -2049434813, now seen corresponding path program 7 times [2018-04-11 15:19:47,898 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:19:47,898 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:19:47,899 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:47,899 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:19:47,899 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:47,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:47,909 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:19:47,920 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:19:47,920 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:19:47,920 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:19:47,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:19:47,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:47,949 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:19:47,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:19:47,959 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:47,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:47,960 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 15:19:47,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:19:47,967 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:47,973 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:47,974 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:47,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:19:47,974 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:47,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:47,978 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-11 15:19:47,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-04-11 15:19:47,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 12 treesize of output 11 [2018-04-11 15:19:47,998 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:47,999 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:48,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:48,003 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-11 15:19:48,052 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-11 15:19:48,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:19:48,054 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:48,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:48,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:48,062 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-04-11 15:19:48,076 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-11 15:19:48,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 8 treesize of output 7 [2018-04-11 15:19:48,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:48,081 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:48,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:48,084 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2018-04-11 15:19:48,103 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-11 15:19:48,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-04-11 15:19:48,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:48,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:48,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 15:19:48,123 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2018-04-11 15:19:48,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-04-11 15:19:48,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-04-11 15:19:48,179 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:19:48,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:19:48,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:19:48,189 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-04-11 15:19:48,240 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-04-11 15:19:48,240 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:19:48,240 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-11 15:19:48,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 15:19:48,241 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 15:19:48,241 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-04-11 15:19:48,241 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand 16 states. [2018-04-11 15:19:48,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:19:48,482 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2018-04-11 15:19:48,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 15:19:48,482 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 50 [2018-04-11 15:19:48,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:19:48,483 INFO L225 Difference]: With dead ends: 89 [2018-04-11 15:19:48,483 INFO L226 Difference]: Without dead ends: 57 [2018-04-11 15:19:48,483 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=590, Unknown=0, NotChecked=0, Total=702 [2018-04-11 15:19:48,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-04-11 15:19:48,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-04-11 15:19:48,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-04-11 15:19:48,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-04-11 15:19:48,484 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 50 [2018-04-11 15:19:48,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:19:48,484 INFO L459 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-04-11 15:19:48,484 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 15:19:48,484 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-04-11 15:19:48,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-04-11 15:19:48,484 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:19:48,484 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:19:48,485 INFO L408 AbstractCegarLoop]: === Iteration 46 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:19:48,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1658951737, now seen corresponding path program 5 times [2018-04-11 15:19:48,485 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:19:48,485 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:19:48,485 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:48,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:19:48,485 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:48,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:48,492 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:19:48,508 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:19:48,508 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:19:48,508 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:19:48,509 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:19:48,546 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-04-11 15:19:48,546 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:19:48,549 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:19:49,059 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 44 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:19:49,059 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:19:49,059 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-11 15:19:49,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 15:19:49,060 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 15:19:49,060 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2018-04-11 15:19:49,060 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 19 states. [2018-04-11 15:19:50,142 WARN L151 SmtUtils]: Spent 158ms on a formula simplification. DAG size of input: 74 DAG size of output 69 [2018-04-11 15:19:52,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:19:52,121 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2018-04-11 15:19:52,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 15:19:52,121 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 52 [2018-04-11 15:19:52,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:19:52,121 INFO L225 Difference]: With dead ends: 56 [2018-04-11 15:19:52,121 INFO L226 Difference]: Without dead ends: 0 [2018-04-11 15:19:52,122 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=198, Invalid=992, Unknown=0, NotChecked=0, Total=1190 [2018-04-11 15:19:52,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-04-11 15:19:52,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-04-11 15:19:52,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-04-11 15:19:52,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-04-11 15:19:52,122 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2018-04-11 15:19:52,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:19:52,122 INFO L459 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-04-11 15:19:52,122 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 15:19:52,122 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-04-11 15:19:52,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-04-11 15:19:52,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 03:19:52 BoogieIcfgContainer [2018-04-11 15:19:52,126 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 15:19:52,126 INFO L168 Benchmark]: Toolchain (without parser) took 33170.33 ms. Allocated memory was 397.9 MB in the beginning and 1.0 GB in the end (delta: 637.0 MB). Free memory was 329.3 MB in the beginning and 813.1 MB in the end (delta: -483.8 MB). Peak memory consumption was 153.2 MB. Max. memory is 5.3 GB. [2018-04-11 15:19:52,127 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 397.9 MB. Free memory is still 355.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 15:19:52,127 INFO L168 Benchmark]: CACSL2BoogieTranslator took 234.02 ms. Allocated memory is still 397.9 MB. Free memory was 328.0 MB in the beginning and 304.2 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. [2018-04-11 15:19:52,127 INFO L168 Benchmark]: Boogie Preprocessor took 41.86 ms. Allocated memory is still 397.9 MB. Free memory was 304.2 MB in the beginning and 301.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-11 15:19:52,127 INFO L168 Benchmark]: RCFGBuilder took 401.08 ms. Allocated memory was 397.9 MB in the beginning and 609.2 MB in the end (delta: 211.3 MB). Free memory was 301.5 MB in the beginning and 542.5 MB in the end (delta: -241.0 MB). Peak memory consumption was 23.9 MB. Max. memory is 5.3 GB. [2018-04-11 15:19:52,127 INFO L168 Benchmark]: TraceAbstraction took 32490.25 ms. Allocated memory was 609.2 MB in the beginning and 1.0 GB in the end (delta: 425.7 MB). Free memory was 542.5 MB in the beginning and 813.1 MB in the end (delta: -270.6 MB). Peak memory consumption was 155.1 MB. Max. memory is 5.3 GB. [2018-04-11 15:19:52,128 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 397.9 MB. Free memory is still 355.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 234.02 ms. Allocated memory is still 397.9 MB. Free memory was 328.0 MB in the beginning and 304.2 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 41.86 ms. Allocated memory is still 397.9 MB. Free memory was 304.2 MB in the beginning and 301.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 401.08 ms. Allocated memory was 397.9 MB in the beginning and 609.2 MB in the end (delta: 211.3 MB). Free memory was 301.5 MB in the beginning and 542.5 MB in the end (delta: -241.0 MB). Peak memory consumption was 23.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 32490.25 ms. Allocated memory was 609.2 MB in the beginning and 1.0 GB in the end (delta: 425.7 MB). Free memory was 542.5 MB in the beginning and 813.1 MB in the end (delta: -270.6 MB). Peak memory consumption was 155.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 554]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 554]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 572]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 571]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 572]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 560]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 571]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 13 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 61 locations, 13 error locations. SAFE Result, 32.4s OverallTime, 46 OverallIterations, 6 TraceHistogramMax, 19.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1605 SDtfs, 2409 SDslu, 10487 SDs, 0 SdLazy, 12213 SolverSat, 512 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1618 GetRequests, 749 SyntacticMatches, 3 SemanticMatches, 866 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3598 ImplicationChecksByTransitivity, 17.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=22, 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, 46 MinimizatonAttempts, 337 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 11.6s InterpolantComputationTime, 2704 NumberOfCodeBlocks, 2704 NumberOfCodeBlocksAsserted, 117 NumberOfCheckSat, 1502 ConstructedInterpolants, 133 QuantifiedInterpolants, 880446 SizeOfPredicates, 596 NumberOfNonLiveVariables, 6315 ConjunctsInSsa, 2007 ConjunctsInUnsatCore, 48 InterpolantComputations, 19 PerfectInterpolantSequences, 110/672 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_15-19-52-134.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_15-19-52-134.csv Received shutdown request...