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_cstrncpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 15:20:10,591 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 15:20:10,592 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 15:20:10,605 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 15:20:10,605 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 15:20:10,605 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 15:20:10,606 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 15:20:10,608 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 15:20:10,609 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 15:20:10,610 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 15:20:10,610 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 15:20:10,611 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 15:20:10,611 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 15:20:10,612 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 15:20:10,613 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 15:20:10,614 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 15:20:10,616 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 15:20:10,617 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 15:20:10,618 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 15:20:10,619 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 15:20:10,620 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 15:20:10,620 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 15:20:10,621 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 15:20:10,622 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 15:20:10,622 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 15:20:10,623 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 15:20:10,623 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 15:20:10,624 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 15:20:10,624 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 15:20:10,624 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 15:20:10,625 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 15:20:10,625 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:20:10,645 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 15:20:10,645 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 15:20:10,646 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 15:20:10,647 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 15:20:10,647 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 15:20:10,647 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 15:20:10,647 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 15:20:10,647 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 15:20:10,647 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 15:20:10,647 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 15:20:10,647 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 15:20:10,647 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 15:20:10,648 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 15:20:10,648 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 15:20:10,648 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 15:20:10,648 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 15:20:10,648 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 15:20:10,648 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 15:20:10,648 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 15:20:10,648 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 15:20:10,648 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 15:20:10,648 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 15:20:10,649 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 15:20:10,649 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:20:10,679 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 15:20:10,689 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 15:20:10,693 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 15:20:10,696 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 15:20:10,696 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 15:20:10,697 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:10,974 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG8af6b27f4 [2018-04-11 15:20:11,100 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 15:20:11,100 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 15:20:11,100 INFO L168 CDTParser]: Scanning openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,107 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 15:20:11,107 INFO L215 ultiparseSymbolTable]: [2018-04-11 15:20:11,108 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 15:20:11,108 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpy ('cstrncpy') in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,108 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____bswap_64 ('__bswap_64') in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,108 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,108 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____bswap_32 ('__bswap_32') in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,108 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 15:20:11,108 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____blkcnt64_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,108 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__gid_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,108 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__ldiv_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,108 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____socklen_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,108 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__u_short in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,108 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__u_int64_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,108 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__off_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,108 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__int8_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,108 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____mode_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,108 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____intptr_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,109 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____timer_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,109 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____uint64_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,109 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____fsword_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,109 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__ssize_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,109 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__key_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,109 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____uid_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,109 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____int8_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,109 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__mode_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,109 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____ssize_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,109 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__timer_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,109 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____nlink_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,109 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____sig_atomic_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,109 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__int32_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,109 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__pid_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,109 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__fsfilcnt_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,109 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____u_short in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,109 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__u_int8_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,110 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____uint32_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,110 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__uid_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,110 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____fd_mask in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,110 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____suseconds_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,110 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_spinlock_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,110 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__blksize_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,110 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__u_int16_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,110 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__caddr_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,110 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__div_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,110 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,110 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____int32_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,111 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____id_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,111 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____syscall_ulong_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,111 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__u_int in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,111 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__fsblkcnt_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,111 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_once_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,111 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_mutexattr_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,111 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____pid_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,111 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__size_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,111 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_cond_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,111 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__quad_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,112 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____fsblkcnt64_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,112 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____u_char in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,112 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__blkcnt_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,112 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____off64_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,112 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____clockid_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,112 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____pthread_list_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,112 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____u_quad_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,112 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__int16_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,112 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__lldiv_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,112 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_attr_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,112 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_barrier_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,113 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____rlim_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,113 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__wchar_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,113 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_rwlockattr_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,113 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____quad_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,113 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____fsid_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,113 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__u_char in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,113 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__daddr_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,113 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____gid_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,113 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____ino64_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,113 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____u_long in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,113 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____uint16_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,114 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____int16_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,114 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__sigset_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,114 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____WAIT_STATUS in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,114 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__suseconds_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,114 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__fd_mask in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,114 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____sigset_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,114 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____ino_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,114 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__u_int32_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,114 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__fsid_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,114 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____loff_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,114 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__ulong in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,114 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____off_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,115 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__clockid_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,115 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__u_long in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,115 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____dev_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,115 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____caddr_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,115 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__fd_set in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,115 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__clock_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,115 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____rlim64_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,115 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__id_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,115 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_condattr_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,115 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____uint8_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,115 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____key_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,115 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__nlink_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,115 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__uint in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,115 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____u_int in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,115 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__loff_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,115 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__time_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,115 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_rwlock_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,115 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____blksize_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,115 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____daddr_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,116 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____qaddr_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,116 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____clock_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,116 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__dev_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,116 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__int64_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,116 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____fsfilcnt_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,116 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__ushort in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,116 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____syscall_slong_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,116 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____time_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,116 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____blkcnt_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,116 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__u_quad_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,116 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_key_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,116 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____int64_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,116 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__register_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,116 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_barrierattr_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,117 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____fsblkcnt_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,117 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__ino_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,117 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_mutex_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,117 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____useconds_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,117 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____fsfilcnt64_t in openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,131 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG8af6b27f4 [2018-04-11 15:20:11,134 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 15:20:11,134 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 15:20:11,135 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 15:20:11,135 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 15:20:11,141 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 15:20:11,142 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 03:20:11" (1/1) ... [2018-04-11 15:20:11,145 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bfb42b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:20:11, skipping insertion in model container [2018-04-11 15:20:11,145 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 03:20:11" (1/1) ... [2018-04-11 15:20:11,162 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 15:20:11,182 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 15:20:11,313 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 15:20:11,350 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 15:20:11,357 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-11 15:20:11,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:20:11 WrapperNode [2018-04-11 15:20:11,385 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 15:20:11,386 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 15:20:11,386 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 15:20:11,386 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 15:20:11,394 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:20:11" (1/1) ... [2018-04-11 15:20:11,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:20:11" (1/1) ... [2018-04-11 15:20:11,406 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:20:11" (1/1) ... [2018-04-11 15:20:11,406 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:20:11" (1/1) ... [2018-04-11 15:20:11,413 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:20:11" (1/1) ... [2018-04-11 15:20:11,417 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:20:11" (1/1) ... [2018-04-11 15:20:11,419 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:20:11" (1/1) ... [2018-04-11 15:20:11,423 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 15:20:11,423 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 15:20:11,423 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 15:20:11,424 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 15:20:11,424 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:20:11" (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:20:11,509 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 15:20:11,510 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 15:20:11,510 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-11 15:20:11,510 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-11 15:20:11,510 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpy [2018-04-11 15:20:11,510 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 15:20:11,510 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-11 15:20:11,510 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-11 15:20:11,510 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 15:20:11,510 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 15:20:11,510 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 15:20:11,511 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 15:20:11,511 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 15:20:11,511 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 15:20:11,511 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 15:20:11,511 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 15:20:11,511 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 15:20:11,511 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 15:20:11,511 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 15:20:11,511 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 15:20:11,511 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 15:20:11,512 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 15:20:11,512 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 15:20:11,512 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 15:20:11,512 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 15:20:11,512 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 15:20:11,512 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 15:20:11,512 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 15:20:11,512 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 15:20:11,512 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 15:20:11,512 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 15:20:11,512 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 15:20:11,513 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 15:20:11,513 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 15:20:11,513 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 15:20:11,513 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 15:20:11,513 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 15:20:11,513 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 15:20:11,513 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 15:20:11,513 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 15:20:11,513 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 15:20:11,514 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 15:20:11,514 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 15:20:11,514 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 15:20:11,514 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 15:20:11,514 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 15:20:11,514 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 15:20:11,514 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 15:20:11,514 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 15:20:11,514 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 15:20:11,515 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 15:20:11,515 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 15:20:11,515 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 15:20:11,515 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 15:20:11,515 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 15:20:11,515 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 15:20:11,515 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 15:20:11,515 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 15:20:11,515 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 15:20:11,516 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 15:20:11,516 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 15:20:11,516 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 15:20:11,516 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 15:20:11,516 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 15:20:11,516 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 15:20:11,516 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 15:20:11,516 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 15:20:11,516 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 15:20:11,516 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 15:20:11,516 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 15:20:11,516 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 15:20:11,516 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 15:20:11,516 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 15:20:11,516 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 15:20:11,517 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 15:20:11,517 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 15:20:11,517 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 15:20:11,517 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 15:20:11,517 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 15:20:11,517 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 15:20:11,517 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 15:20:11,517 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 15:20:11,517 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 15:20:11,517 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 15:20:11,517 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 15:20:11,517 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 15:20:11,517 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 15:20:11,517 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 15:20:11,518 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 15:20:11,518 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 15:20:11,518 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 15:20:11,518 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 15:20:11,518 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 15:20:11,518 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 15:20:11,518 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 15:20:11,518 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 15:20:11,518 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 15:20:11,518 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 15:20:11,518 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 15:20:11,518 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 15:20:11,518 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 15:20:11,519 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 15:20:11,519 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 15:20:11,519 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 15:20:11,519 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 15:20:11,519 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 15:20:11,519 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 15:20:11,519 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 15:20:11,519 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 15:20:11,519 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpy [2018-04-11 15:20:11,519 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 15:20:11,520 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 15:20:11,520 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 15:20:11,520 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 15:20:11,520 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 15:20:11,520 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 15:20:11,520 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 15:20:11,520 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 15:20:11,787 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 15:20:11,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 03:20:11 BoogieIcfgContainer [2018-04-11 15:20:11,788 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 15:20:11,789 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 15:20:11,789 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 15:20:11,791 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 15:20:11,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 03:20:11" (1/3) ... [2018-04-11 15:20:11,792 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aa944aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 03:20:11, skipping insertion in model container [2018-04-11 15:20:11,792 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:20:11" (2/3) ... [2018-04-11 15:20:11,792 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aa944aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 03:20:11, skipping insertion in model container [2018-04-11 15:20:11,793 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 03:20:11" (3/3) ... [2018-04-11 15:20:11,794 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:20:11,800 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 15:20:11,806 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-04-11 15:20:11,830 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 15:20:11,830 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 15:20:11,830 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 15:20:11,830 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 15:20:11,831 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 15:20:11,831 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 15:20:11,831 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 15:20:11,831 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 15:20:11,831 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 15:20:11,831 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 15:20:11,840 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2018-04-11 15:20:11,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-11 15:20:11,847 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:20:11,847 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:20:11,847 INFO L408 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:20:11,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1266094566, now seen corresponding path program 1 times [2018-04-11 15:20:11,851 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:20:11,851 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:20:11,886 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:11,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:20:11,886 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:11,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:11,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:20:11,977 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:20:11,979 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:20:11,979 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:20:11,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 15:20:11,991 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 15:20:11,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:20:11,993 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 4 states. [2018-04-11 15:20:12,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:20:12,088 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-04-11 15:20:12,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 15:20:12,089 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-04-11 15:20:12,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:20:12,096 INFO L225 Difference]: With dead ends: 47 [2018-04-11 15:20:12,096 INFO L226 Difference]: Without dead ends: 44 [2018-04-11 15:20:12,098 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:20:12,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-04-11 15:20:12,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-04-11 15:20:12,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-04-11 15:20:12,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-04-11 15:20:12,122 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 13 [2018-04-11 15:20:12,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:20:12,123 INFO L459 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-04-11 15:20:12,123 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 15:20:12,123 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-04-11 15:20:12,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-11 15:20:12,123 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:20:12,123 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:20:12,124 INFO L408 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:20:12,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1266094567, now seen corresponding path program 1 times [2018-04-11 15:20:12,124 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:20:12,124 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:20:12,125 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:12,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:20:12,125 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:12,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:12,138 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:20:12,220 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:20:12,220 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:20:12,220 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 15:20:12,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:20:12,221 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:20:12,222 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:20:12,222 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 5 states. [2018-04-11 15:20:12,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:20:12,244 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-04-11 15:20:12,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:20:12,245 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-04-11 15:20:12,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:20:12,245 INFO L225 Difference]: With dead ends: 43 [2018-04-11 15:20:12,245 INFO L226 Difference]: Without dead ends: 43 [2018-04-11 15:20:12,246 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:20:12,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-04-11 15:20:12,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-04-11 15:20:12,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-04-11 15:20:12,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-04-11 15:20:12,249 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 13 [2018-04-11 15:20:12,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:20:12,249 INFO L459 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-04-11 15:20:12,249 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:20:12,249 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-04-11 15:20:12,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-11 15:20:12,249 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:20:12,250 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:20:12,250 INFO L408 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:20:12,250 INFO L82 PathProgramCache]: Analyzing trace with hash -721973959, now seen corresponding path program 1 times [2018-04-11 15:20:12,250 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:20:12,250 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:20:12,250 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:12,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:20:12,251 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:12,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:12,266 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:20:12,316 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:20:12,316 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:20:12,316 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 15:20:12,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 15:20:12,316 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 15:20:12,317 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-11 15:20:12,317 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 7 states. [2018-04-11 15:20:12,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:20:12,411 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2018-04-11 15:20:12,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 15:20:12,411 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-04-11 15:20:12,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:20:12,413 INFO L225 Difference]: With dead ends: 45 [2018-04-11 15:20:12,413 INFO L226 Difference]: Without dead ends: 45 [2018-04-11 15:20:12,414 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-04-11 15:20:12,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-04-11 15:20:12,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-04-11 15:20:12,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-04-11 15:20:12,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-04-11 15:20:12,418 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 18 [2018-04-11 15:20:12,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:20:12,418 INFO L459 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-04-11 15:20:12,418 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 15:20:12,418 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-04-11 15:20:12,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-11 15:20:12,419 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:20:12,419 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:20:12,419 INFO L408 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:20:12,419 INFO L82 PathProgramCache]: Analyzing trace with hash -721973958, now seen corresponding path program 1 times [2018-04-11 15:20:12,419 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:20:12,419 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:20:12,420 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:12,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:20:12,420 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:12,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:12,435 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:20:12,526 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:20:12,526 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:20:12,526 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-11 15:20:12,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 15:20:12,527 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 15:20:12,527 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-04-11 15:20:12,527 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 10 states. [2018-04-11 15:20:12,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:20:12,670 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-04-11 15:20:12,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 15:20:12,670 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-04-11 15:20:12,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:20:12,671 INFO L225 Difference]: With dead ends: 48 [2018-04-11 15:20:12,671 INFO L226 Difference]: Without dead ends: 48 [2018-04-11 15:20:12,672 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-04-11 15:20:12,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-04-11 15:20:12,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-04-11 15:20:12,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-04-11 15:20:12,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-04-11 15:20:12,677 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 18 [2018-04-11 15:20:12,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:20:12,677 INFO L459 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-04-11 15:20:12,677 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 15:20:12,677 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-04-11 15:20:12,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-11 15:20:12,678 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:20:12,678 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:20:12,678 INFO L408 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:20:12,678 INFO L82 PathProgramCache]: Analyzing trace with hash -906356268, now seen corresponding path program 1 times [2018-04-11 15:20:12,678 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:20:12,678 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:20:12,679 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:12,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:20:12,679 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:12,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:12,700 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:20:12,706 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:20:12,707 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:20:12,707 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:20:12,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:20:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:12,751 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:20:12,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:20:12,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:12,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:12,776 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 15:20:12,784 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:12,784 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:12,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 15:20:12,786 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:12,792 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:20:12,792 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-04-11 15:20:12,862 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:20:12,863 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:20:12,863 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 15:20:12,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 15:20:12,863 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 15:20:12,863 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-04-11 15:20:12,863 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 9 states. [2018-04-11 15:20:13,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:20:13,003 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-04-11 15:20:13,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 15:20:13,003 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-04-11 15:20:13,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:20:13,004 INFO L225 Difference]: With dead ends: 46 [2018-04-11 15:20:13,004 INFO L226 Difference]: Without dead ends: 46 [2018-04-11 15:20:13,004 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2018-04-11 15:20:13,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-04-11 15:20:13,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2018-04-11 15:20:13,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-04-11 15:20:13,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-04-11 15:20:13,008 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 19 [2018-04-11 15:20:13,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:20:13,008 INFO L459 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-04-11 15:20:13,008 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 15:20:13,008 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-04-11 15:20:13,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-11 15:20:13,008 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:20:13,009 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:20:13,009 INFO L408 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:20:13,009 INFO L82 PathProgramCache]: Analyzing trace with hash -906356267, now seen corresponding path program 1 times [2018-04-11 15:20:13,009 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:20:13,009 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:20:13,009 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:13,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:20:13,009 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:13,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:13,023 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:20:13,026 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:20:13,026 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:20:13,026 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:20:13,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:20:13,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:13,055 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:20:13,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 6 treesize of output 5 [2018-04-11 15:20:13,064 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:13,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:20:13,069 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:13,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:13,074 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:17 [2018-04-11 15:20:13,096 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:13,096 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:13,097 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:20:13,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:13,103 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:20:13,104 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:13,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:13,109 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2018-04-11 15:20:13,221 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:20:13,222 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:20:13,222 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-04-11 15:20:13,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 15:20:13,222 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 15:20:13,223 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-04-11 15:20:13,223 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 14 states. [2018-04-11 15:20:13,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:20:13,670 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2018-04-11 15:20:13,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 15:20:13,670 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 19 [2018-04-11 15:20:13,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:20:13,671 INFO L225 Difference]: With dead ends: 81 [2018-04-11 15:20:13,671 INFO L226 Difference]: Without dead ends: 81 [2018-04-11 15:20:13,671 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2018-04-11 15:20:13,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-04-11 15:20:13,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 69. [2018-04-11 15:20:13,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-04-11 15:20:13,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 83 transitions. [2018-04-11 15:20:13,677 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 83 transitions. Word has length 19 [2018-04-11 15:20:13,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:20:13,677 INFO L459 AbstractCegarLoop]: Abstraction has 69 states and 83 transitions. [2018-04-11 15:20:13,677 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 15:20:13,677 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 83 transitions. [2018-04-11 15:20:13,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-11 15:20:13,678 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:20:13,678 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:20:13,678 INFO L408 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:20:13,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1493162281, now seen corresponding path program 1 times [2018-04-11 15:20:13,679 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:20:13,679 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:20:13,679 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:13,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:20:13,680 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:13,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:13,689 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:20:13,691 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:20:13,691 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:20:13,691 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:20:13,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:20:13,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:13,718 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:20:13,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:20:13,749 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:13,755 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:20:13,755 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:13,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:13,761 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:20:13,778 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:13,780 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:20:13,780 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:13,790 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:13,790 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:13,791 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:20:13,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:13,795 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:20:13,795 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:20:13,824 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:20:13,824 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:20:13,824 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-11 15:20:13,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 15:20:13,825 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 15:20:13,825 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-04-11 15:20:13,825 INFO L87 Difference]: Start difference. First operand 69 states and 83 transitions. Second operand 10 states. [2018-04-11 15:20:13,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:20:13,934 INFO L93 Difference]: Finished difference Result 72 states and 88 transitions. [2018-04-11 15:20:13,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 15:20:13,934 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2018-04-11 15:20:13,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:20:13,935 INFO L225 Difference]: With dead ends: 72 [2018-04-11 15:20:13,935 INFO L226 Difference]: Without dead ends: 72 [2018-04-11 15:20:13,936 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-04-11 15:20:13,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-04-11 15:20:13,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 44. [2018-04-11 15:20:13,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-04-11 15:20:13,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-04-11 15:20:13,939 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 19 [2018-04-11 15:20:13,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:20:13,939 INFO L459 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-04-11 15:20:13,939 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 15:20:13,939 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-04-11 15:20:13,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-11 15:20:13,940 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:20:13,940 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] [2018-04-11 15:20:13,940 INFO L408 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:20:13,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1952905089, now seen corresponding path program 1 times [2018-04-11 15:20:13,940 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:20:13,940 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:20:13,941 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:13,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:20:13,941 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:13,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:13,950 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:20:13,971 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:20:13,972 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:20:13,972 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 15:20:13,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:20:13,972 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:20:13,972 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:20:13,972 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 5 states. [2018-04-11 15:20:13,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:20:13,999 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-04-11 15:20:13,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:20:13,999 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-04-11 15:20:13,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:20:13,999 INFO L225 Difference]: With dead ends: 46 [2018-04-11 15:20:13,999 INFO L226 Difference]: Without dead ends: 46 [2018-04-11 15:20:14,000 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-11 15:20:14,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-04-11 15:20:14,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2018-04-11 15:20:14,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-04-11 15:20:14,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-04-11 15:20:14,001 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 24 [2018-04-11 15:20:14,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:20:14,002 INFO L459 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-04-11 15:20:14,002 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:20:14,002 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-04-11 15:20:14,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-11 15:20:14,002 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:20:14,002 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:20:14,002 INFO L408 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:20:14,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1952905090, now seen corresponding path program 1 times [2018-04-11 15:20:14,003 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:20:14,003 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:20:14,003 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:14,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:20:14,003 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:14,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:14,015 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:20:14,095 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:20:14,095 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:20:14,095 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 15:20:14,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 15:20:14,095 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 15:20:14,095 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:20:14,095 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 6 states. [2018-04-11 15:20:14,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:20:14,135 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2018-04-11 15:20:14,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:20:14,136 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-04-11 15:20:14,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:20:14,136 INFO L225 Difference]: With dead ends: 83 [2018-04-11 15:20:14,136 INFO L226 Difference]: Without dead ends: 83 [2018-04-11 15:20:14,136 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-04-11 15:20:14,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-04-11 15:20:14,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 72. [2018-04-11 15:20:14,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-04-11 15:20:14,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2018-04-11 15:20:14,139 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 24 [2018-04-11 15:20:14,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:20:14,139 INFO L459 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2018-04-11 15:20:14,139 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 15:20:14,139 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2018-04-11 15:20:14,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-11 15:20:14,140 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:20:14,140 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:20:14,140 INFO L408 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:20:14,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1971931289, now seen corresponding path program 1 times [2018-04-11 15:20:14,140 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:20:14,140 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:20:14,141 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:14,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:20:14,141 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:14,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:14,151 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:20:14,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:20:14,228 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:20:14,228 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 15:20:14,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 15:20:14,228 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 15:20:14,228 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:20:14,228 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand 6 states. [2018-04-11 15:20:14,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:20:14,270 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2018-04-11 15:20:14,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:20:14,270 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-04-11 15:20:14,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:20:14,270 INFO L225 Difference]: With dead ends: 70 [2018-04-11 15:20:14,270 INFO L226 Difference]: Without dead ends: 70 [2018-04-11 15:20:14,270 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-04-11 15:20:14,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-04-11 15:20:14,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 63. [2018-04-11 15:20:14,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-04-11 15:20:14,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2018-04-11 15:20:14,274 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 24 [2018-04-11 15:20:14,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:20:14,274 INFO L459 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2018-04-11 15:20:14,274 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 15:20:14,274 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2018-04-11 15:20:14,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-11 15:20:14,275 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:20:14,275 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] [2018-04-11 15:20:14,275 INFO L408 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:20:14,275 INFO L82 PathProgramCache]: Analyzing trace with hash 364557188, now seen corresponding path program 1 times [2018-04-11 15:20:14,275 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:20:14,275 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:20:14,276 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:14,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:20:14,276 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:14,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:14,285 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:20:14,287 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:20:14,287 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:20:14,288 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:20:14,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:20:14,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:14,308 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:20:14,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:20:14,338 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:14,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:20:14,343 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:14,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:14,347 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:20:14,364 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:14,365 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:20:14,365 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:14,403 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:14,404 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:14,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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:20:14,405 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:14,412 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:20:14,413 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:20:14,505 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:20:14,506 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:20:14,506 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-04-11 15:20:14,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 15:20:14,506 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 15:20:14,506 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-04-11 15:20:14,506 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand 13 states. [2018-04-11 15:20:14,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:20:14,759 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2018-04-11 15:20:14,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 15:20:14,759 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-04-11 15:20:14,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:20:14,760 INFO L225 Difference]: With dead ends: 73 [2018-04-11 15:20:14,760 INFO L226 Difference]: Without dead ends: 73 [2018-04-11 15:20:14,761 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2018-04-11 15:20:14,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-04-11 15:20:14,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 68. [2018-04-11 15:20:14,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-04-11 15:20:14,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2018-04-11 15:20:14,764 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 24 [2018-04-11 15:20:14,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:20:14,764 INFO L459 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2018-04-11 15:20:14,765 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 15:20:14,765 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2018-04-11 15:20:14,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-11 15:20:14,765 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:20:14,765 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:20:14,765 INFO L408 AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:20:14,766 INFO L82 PathProgramCache]: Analyzing trace with hash 383583387, now seen corresponding path program 1 times [2018-04-11 15:20:14,766 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:20:14,766 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:20:14,766 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:14,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:20:14,767 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:14,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:14,776 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:20:14,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:20:14,845 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:20:14,845 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-11 15:20:14,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 15:20:14,845 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 15:20:14,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-04-11 15:20:14,846 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand 11 states. [2018-04-11 15:20:14,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:20:14,943 INFO L93 Difference]: Finished difference Result 119 states and 130 transitions. [2018-04-11 15:20:14,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 15:20:14,943 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2018-04-11 15:20:14,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:20:14,944 INFO L225 Difference]: With dead ends: 119 [2018-04-11 15:20:14,944 INFO L226 Difference]: Without dead ends: 119 [2018-04-11 15:20:14,945 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2018-04-11 15:20:14,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-04-11 15:20:14,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 111. [2018-04-11 15:20:14,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-04-11 15:20:14,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 124 transitions. [2018-04-11 15:20:14,949 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 124 transitions. Word has length 24 [2018-04-11 15:20:14,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:20:14,949 INFO L459 AbstractCegarLoop]: Abstraction has 111 states and 124 transitions. [2018-04-11 15:20:14,949 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 15:20:14,949 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 124 transitions. [2018-04-11 15:20:14,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-11 15:20:14,950 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:20:14,950 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:20:14,950 INFO L408 AbstractCegarLoop]: === Iteration 13 === [__U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:20:14,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1610561319, now seen corresponding path program 1 times [2018-04-11 15:20:14,950 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:20:14,950 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:20:14,950 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:14,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:20:14,951 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:14,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:14,961 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:20:15,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:20:15,094 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:20:15,094 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:20:15,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:20:15,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:15,115 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:20:15,119 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:20:15,120 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:15,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:15,122 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 15:20:15,146 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:20:15,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:20:15,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:15,151 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:15,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:15,154 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-04-11 15:20:15,263 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:20:15,277 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:20:15,278 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:20:15,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:20:15,289 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:20:15,289 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:54 [2018-04-11 15:20:15,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:20:15,366 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:20:15,367 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2018-04-11 15:20:15,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 15:20:15,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 15:20:15,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2018-04-11 15:20:15,367 INFO L87 Difference]: Start difference. First operand 111 states and 124 transitions. Second operand 23 states. [2018-04-11 15:20:15,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:20:15,900 INFO L93 Difference]: Finished difference Result 137 states and 151 transitions. [2018-04-11 15:20:15,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 15:20:15,900 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 24 [2018-04-11 15:20:15,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:20:15,901 INFO L225 Difference]: With dead ends: 137 [2018-04-11 15:20:15,901 INFO L226 Difference]: Without dead ends: 137 [2018-04-11 15:20:15,901 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=141, Invalid=981, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 15:20:15,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-04-11 15:20:15,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 115. [2018-04-11 15:20:15,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-04-11 15:20:15,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 129 transitions. [2018-04-11 15:20:15,905 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 129 transitions. Word has length 24 [2018-04-11 15:20:15,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:20:15,905 INFO L459 AbstractCegarLoop]: Abstraction has 115 states and 129 transitions. [2018-04-11 15:20:15,905 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 15:20:15,905 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2018-04-11 15:20:15,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-11 15:20:15,906 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:20:15,906 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:20:15,906 INFO L408 AbstractCegarLoop]: === Iteration 14 === [__U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:20:15,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1421492521, now seen corresponding path program 1 times [2018-04-11 15:20:15,907 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:20:15,907 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:20:15,907 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:15,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:20:15,908 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:15,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:15,913 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:20:15,915 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:20:15,915 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:20:15,915 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:20:15,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:20:15,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:15,923 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:20:15,941 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:20:15,941 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:20:15,941 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 15:20:15,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 15:20:15,942 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 15:20:15,942 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:20:15,942 INFO L87 Difference]: Start difference. First operand 115 states and 129 transitions. Second operand 6 states. [2018-04-11 15:20:15,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:20:15,972 INFO L93 Difference]: Finished difference Result 121 states and 133 transitions. [2018-04-11 15:20:15,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:20:15,972 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-04-11 15:20:15,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:20:15,972 INFO L225 Difference]: With dead ends: 121 [2018-04-11 15:20:15,972 INFO L226 Difference]: Without dead ends: 115 [2018-04-11 15:20:15,973 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 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:20:15,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-04-11 15:20:15,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-04-11 15:20:15,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-04-11 15:20:15,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 127 transitions. [2018-04-11 15:20:15,977 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 127 transitions. Word has length 25 [2018-04-11 15:20:15,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:20:15,977 INFO L459 AbstractCegarLoop]: Abstraction has 115 states and 127 transitions. [2018-04-11 15:20:15,977 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 15:20:15,977 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 127 transitions. [2018-04-11 15:20:15,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-11 15:20:15,978 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:20:15,978 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] [2018-04-11 15:20:15,978 INFO L408 AbstractCegarLoop]: === Iteration 15 === [__U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:20:15,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1612206614, now seen corresponding path program 1 times [2018-04-11 15:20:15,978 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:20:15,979 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:20:15,979 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:15,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:20:15,979 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:15,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:15,987 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:20:15,990 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:20:15,990 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:20:15,990 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:20:15,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:20:16,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:16,010 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:20:16,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:20:16,015 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:16,020 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:20:16,020 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:16,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:16,024 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:20:16,071 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:16,074 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:16,075 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:20:16,076 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:16,087 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:20:16,087 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:16,095 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:20:16,095 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:20:16,221 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:20:16,221 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:20:16,221 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-11 15:20:16,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 15:20:16,221 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 15:20:16,221 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-04-11 15:20:16,221 INFO L87 Difference]: Start difference. First operand 115 states and 127 transitions. Second operand 14 states. [2018-04-11 15:20:16,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:20:16,486 INFO L93 Difference]: Finished difference Result 117 states and 130 transitions. [2018-04-11 15:20:16,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 15:20:16,486 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2018-04-11 15:20:16,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:20:16,486 INFO L225 Difference]: With dead ends: 117 [2018-04-11 15:20:16,486 INFO L226 Difference]: Without dead ends: 117 [2018-04-11 15:20:16,487 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2018-04-11 15:20:16,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-04-11 15:20:16,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2018-04-11 15:20:16,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-04-11 15:20:16,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 128 transitions. [2018-04-11 15:20:16,490 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 128 transitions. Word has length 25 [2018-04-11 15:20:16,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:20:16,490 INFO L459 AbstractCegarLoop]: Abstraction has 116 states and 128 transitions. [2018-04-11 15:20:16,491 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 15:20:16,491 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 128 transitions. [2018-04-11 15:20:16,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 15:20:16,492 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:20:16,492 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:20:16,492 INFO L408 AbstractCegarLoop]: === Iteration 16 === [__U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:20:16,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1047432254, now seen corresponding path program 1 times [2018-04-11 15:20:16,492 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:20:16,492 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:20:16,493 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:16,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:20:16,493 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:16,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:16,503 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:20:16,505 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:20:16,505 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:20:16,505 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:20:16,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:20:16,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:16,530 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:20:16,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:20:16,539 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:16,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:20:16,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:16,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:16,550 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:20:16,568 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:16,568 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:16,569 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:20:16,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:16,578 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:20:16,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:16,585 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:20:16,585 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:20:16,730 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:20:16,730 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:20:16,730 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-11 15:20:16,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 15:20:16,731 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 15:20:16,731 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-04-11 15:20:16,731 INFO L87 Difference]: Start difference. First operand 116 states and 128 transitions. Second operand 15 states. [2018-04-11 15:20:17,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:20:17,055 INFO L93 Difference]: Finished difference Result 128 states and 142 transitions. [2018-04-11 15:20:17,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 15:20:17,055 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2018-04-11 15:20:17,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:20:17,056 INFO L225 Difference]: With dead ends: 128 [2018-04-11 15:20:17,056 INFO L226 Difference]: Without dead ends: 128 [2018-04-11 15:20:17,056 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2018-04-11 15:20:17,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-04-11 15:20:17,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2018-04-11 15:20:17,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-04-11 15:20:17,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 140 transitions. [2018-04-11 15:20:17,058 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 140 transitions. Word has length 29 [2018-04-11 15:20:17,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:20:17,058 INFO L459 AbstractCegarLoop]: Abstraction has 126 states and 140 transitions. [2018-04-11 15:20:17,058 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 15:20:17,058 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 140 transitions. [2018-04-11 15:20:17,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 15:20:17,059 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:20:17,059 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:20:17,059 INFO L408 AbstractCegarLoop]: === Iteration 17 === [__U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:20:17,060 INFO L82 PathProgramCache]: Analyzing trace with hash -11091999, now seen corresponding path program 1 times [2018-04-11 15:20:17,060 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:20:17,060 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:20:17,060 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:17,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:20:17,061 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:17,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:17,069 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:20:17,071 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:20:17,072 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:20:17,072 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:20:17,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:20:17,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:17,093 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:20:17,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:20:17,106 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:17,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:20:17,114 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:17,118 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:17,118 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:20:17,133 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:17,133 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:17,134 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:20:17,134 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:17,141 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:20:17,141 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:17,146 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:20:17,146 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:20:17,338 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:20:17,339 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:20:17,339 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-11 15:20:17,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 15:20:17,339 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 15:20:17,339 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-04-11 15:20:17,339 INFO L87 Difference]: Start difference. First operand 126 states and 140 transitions. Second operand 16 states. [2018-04-11 15:20:17,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:20:17,677 INFO L93 Difference]: Finished difference Result 133 states and 149 transitions. [2018-04-11 15:20:17,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 15:20:17,677 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-04-11 15:20:17,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:20:17,678 INFO L225 Difference]: With dead ends: 133 [2018-04-11 15:20:17,678 INFO L226 Difference]: Without dead ends: 133 [2018-04-11 15:20:17,678 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=612, Unknown=0, NotChecked=0, Total=702 [2018-04-11 15:20:17,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-04-11 15:20:17,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 127. [2018-04-11 15:20:17,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-04-11 15:20:17,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 142 transitions. [2018-04-11 15:20:17,680 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 142 transitions. Word has length 30 [2018-04-11 15:20:17,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:20:17,681 INFO L459 AbstractCegarLoop]: Abstraction has 127 states and 142 transitions. [2018-04-11 15:20:17,681 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 15:20:17,681 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 142 transitions. [2018-04-11 15:20:17,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 15:20:17,681 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:20:17,681 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:20:17,681 INFO L408 AbstractCegarLoop]: === Iteration 18 === [__U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:20:17,682 INFO L82 PathProgramCache]: Analyzing trace with hash 7934200, now seen corresponding path program 2 times [2018-04-11 15:20:17,682 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:20:17,682 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:20:17,682 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:17,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:20:17,682 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:17,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:17,691 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:20:17,700 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:20:17,700 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:20:17,700 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:20:17,701 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:20:17,727 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:20:17,727 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:20:17,730 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:20:17,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:20:17,732 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:17,734 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:17,734 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 15:20:17,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:20:17,747 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:17,752 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:17,753 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:17,753 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:20:17,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:17,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:17,757 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-11 15:20:17,780 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:20:17,781 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:20:17,782 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:17,783 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:17,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:17,786 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-04-11 15:20:17,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:20:17,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:20:17,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:17,914 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:17,921 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:20:17,921 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:18 [2018-04-11 15:20:17,964 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:20:17,971 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:20:17,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:20:17,974 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:20:17,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:20:17,982 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:38 [2018-04-11 15:20:18,046 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:20:18,046 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:20:18,046 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 15:20:18,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 15:20:18,046 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 15:20:18,047 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2018-04-11 15:20:18,047 INFO L87 Difference]: Start difference. First operand 127 states and 142 transitions. Second operand 17 states. [2018-04-11 15:20:18,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:20:18,395 INFO L93 Difference]: Finished difference Result 150 states and 169 transitions. [2018-04-11 15:20:18,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 15:20:18,396 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2018-04-11 15:20:18,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:20:18,396 INFO L225 Difference]: With dead ends: 150 [2018-04-11 15:20:18,396 INFO L226 Difference]: Without dead ends: 150 [2018-04-11 15:20:18,397 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=654, Unknown=0, NotChecked=0, Total=756 [2018-04-11 15:20:18,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-04-11 15:20:18,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 131. [2018-04-11 15:20:18,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-04-11 15:20:18,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 147 transitions. [2018-04-11 15:20:18,401 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 147 transitions. Word has length 30 [2018-04-11 15:20:18,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:20:18,401 INFO L459 AbstractCegarLoop]: Abstraction has 131 states and 147 transitions. [2018-04-11 15:20:18,401 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 15:20:18,401 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 147 transitions. [2018-04-11 15:20:18,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-11 15:20:18,401 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:20:18,402 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] [2018-04-11 15:20:18,402 INFO L408 AbstractCegarLoop]: === Iteration 19 === [__U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:20:18,402 INFO L82 PathProgramCache]: Analyzing trace with hash 598498219, now seen corresponding path program 1 times [2018-04-11 15:20:18,402 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:20:18,402 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:20:18,402 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:18,402 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:20:18,402 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:18,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:18,410 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:20:18,411 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:20:18,411 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:20:18,412 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:20:18,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:20:18,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:18,426 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:20:18,470 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:18,471 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:20:18,474 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:20:18,475 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:18,478 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:18,483 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:20:18,483 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-11 15:20:18,507 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:20:18,511 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:20:18,515 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:20:18,516 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:20:18,516 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 15:20:18,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 15:20:18,516 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 15:20:18,516 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=22, Unknown=2, NotChecked=18, Total=56 [2018-04-11 15:20:18,516 INFO L87 Difference]: Start difference. First operand 131 states and 147 transitions. Second operand 8 states. [2018-04-11 15:20:18,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:20:18,597 INFO L93 Difference]: Finished difference Result 130 states and 146 transitions. [2018-04-11 15:20:18,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 15:20:18,597 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-04-11 15:20:18,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:20:18,598 INFO L225 Difference]: With dead ends: 130 [2018-04-11 15:20:18,598 INFO L226 Difference]: Without dead ends: 80 [2018-04-11 15:20:18,598 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 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:20:18,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-04-11 15:20:18,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 66. [2018-04-11 15:20:18,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-04-11 15:20:18,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2018-04-11 15:20:18,600 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 31 [2018-04-11 15:20:18,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:20:18,601 INFO L459 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2018-04-11 15:20:18,601 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 15:20:18,601 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-04-11 15:20:18,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-11 15:20:18,601 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:20:18,601 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] [2018-04-11 15:20:18,601 INFO L408 AbstractCegarLoop]: === Iteration 20 === [__U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:20:18,601 INFO L82 PathProgramCache]: Analyzing trace with hash 245960151, now seen corresponding path program 2 times [2018-04-11 15:20:18,602 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:20:18,602 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:20:18,602 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:18,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:20:18,602 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:18,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:18,612 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:20:18,614 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:20:18,614 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:20:18,614 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:20:18,615 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:20:18,638 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:20:18,638 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:20:18,641 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:20:18,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:20:18,651 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:18,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:20:18,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:18,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:18,665 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:20:18,683 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:18,685 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:20:18,685 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:18,697 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:18,698 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:18,698 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:20:18,699 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:18,705 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:20:18,706 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:20:18,957 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:20:18,957 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:20:18,957 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 15:20:18,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 15:20:18,958 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 15:20:18,958 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-04-11 15:20:18,958 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 17 states. [2018-04-11 15:20:19,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:20:19,324 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2018-04-11 15:20:19,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 15:20:19,325 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 31 [2018-04-11 15:20:19,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:20:19,325 INFO L225 Difference]: With dead ends: 70 [2018-04-11 15:20:19,325 INFO L226 Difference]: Without dead ends: 70 [2018-04-11 15:20:19,325 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=95, Invalid=717, Unknown=0, NotChecked=0, Total=812 [2018-04-11 15:20:19,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-04-11 15:20:19,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2018-04-11 15:20:19,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-04-11 15:20:19,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-04-11 15:20:19,327 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 31 [2018-04-11 15:20:19,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:20:19,327 INFO L459 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-04-11 15:20:19,328 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 15:20:19,328 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-04-11 15:20:19,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-11 15:20:19,328 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:20:19,328 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:20:19,328 INFO L408 AbstractCegarLoop]: === Iteration 21 === [__U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:20:19,328 INFO L82 PathProgramCache]: Analyzing trace with hash 398404164, now seen corresponding path program 2 times [2018-04-11 15:20:19,328 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:20:19,329 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:20:19,329 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:19,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:20:19,329 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:19,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:19,339 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:20:19,341 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:20:19,342 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:20:19,342 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:20:19,342 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:20:19,366 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:20:19,366 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:20:19,370 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:20:19,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:20:19,387 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:19,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:20:19,394 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:19,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:19,399 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:20:19,417 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:19,419 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:20:19,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:19,429 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:19,430 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:19,430 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:20:19,430 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:19,437 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:20:19,437 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:20:19,685 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:20:19,685 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:20:19,685 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 15:20:19,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 15:20:19,686 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 15:20:19,686 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-04-11 15:20:19,686 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 17 states. [2018-04-11 15:20:20,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:20:20,131 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-04-11 15:20:20,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 15:20:20,131 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 34 [2018-04-11 15:20:20,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:20:20,132 INFO L225 Difference]: With dead ends: 77 [2018-04-11 15:20:20,132 INFO L226 Difference]: Without dead ends: 77 [2018-04-11 15:20:20,132 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=95, Invalid=717, Unknown=0, NotChecked=0, Total=812 [2018-04-11 15:20:20,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-04-11 15:20:20,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2018-04-11 15:20:20,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-04-11 15:20:20,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2018-04-11 15:20:20,133 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 34 [2018-04-11 15:20:20,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:20:20,133 INFO L459 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2018-04-11 15:20:20,133 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 15:20:20,134 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-04-11 15:20:20,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-11 15:20:20,134 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:20:20,134 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:20:20,134 INFO L408 AbstractCegarLoop]: === Iteration 22 === [__U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:20:20,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1840277115, now seen corresponding path program 1 times [2018-04-11 15:20:20,134 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:20:20,134 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:20:20,135 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:20,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:20:20,135 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:20,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:20,142 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:20:20,143 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:20:20,143 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:20:20,143 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:20:20,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:20:20,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:20,162 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:20:20,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 6 treesize of output 5 [2018-04-11 15:20:20,167 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:20,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:20:20,172 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:20,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:20,176 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:20:20,189 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:20,190 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:20:20,190 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:20,199 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:20,199 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:20,200 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:20:20,200 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:20,226 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:20:20,226 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:20:20,497 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:20:20,497 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:20:20,498 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-11 15:20:20,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 15:20:20,498 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 15:20:20,498 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2018-04-11 15:20:20,498 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 18 states. [2018-04-11 15:20:21,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:20:21,007 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2018-04-11 15:20:21,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 15:20:21,007 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 35 [2018-04-11 15:20:21,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:20:21,007 INFO L225 Difference]: With dead ends: 82 [2018-04-11 15:20:21,007 INFO L226 Difference]: Without dead ends: 82 [2018-04-11 15:20:21,008 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=104, Invalid=826, Unknown=0, NotChecked=0, Total=930 [2018-04-11 15:20:21,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-04-11 15:20:21,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 72. [2018-04-11 15:20:21,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-04-11 15:20:21,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2018-04-11 15:20:21,010 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 35 [2018-04-11 15:20:21,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:20:21,010 INFO L459 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2018-04-11 15:20:21,010 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 15:20:21,010 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2018-04-11 15:20:21,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-11 15:20:21,011 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:20:21,011 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:20:21,011 INFO L408 AbstractCegarLoop]: === Iteration 23 === [__U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:20:21,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1314534592, now seen corresponding path program 2 times [2018-04-11 15:20:21,011 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:20:21,011 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:20:21,012 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:21,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:20:21,012 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:21,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:21,024 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:20:21,026 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:20:21,027 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:20:21,027 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:20:21,027 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:20:21,056 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:20:21,056 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:20:21,060 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:20:21,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:20:21,074 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:21,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:20:21,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:21,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:21,087 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:20:21,106 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:21,106 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:21,107 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:20:21,107 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:21,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:20:21,116 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:21,124 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:20:21,124 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:20:21,359 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:20:21,359 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:21,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:21,372 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:39 [2018-04-11 15:20:21,554 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:20:21,555 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:20:21,555 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-11 15:20:21,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 15:20:21,555 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 15:20:21,555 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2018-04-11 15:20:21,556 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand 19 states. [2018-04-11 15:20:22,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:20:22,214 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2018-04-11 15:20:22,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-11 15:20:22,214 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-04-11 15:20:22,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:20:22,215 INFO L225 Difference]: With dead ends: 81 [2018-04-11 15:20:22,215 INFO L226 Difference]: Without dead ends: 81 [2018-04-11 15:20:22,216 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=110, Invalid=946, Unknown=0, NotChecked=0, Total=1056 [2018-04-11 15:20:22,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-04-11 15:20:22,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 73. [2018-04-11 15:20:22,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-04-11 15:20:22,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2018-04-11 15:20:22,218 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 36 [2018-04-11 15:20:22,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:20:22,218 INFO L459 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2018-04-11 15:20:22,218 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 15:20:22,218 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2018-04-11 15:20:22,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-11 15:20:22,218 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:20:22,218 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:20:22,219 INFO L408 AbstractCegarLoop]: === Iteration 24 === [__U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:20:22,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1333560791, now seen corresponding path program 3 times [2018-04-11 15:20:22,219 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:20:22,219 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:20:22,219 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:22,220 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:20:22,220 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:22,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:22,232 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:20:22,234 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:20:22,235 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:20:22,235 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:20:22,235 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:20:22,277 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-11 15:20:22,277 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:20:22,281 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:20:22,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:20:22,283 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:22,285 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:22,285 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 15:20:22,292 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:22,293 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:22,293 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:20:22,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:22,299 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:20:22,299 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:22,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:22,303 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-11 15:20:22,320 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:20:22,322 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:20:22,322 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:22,324 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:22,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:22,327 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-11 15:20:22,391 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:20:22,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:20:22,395 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:22,400 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:22,405 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:20:22,406 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-04-11 15:20:22,427 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:20:22,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:20:22,429 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:22,434 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:22,440 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:20:22,440 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2018-04-11 15:20:22,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 15:20:22,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:22,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-04-11 15:20:22,488 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:20:22,488 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 15:20:22,492 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:20:22,498 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:20:22,499 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:34, output treesize:32 [2018-04-11 15:20:22,560 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-04-11 15:20:22,560 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:20:22,560 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 15:20:22,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 15:20:22,560 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 15:20:22,560 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-04-11 15:20:22,561 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 17 states. [2018-04-11 15:20:22,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:20:22,986 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2018-04-11 15:20:22,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 15:20:22,987 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 36 [2018-04-11 15:20:22,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:20:22,987 INFO L225 Difference]: With dead ends: 72 [2018-04-11 15:20:22,987 INFO L226 Difference]: Without dead ends: 72 [2018-04-11 15:20:22,988 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=677, Unknown=0, NotChecked=0, Total=812 [2018-04-11 15:20:22,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-04-11 15:20:22,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-04-11 15:20:22,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-04-11 15:20:22,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2018-04-11 15:20:22,990 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 36 [2018-04-11 15:20:22,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:20:22,990 INFO L459 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2018-04-11 15:20:22,990 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 15:20:22,990 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2018-04-11 15:20:22,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-04-11 15:20:22,990 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:20:22,991 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] [2018-04-11 15:20:22,991 INFO L408 AbstractCegarLoop]: === Iteration 25 === [__U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:20:22,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1609288488, now seen corresponding path program 3 times [2018-04-11 15:20:22,991 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:20:22,991 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:20:22,992 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:22,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:20:22,992 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:23,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:23,003 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:20:23,022 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:20:23,022 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:20:23,022 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:20:23,024 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:20:23,059 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-11 15:20:23,059 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:20:23,063 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:20:23,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:20:23,068 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:23,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:20:23,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:23,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:23,081 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:20:23,100 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:23,101 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:20:23,101 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:23,112 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:23,113 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:23,114 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:20:23,114 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:23,120 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:20:23,120 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:20:23,546 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:20:23,546 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:20:23,546 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-11 15:20:23,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 15:20:23,547 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 15:20:23,547 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=337, Unknown=0, NotChecked=0, Total=380 [2018-04-11 15:20:23,547 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand 20 states. [2018-04-11 15:20:24,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:20:24,345 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2018-04-11 15:20:24,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 15:20:24,346 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 37 [2018-04-11 15:20:24,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:20:24,346 INFO L225 Difference]: With dead ends: 82 [2018-04-11 15:20:24,346 INFO L226 Difference]: Without dead ends: 82 [2018-04-11 15:20:24,346 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=116, Invalid=1074, Unknown=0, NotChecked=0, Total=1190 [2018-04-11 15:20:24,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-04-11 15:20:24,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2018-04-11 15:20:24,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-04-11 15:20:24,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2018-04-11 15:20:24,349 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 37 [2018-04-11 15:20:24,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:20:24,349 INFO L459 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2018-04-11 15:20:24,349 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 15:20:24,349 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2018-04-11 15:20:24,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-11 15:20:24,349 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:20:24,350 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:20:24,350 INFO L408 AbstractCegarLoop]: === Iteration 26 === [__U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:20:24,350 INFO L82 PathProgramCache]: Analyzing trace with hash 92878082, now seen corresponding path program 3 times [2018-04-11 15:20:24,350 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:20:24,350 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:20:24,351 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:24,351 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:20:24,351 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:24,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:24,361 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:20:24,364 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:20:24,364 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:20:24,364 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:20:24,365 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:20:24,383 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-11 15:20:24,384 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:20:24,386 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:20:24,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:20:24,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:24,396 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:20:24,396 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:24,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:24,400 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:20:24,414 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:24,415 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:20:24,415 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:24,424 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:24,424 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:24,425 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:20:24,425 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:24,430 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:20:24,430 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:20:24,851 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:20:24,851 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:20:24,851 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-11 15:20:24,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 15:20:24,852 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 15:20:24,852 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2018-04-11 15:20:24,852 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand 19 states. [2018-04-11 15:20:25,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:20:25,553 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2018-04-11 15:20:25,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-11 15:20:25,553 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 39 [2018-04-11 15:20:25,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:20:25,553 INFO L225 Difference]: With dead ends: 92 [2018-04-11 15:20:25,553 INFO L226 Difference]: Without dead ends: 92 [2018-04-11 15:20:25,554 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=107, Invalid=949, Unknown=0, NotChecked=0, Total=1056 [2018-04-11 15:20:25,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-04-11 15:20:25,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 82. [2018-04-11 15:20:25,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-04-11 15:20:25,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2018-04-11 15:20:25,555 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 39 [2018-04-11 15:20:25,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:20:25,555 INFO L459 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2018-04-11 15:20:25,555 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 15:20:25,556 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2018-04-11 15:20:25,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-11 15:20:25,556 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:20:25,556 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:20:25,556 INFO L408 AbstractCegarLoop]: === Iteration 27 === [__U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:20:25,556 INFO L82 PathProgramCache]: Analyzing trace with hash 2110858849, now seen corresponding path program 2 times [2018-04-11 15:20:25,556 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:20:25,556 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:20:25,557 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:25,557 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:20:25,557 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:25,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:25,566 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:20:25,569 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:20:25,569 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:20:25,569 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:20:25,570 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:20:25,600 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:20:25,600 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:20:25,603 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:20:25,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:20:25,618 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:25,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:20:25,625 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:25,629 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:25,629 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:20:25,646 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:25,648 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:20:25,648 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:25,660 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:25,660 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:25,661 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:20:25,661 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:25,664 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:20:25,664 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:20:25,969 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:20:25,969 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:20:25,969 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-11 15:20:25,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 15:20:25,970 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 15:20:25,970 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2018-04-11 15:20:25,970 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand 20 states. [2018-04-11 15:20:26,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:20:26,629 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2018-04-11 15:20:26,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 15:20:26,629 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2018-04-11 15:20:26,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:20:26,630 INFO L225 Difference]: With dead ends: 97 [2018-04-11 15:20:26,630 INFO L226 Difference]: Without dead ends: 97 [2018-04-11 15:20:26,630 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=128, Invalid=1278, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 15:20:26,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-04-11 15:20:26,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 82. [2018-04-11 15:20:26,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-04-11 15:20:26,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2018-04-11 15:20:26,633 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 40 [2018-04-11 15:20:26,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:20:26,633 INFO L459 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2018-04-11 15:20:26,633 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 15:20:26,633 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2018-04-11 15:20:26,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-11 15:20:26,634 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:20:26,634 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:20:26,634 INFO L408 AbstractCegarLoop]: === Iteration 28 === [__U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:20:26,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1679992826, now seen corresponding path program 3 times [2018-04-11 15:20:26,634 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:20:26,634 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:20:26,635 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:26,635 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:20:26,635 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:26,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:26,645 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:20:26,648 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:20:26,648 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:20:26,649 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:20:26,649 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:20:26,678 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-11 15:20:26,678 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:20:26,681 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:20:26,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:20:26,688 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:26,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:20:26,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:26,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:26,699 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:20:26,715 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:26,716 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:26,716 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:20:26,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:26,722 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:20:26,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:26,726 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:20:26,726 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:20:26,964 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:20:26,965 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:20:26,965 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-11 15:20:26,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 15:20:26,965 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 15:20:26,965 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2018-04-11 15:20:26,965 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand 20 states. [2018-04-11 15:20:27,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:20:27,559 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2018-04-11 15:20:27,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 15:20:27,559 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 41 [2018-04-11 15:20:27,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:20:27,560 INFO L225 Difference]: With dead ends: 92 [2018-04-11 15:20:27,560 INFO L226 Difference]: Without dead ends: 92 [2018-04-11 15:20:27,560 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=1278, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 15:20:27,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-04-11 15:20:27,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 82. [2018-04-11 15:20:27,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-04-11 15:20:27,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2018-04-11 15:20:27,562 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 41 [2018-04-11 15:20:27,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:20:27,562 INFO L459 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2018-04-11 15:20:27,562 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 15:20:27,562 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2018-04-11 15:20:27,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-11 15:20:27,563 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:20:27,563 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:20:27,563 INFO L408 AbstractCegarLoop]: === Iteration 29 === [__U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:20:27,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1988380255, now seen corresponding path program 3 times [2018-04-11 15:20:27,563 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:20:27,563 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:20:27,563 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:27,563 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:20:27,564 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:27,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:27,572 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:20:27,585 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:20:27,585 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:20:27,585 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:20:27,585 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:20:27,614 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-11 15:20:27,614 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:20:27,617 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:20:27,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:20:27,621 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:27,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:20:27,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:27,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:27,630 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:20:27,644 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:27,644 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:27,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:20:27,645 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:27,668 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:20:27,668 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:27,673 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:20:27,673 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:20:28,380 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:20:28,380 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:20:28,381 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-11 15:20:28,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 15:20:28,381 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 15:20:28,381 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=496, Unknown=0, NotChecked=0, Total=552 [2018-04-11 15:20:28,381 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand 24 states. [2018-04-11 15:20:29,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:20:29,426 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2018-04-11 15:20:29,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 15:20:29,427 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 42 [2018-04-11 15:20:29,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:20:29,427 INFO L225 Difference]: With dead ends: 93 [2018-04-11 15:20:29,427 INFO L226 Difference]: Without dead ends: 93 [2018-04-11 15:20:29,428 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=142, Invalid=1498, Unknown=0, NotChecked=0, Total=1640 [2018-04-11 15:20:29,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-04-11 15:20:29,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 83. [2018-04-11 15:20:29,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-04-11 15:20:29,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2018-04-11 15:20:29,430 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 42 [2018-04-11 15:20:29,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:20:29,430 INFO L459 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2018-04-11 15:20:29,430 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 15:20:29,430 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2018-04-11 15:20:29,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 15:20:29,430 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:20:29,430 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] [2018-04-11 15:20:29,431 INFO L408 AbstractCegarLoop]: === Iteration 30 === [__U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:20:29,431 INFO L82 PathProgramCache]: Analyzing trace with hash 2100057881, now seen corresponding path program 4 times [2018-04-11 15:20:29,431 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:20:29,431 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:20:29,431 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:29,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:20:29,431 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:29,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:29,440 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:20:29,458 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:20:29,459 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:20:29,459 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:20:29,459 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:20:29,492 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:20:29,493 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:20:29,496 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:20:29,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:20:29,522 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:29,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:20:29,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:29,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:29,542 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:20:29,572 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:29,573 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:29,574 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:20:29,574 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:29,584 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:20:29,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:29,591 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:20:29,591 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:20:30,324 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:20:30,324 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:20:30,324 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 15:20:30,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 15:20:30,325 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 15:20:30,325 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2018-04-11 15:20:30,325 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand 23 states. [2018-04-11 15:20:31,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:20:31,360 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2018-04-11 15:20:31,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 15:20:31,360 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 43 [2018-04-11 15:20:31,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:20:31,361 INFO L225 Difference]: With dead ends: 95 [2018-04-11 15:20:31,361 INFO L226 Difference]: Without dead ends: 95 [2018-04-11 15:20:31,361 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=132, Invalid=1508, Unknown=0, NotChecked=0, Total=1640 [2018-04-11 15:20:31,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-04-11 15:20:31,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 88. [2018-04-11 15:20:31,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-04-11 15:20:31,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2018-04-11 15:20:31,363 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 43 [2018-04-11 15:20:31,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:20:31,364 INFO L459 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2018-04-11 15:20:31,364 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 15:20:31,364 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2018-04-11 15:20:31,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-11 15:20:31,364 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:20:31,364 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:20:31,364 INFO L408 AbstractCegarLoop]: === Iteration 31 === [__U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:20:31,365 INFO L82 PathProgramCache]: Analyzing trace with hash 2058236164, now seen corresponding path program 4 times [2018-04-11 15:20:31,365 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:20:31,365 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:20:31,365 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:31,366 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:20:31,366 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:31,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:31,377 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:20:31,379 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:20:31,379 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:20:31,380 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:20:31,380 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:20:31,408 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:20:31,408 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:20:31,411 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:20:31,416 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:20:31,416 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:31,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:20:31,423 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:31,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:31,427 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:20:31,445 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:31,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:20:31,446 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:31,462 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:31,463 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:31,464 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:20:31,464 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:31,471 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:20:31,471 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:20:31,929 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:20:31,929 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:20:31,930 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-11 15:20:31,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 15:20:31,930 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 15:20:31,930 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=376, Unknown=0, NotChecked=0, Total=420 [2018-04-11 15:20:31,931 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand 21 states. [2018-04-11 15:20:32,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:20:32,727 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2018-04-11 15:20:32,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 15:20:32,727 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 44 [2018-04-11 15:20:32,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:20:32,728 INFO L225 Difference]: With dead ends: 108 [2018-04-11 15:20:32,728 INFO L226 Difference]: Without dead ends: 108 [2018-04-11 15:20:32,728 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=119, Invalid=1213, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 15:20:32,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-04-11 15:20:32,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 93. [2018-04-11 15:20:32,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-04-11 15:20:32,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2018-04-11 15:20:32,730 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 44 [2018-04-11 15:20:32,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:20:32,730 INFO L459 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2018-04-11 15:20:32,730 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 15:20:32,730 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2018-04-11 15:20:32,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-11 15:20:32,730 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:20:32,730 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:20:32,730 INFO L408 AbstractCegarLoop]: === Iteration 32 === [__U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:20:32,731 INFO L82 PathProgramCache]: Analyzing trace with hash -120503547, now seen corresponding path program 4 times [2018-04-11 15:20:32,731 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:20:32,731 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:20:32,731 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:32,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:20:32,732 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:32,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:32,743 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:20:32,746 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:20:32,746 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:20:32,746 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:20:32,747 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:20:32,775 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:20:32,776 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:20:32,779 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:20:32,782 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:20:32,782 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:32,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:20:32,788 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:32,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:32,792 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:20:32,804 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:32,805 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:20:32,806 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:32,815 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:32,816 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:32,816 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:20:32,817 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:32,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:32,821 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:16 [2018-04-11 15:20:33,760 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:20:33,760 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:20:33,760 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 15:20:33,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 15:20:33,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 15:20:33,760 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=457, Unknown=0, NotChecked=0, Total=506 [2018-04-11 15:20:33,761 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand 23 states. [2018-04-11 15:20:34,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:20:34,978 INFO L93 Difference]: Finished difference Result 113 states and 119 transitions. [2018-04-11 15:20:34,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 15:20:34,978 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 45 [2018-04-11 15:20:34,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:20:34,979 INFO L225 Difference]: With dead ends: 113 [2018-04-11 15:20:34,979 INFO L226 Difference]: Without dead ends: 113 [2018-04-11 15:20:34,980 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=145, Invalid=1577, Unknown=0, NotChecked=0, Total=1722 [2018-04-11 15:20:34,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-04-11 15:20:34,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 93. [2018-04-11 15:20:34,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-04-11 15:20:34,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2018-04-11 15:20:34,982 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 45 [2018-04-11 15:20:34,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:20:34,982 INFO L459 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2018-04-11 15:20:34,982 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 15:20:34,982 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2018-04-11 15:20:34,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-11 15:20:34,982 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:20:34,982 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:20:34,982 INFO L408 AbstractCegarLoop]: === Iteration 33 === [__U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:20:34,983 INFO L82 PathProgramCache]: Analyzing trace with hash 2034978944, now seen corresponding path program 5 times [2018-04-11 15:20:34,983 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:20:34,983 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:20:34,983 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:34,983 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:20:34,983 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:34,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:34,994 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:20:34,997 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:20:34,997 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:20:34,997 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:20:34,997 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:20:35,041 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-04-11 15:20:35,042 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:20:35,045 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:20:35,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 6 treesize of output 5 [2018-04-11 15:20:35,048 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:35,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:20:35,054 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:35,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:35,058 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:20:35,072 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:35,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:20:35,073 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:35,083 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:35,084 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:35,085 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:20:35,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:35,092 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:20:35,092 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:20:35,314 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:20:35,314 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:20:35,314 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-11 15:20:35,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 15:20:35,315 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 15:20:35,315 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-04-11 15:20:35,315 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand 21 states. [2018-04-11 15:20:35,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:20:35,859 INFO L93 Difference]: Finished difference Result 112 states and 118 transitions. [2018-04-11 15:20:35,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 15:20:35,859 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 46 [2018-04-11 15:20:35,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:20:35,860 INFO L225 Difference]: With dead ends: 112 [2018-04-11 15:20:35,860 INFO L226 Difference]: Without dead ends: 112 [2018-04-11 15:20:35,861 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=124, Invalid=1358, Unknown=0, NotChecked=0, Total=1482 [2018-04-11 15:20:35,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-04-11 15:20:35,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 93. [2018-04-11 15:20:35,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-04-11 15:20:35,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2018-04-11 15:20:35,863 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 46 [2018-04-11 15:20:35,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:20:35,863 INFO L459 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2018-04-11 15:20:35,863 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 15:20:35,863 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2018-04-11 15:20:35,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-04-11 15:20:35,864 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:20:35,864 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:20:35,864 INFO L408 AbstractCegarLoop]: === Iteration 34 === [__U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:20:35,864 INFO L82 PathProgramCache]: Analyzing trace with hash 262697415, now seen corresponding path program 6 times [2018-04-11 15:20:35,864 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:20:35,864 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:20:35,865 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:35,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:20:35,865 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:35,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:35,875 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:20:35,909 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:20:35,909 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:20:35,909 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:20:35,910 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:20:35,964 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-04-11 15:20:35,965 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:20:35,969 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:20:35,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:20:35,986 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:35,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:20:35,993 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:35,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:35,997 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:20:36,015 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:36,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:20:36,017 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:36,028 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:36,029 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:36,029 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:20:36,030 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:36,036 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:20:36,037 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:15 [2018-04-11 15:20:36,774 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:20:36,774 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:20:36,774 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-11 15:20:36,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 15:20:36,775 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 15:20:36,775 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=546, Unknown=0, NotChecked=0, Total=600 [2018-04-11 15:20:36,775 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand 25 states. [2018-04-11 15:20:38,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:20:38,148 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2018-04-11 15:20:38,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 15:20:38,148 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 47 [2018-04-11 15:20:38,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:20:38,149 INFO L225 Difference]: With dead ends: 107 [2018-04-11 15:20:38,149 INFO L226 Difference]: Without dead ends: 107 [2018-04-11 15:20:38,149 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=160, Invalid=1910, Unknown=0, NotChecked=0, Total=2070 [2018-04-11 15:20:38,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-04-11 15:20:38,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 93. [2018-04-11 15:20:38,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-04-11 15:20:38,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2018-04-11 15:20:38,150 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 47 [2018-04-11 15:20:38,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:20:38,151 INFO L459 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2018-04-11 15:20:38,151 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 15:20:38,151 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2018-04-11 15:20:38,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-11 15:20:38,151 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:20:38,151 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:20:38,151 INFO L408 AbstractCegarLoop]: === Iteration 35 === [__U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:20:38,151 INFO L82 PathProgramCache]: Analyzing trace with hash 2082235582, now seen corresponding path program 4 times [2018-04-11 15:20:38,151 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:20:38,151 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:20:38,152 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:38,152 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:20:38,152 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:38,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:38,159 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:20:38,177 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:20:38,178 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:20:38,178 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:20:38,178 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:20:38,204 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:20:38,205 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:20:38,208 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:20:38,210 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:20:38,210 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:38,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:20:38,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:38,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:38,218 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:20:38,236 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:38,237 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:38,238 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:20:38,238 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:38,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:20:38,244 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:38,248 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:20:38,248 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:20:38,602 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:20:38,602 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:20:38,602 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 15:20:38,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 15:20:38,603 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 15:20:38,603 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2018-04-11 15:20:38,603 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand 23 states. [2018-04-11 15:20:39,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:20:39,325 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2018-04-11 15:20:39,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 15:20:39,326 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 48 [2018-04-11 15:20:39,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:20:39,326 INFO L225 Difference]: With dead ends: 102 [2018-04-11 15:20:39,326 INFO L226 Difference]: Without dead ends: 102 [2018-04-11 15:20:39,326 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=142, Invalid=1664, Unknown=0, NotChecked=0, Total=1806 [2018-04-11 15:20:39,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-04-11 15:20:39,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 94. [2018-04-11 15:20:39,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-04-11 15:20:39,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2018-04-11 15:20:39,328 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 48 [2018-04-11 15:20:39,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:20:39,328 INFO L459 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2018-04-11 15:20:39,328 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 15:20:39,329 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2018-04-11 15:20:39,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-11 15:20:39,329 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:20:39,329 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:20:39,329 INFO L408 AbstractCegarLoop]: === Iteration 36 === [__U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:20:39,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1531943358, now seen corresponding path program 5 times [2018-04-11 15:20:39,330 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:20:39,330 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:20:39,330 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:39,330 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:20:39,330 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:39,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:39,341 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:20:39,343 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:20:39,343 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:20:39,344 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:20:39,344 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:20:39,375 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-04-11 15:20:39,375 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:20:39,379 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:20:39,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:20:39,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:39,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:20:39,402 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:39,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:39,406 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:20:39,419 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:39,420 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:20:39,421 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:39,429 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:39,430 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:39,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-11 15:20:39,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:39,436 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:20:39,436 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:20:39,714 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:20:39,714 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:20:39,715 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-11 15:20:39,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 15:20:39,715 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 15:20:39,715 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2018-04-11 15:20:39,716 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand 22 states. [2018-04-11 15:20:40,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:20:40,361 INFO L93 Difference]: Finished difference Result 103 states and 110 transitions. [2018-04-11 15:20:40,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 15:20:40,361 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 49 [2018-04-11 15:20:40,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:20:40,361 INFO L225 Difference]: With dead ends: 103 [2018-04-11 15:20:40,362 INFO L226 Difference]: Without dead ends: 103 [2018-04-11 15:20:40,362 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=1438, Unknown=0, NotChecked=0, Total=1560 [2018-04-11 15:20:40,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-04-11 15:20:40,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2018-04-11 15:20:40,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-04-11 15:20:40,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2018-04-11 15:20:40,363 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 49 [2018-04-11 15:20:40,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:20:40,363 INFO L459 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2018-04-11 15:20:40,363 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 15:20:40,363 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2018-04-11 15:20:40,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-11 15:20:40,364 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:20:40,364 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:20:40,364 INFO L408 AbstractCegarLoop]: === Iteration 37 === [__U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:20:40,364 INFO L82 PathProgramCache]: Analyzing trace with hash 714605722, now seen corresponding path program 5 times [2018-04-11 15:20:40,364 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:20:40,364 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:20:40,365 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:40,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:20:40,365 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:40,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:40,381 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:20:40,384 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:20:40,384 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:20:40,385 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:20:40,385 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:20:40,452 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-04-11 15:20:40,453 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:20:40,459 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:20:40,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:20:40,462 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:40,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:20:40,467 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:40,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:40,471 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:20:40,489 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:40,490 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:40,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 15:20:40,491 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:40,503 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:20:40,503 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:40,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:40,510 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:23 [2018-04-11 15:20:41,335 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:20:41,335 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:41,375 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:20:41,375 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:63, output treesize:49 [2018-04-11 15:20:41,444 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:20:41,444 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:20:41,444 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-11 15:20:41,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-11 15:20:41,444 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-11 15:20:41,445 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=698, Unknown=0, NotChecked=0, Total=756 [2018-04-11 15:20:41,445 INFO L87 Difference]: Start difference. First operand 99 states and 106 transitions. Second operand 28 states. [2018-04-11 15:20:42,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:20:42,993 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2018-04-11 15:20:42,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-11 15:20:42,993 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 49 [2018-04-11 15:20:42,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:20:42,993 INFO L225 Difference]: With dead ends: 113 [2018-04-11 15:20:42,993 INFO L226 Difference]: Without dead ends: 113 [2018-04-11 15:20:42,994 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=170, Invalid=2380, Unknown=0, NotChecked=0, Total=2550 [2018-04-11 15:20:42,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-04-11 15:20:42,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 104. [2018-04-11 15:20:42,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-04-11 15:20:42,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2018-04-11 15:20:42,996 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 49 [2018-04-11 15:20:42,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:20:42,996 INFO L459 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2018-04-11 15:20:42,996 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-11 15:20:42,996 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2018-04-11 15:20:42,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-11 15:20:42,996 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:20:42,997 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:20:42,997 INFO L408 AbstractCegarLoop]: === Iteration 38 === [__U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:20:42,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1184090052, now seen corresponding path program 6 times [2018-04-11 15:20:42,997 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:20:42,997 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:20:42,998 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:42,998 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:20:42,998 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:43,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:43,009 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:20:43,012 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:20:43,013 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:20:43,013 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:20:43,013 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:20:43,056 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-04-11 15:20:43,056 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:20:43,061 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:20:43,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:20:43,078 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:43,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:20:43,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:43,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:43,099 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:20 [2018-04-11 15:20:43,119 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:43,120 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:20:43,120 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:43,128 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:43,129 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:43,129 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:20:43,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:43,134 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:20:43,134 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:15 [2018-04-11 15:20:44,311 WARN L148 SmtUtils]: Spent 110ms on a formula simplification that was a NOOP. DAG size: 47 [2018-04-11 15:20:44,596 WARN L148 SmtUtils]: Spent 113ms on a formula simplification that was a NOOP. DAG size: 46 [2018-04-11 15:20:45,039 WARN L148 SmtUtils]: Spent 180ms on a formula simplification that was a NOOP. DAG size: 46 [2018-04-11 15:20:45,530 WARN L148 SmtUtils]: Spent 134ms on a formula simplification that was a NOOP. DAG size: 49 [2018-04-11 15:20:45,543 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:20:45,544 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:20:45,544 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-11 15:20:45,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-11 15:20:45,544 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-11 15:20:45,544 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=592, Unknown=0, NotChecked=0, Total=650 [2018-04-11 15:20:45,544 INFO L87 Difference]: Start difference. First operand 104 states and 111 transitions. Second operand 26 states. [2018-04-11 15:20:46,948 WARN L148 SmtUtils]: Spent 377ms on a formula simplification that was a NOOP. DAG size: 42 [2018-04-11 15:20:50,067 WARN L148 SmtUtils]: Spent 2190ms on a formula simplification that was a NOOP. DAG size: 55 [2018-04-11 15:20:50,508 WARN L151 SmtUtils]: Spent 216ms on a formula simplification. DAG size of input: 58 DAG size of output 56 [2018-04-11 15:20:50,853 WARN L148 SmtUtils]: Spent 164ms on a formula simplification that was a NOOP. DAG size: 54 [2018-04-11 15:20:51,921 WARN L148 SmtUtils]: Spent 153ms on a formula simplification that was a NOOP. DAG size: 54 [2018-04-11 15:20:56,004 WARN L148 SmtUtils]: Spent 3840ms on a formula simplification that was a NOOP. DAG size: 57 [2018-04-11 15:20:56,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:20:56,062 INFO L93 Difference]: Finished difference Result 134 states and 141 transitions. [2018-04-11 15:20:56,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 15:20:56,063 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 54 [2018-04-11 15:20:56,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:20:56,063 INFO L225 Difference]: With dead ends: 134 [2018-04-11 15:20:56,063 INFO L226 Difference]: Without dead ends: 134 [2018-04-11 15:20:56,064 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=150, Invalid=1920, Unknown=0, NotChecked=0, Total=2070 [2018-04-11 15:20:56,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-04-11 15:20:56,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 109. [2018-04-11 15:20:56,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-04-11 15:20:56,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2018-04-11 15:20:56,066 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 54 [2018-04-11 15:20:56,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:20:56,066 INFO L459 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2018-04-11 15:20:56,066 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-11 15:20:56,066 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2018-04-11 15:20:56,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-11 15:20:56,067 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:20:56,067 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:20:56,067 INFO L408 AbstractCegarLoop]: === Iteration 39 === [__U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:20:56,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1944715299, now seen corresponding path program 5 times [2018-04-11 15:20:56,067 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:20:56,067 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:20:56,068 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:56,068 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:20:56,068 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:56,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:56,080 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:20:56,083 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:20:56,084 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:20:56,084 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:20:56,084 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:20:56,152 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-04-11 15:20:56,152 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:20:56,160 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:20:56,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:20:56,168 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:56,175 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:56,175 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 5 [2018-04-11 15:20:56,176 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:56,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:56,180 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2018-04-11 15:20:56,193 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:56,194 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:56,194 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:20:56,195 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:56,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:20:56,206 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:56,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:56,213 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:23 [2018-04-11 15:20:56,677 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:20:56,678 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:56,683 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:20:56,683 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:27 [2018-04-11 15:20:56,803 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:20:56,803 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:20:56,803 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-11 15:20:56,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-11 15:20:56,803 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-11 15:20:56,804 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=647, Unknown=0, NotChecked=0, Total=702 [2018-04-11 15:20:56,804 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand 27 states. [2018-04-11 15:20:57,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:20:57,957 INFO L93 Difference]: Finished difference Result 131 states and 139 transitions. [2018-04-11 15:20:57,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 15:20:57,957 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 54 [2018-04-11 15:20:57,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:20:57,958 INFO L225 Difference]: With dead ends: 131 [2018-04-11 15:20:57,958 INFO L226 Difference]: Without dead ends: 131 [2018-04-11 15:20:57,959 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=179, Invalid=2473, Unknown=0, NotChecked=0, Total=2652 [2018-04-11 15:20:57,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-04-11 15:20:57,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 110. [2018-04-11 15:20:57,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-04-11 15:20:57,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2018-04-11 15:20:57,960 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 54 [2018-04-11 15:20:57,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:20:57,960 INFO L459 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2018-04-11 15:20:57,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-11 15:20:57,960 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2018-04-11 15:20:57,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-11 15:20:57,961 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:20:57,961 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:20:57,961 INFO L408 AbstractCegarLoop]: === Iteration 40 === [__U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:20:57,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1584204933, now seen corresponding path program 7 times [2018-04-11 15:20:57,961 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:20:57,961 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:20:57,961 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:57,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:20:57,961 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:57,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:57,972 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:20:57,975 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:20:57,975 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:20:57,976 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:20:57,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:20:58,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:58,005 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:20:58,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:20:58,015 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:58,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:20:58,023 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:58,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:58,028 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:20:58,062 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:58,063 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:58,063 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:20:58,063 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:58,070 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:20:58,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:58,074 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:20:58,075 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:21:00,980 WARN L148 SmtUtils]: Spent 2097ms on a formula simplification that was a NOOP. DAG size: 44 [2018-04-11 15:21:01,398 WARN L148 SmtUtils]: Spent 105ms on a formula simplification that was a NOOP. DAG size: 47 [2018-04-11 15:21:01,411 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:21:01,411 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:21:01,411 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-11 15:21:01,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-11 15:21:01,411 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-11 15:21:01,412 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=595, Unknown=0, NotChecked=0, Total=650 [2018-04-11 15:21:01,412 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand 26 states. [2018-04-11 15:21:03,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:21:03,163 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2018-04-11 15:21:03,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 15:21:03,163 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2018-04-11 15:21:03,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:21:03,164 INFO L225 Difference]: With dead ends: 140 [2018-04-11 15:21:03,164 INFO L226 Difference]: Without dead ends: 140 [2018-04-11 15:21:03,164 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=152, Invalid=2010, Unknown=0, NotChecked=0, Total=2162 [2018-04-11 15:21:03,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-04-11 15:21:03,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 110. [2018-04-11 15:21:03,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-04-11 15:21:03,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2018-04-11 15:21:03,166 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 55 [2018-04-11 15:21:03,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:21:03,166 INFO L459 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2018-04-11 15:21:03,166 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-11 15:21:03,166 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2018-04-11 15:21:03,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-11 15:21:03,166 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:21:03,166 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:21:03,166 INFO L408 AbstractCegarLoop]: === Iteration 41 === [__U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:21:03,166 INFO L82 PathProgramCache]: Analyzing trace with hash 433179995, now seen corresponding path program 6 times [2018-04-11 15:21:03,166 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:21:03,166 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:21:03,167 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:21:03,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:21:03,167 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:21:03,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:21:03,174 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:21:03,176 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:21:03,176 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:21:03,176 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:21:03,176 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:21:03,235 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-04-11 15:21:03,235 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:21:03,242 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:21:03,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:21:03,252 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:21:03,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:21:03,258 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:21:03,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:21:03,262 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:21:03,277 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:21:03,278 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:21:03,278 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:21:03,287 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:21:03,288 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:21:03,289 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:21:03,289 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:21:03,294 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:21:03,294 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:21:03,698 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:21:03,698 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:21:03,699 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-11 15:21:03,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 15:21:03,699 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 15:21:03,699 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=552, Unknown=0, NotChecked=0, Total=600 [2018-04-11 15:21:03,699 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand 25 states. [2018-04-11 15:21:04,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:21:04,533 INFO L93 Difference]: Finished difference Result 128 states and 137 transitions. [2018-04-11 15:21:04,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 15:21:04,533 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 55 [2018-04-11 15:21:04,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:21:04,534 INFO L225 Difference]: With dead ends: 128 [2018-04-11 15:21:04,534 INFO L226 Difference]: Without dead ends: 128 [2018-04-11 15:21:04,534 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=147, Invalid=2015, Unknown=0, NotChecked=0, Total=2162 [2018-04-11 15:21:04,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-04-11 15:21:04,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 115. [2018-04-11 15:21:04,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-04-11 15:21:04,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 123 transitions. [2018-04-11 15:21:04,536 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 123 transitions. Word has length 55 [2018-04-11 15:21:04,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:21:04,536 INFO L459 AbstractCegarLoop]: Abstraction has 115 states and 123 transitions. [2018-04-11 15:21:04,536 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 15:21:04,536 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 123 transitions. [2018-04-11 15:21:04,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-04-11 15:21:04,536 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:21:04,536 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:21:04,536 INFO L408 AbstractCegarLoop]: === Iteration 42 === [__U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:21:04,537 INFO L82 PathProgramCache]: Analyzing trace with hash 895269952, now seen corresponding path program 8 times [2018-04-11 15:21:04,537 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:21:04,537 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:21:04,537 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:21:04,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:21:04,537 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:21:04,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:21:04,547 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:21:04,549 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:21:04,550 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:21:04,550 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:21:04,550 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:21:04,590 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:21:04,590 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:21:04,595 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:21:04,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:21:04,610 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:21:04,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:21:04,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:21:04,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:21:04,619 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:21:04,631 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:21:04,632 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:21:04,632 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:21:04,632 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:21:04,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:21:04,637 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:21:04,641 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:21:04,641 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:21:05,139 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:21:05,139 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:21:05,139 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-11 15:21:05,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 15:21:05,140 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 15:21:05,140 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=552, Unknown=0, NotChecked=0, Total=600 [2018-04-11 15:21:05,140 INFO L87 Difference]: Start difference. First operand 115 states and 123 transitions. Second operand 25 states. [2018-04-11 15:21:06,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:21:06,128 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2018-04-11 15:21:06,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 15:21:06,128 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 56 [2018-04-11 15:21:06,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:21:06,128 INFO L225 Difference]: With dead ends: 140 [2018-04-11 15:21:06,129 INFO L226 Difference]: Without dead ends: 140 [2018-04-11 15:21:06,129 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=147, Invalid=2015, Unknown=0, NotChecked=0, Total=2162 [2018-04-11 15:21:06,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-04-11 15:21:06,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 115. [2018-04-11 15:21:06,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-04-11 15:21:06,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 123 transitions. [2018-04-11 15:21:06,130 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 123 transitions. Word has length 56 [2018-04-11 15:21:06,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:21:06,131 INFO L459 AbstractCegarLoop]: Abstraction has 115 states and 123 transitions. [2018-04-11 15:21:06,131 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 15:21:06,131 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 123 transitions. [2018-04-11 15:21:06,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-11 15:21:06,131 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:21:06,131 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 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:21:06,131 INFO L408 AbstractCegarLoop]: === Iteration 43 === [__U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:21:06,131 INFO L82 PathProgramCache]: Analyzing trace with hash 32649415, now seen corresponding path program 9 times [2018-04-11 15:21:06,131 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:21:06,131 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:21:06,132 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:21:06,132 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:21:06,132 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:21:06,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:21:06,140 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:21:06,178 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:21:06,178 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:21:06,178 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:21:06,179 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:21:06,224 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-11 15:21:06,224 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:21:06,228 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:21:06,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:21:06,231 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:21:06,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:21:06,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:21:06,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:21:06,238 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:21:06,247 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:21:06,248 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:21:06,249 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:21:06,255 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:21:06,256 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:21:06,256 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:21:06,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:21:06,260 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:21:06,260 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:21:06,538 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:21:06,539 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:21:06,539 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-11 15:21:06,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 15:21:06,539 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 15:21:06,539 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552 [2018-04-11 15:21:06,539 INFO L87 Difference]: Start difference. First operand 115 states and 123 transitions. Second operand 24 states. [2018-04-11 15:21:07,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:21:07,226 INFO L93 Difference]: Finished difference Result 135 states and 143 transitions. [2018-04-11 15:21:07,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 15:21:07,226 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 57 [2018-04-11 15:21:07,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:21:07,227 INFO L225 Difference]: With dead ends: 135 [2018-04-11 15:21:07,227 INFO L226 Difference]: Without dead ends: 135 [2018-04-11 15:21:07,227 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=1758, Unknown=0, NotChecked=0, Total=1892 [2018-04-11 15:21:07,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-04-11 15:21:07,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 115. [2018-04-11 15:21:07,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-04-11 15:21:07,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 123 transitions. [2018-04-11 15:21:07,229 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 123 transitions. Word has length 57 [2018-04-11 15:21:07,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:21:07,229 INFO L459 AbstractCegarLoop]: Abstraction has 115 states and 123 transitions. [2018-04-11 15:21:07,229 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 15:21:07,229 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 123 transitions. [2018-04-11 15:21:07,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-11 15:21:07,229 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:21:07,229 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:21:07,229 INFO L408 AbstractCegarLoop]: === Iteration 44 === [__U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:21:07,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1099233406, now seen corresponding path program 7 times [2018-04-11 15:21:07,229 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:21:07,229 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:21:07,230 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:21:07,230 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:21:07,230 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:21:07,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:21:07,237 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:21:07,239 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:21:07,239 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:21:07,239 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:21:07,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:21:07,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:21:07,257 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:21:07,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:21:07,263 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:21:07,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 6 treesize of output 5 [2018-04-11 15:21:07,270 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:21:07,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:21:07,274 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:21:07,286 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:21:07,286 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:21:07,287 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:21:07,292 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:21:07,293 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:21:07,293 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:21:07,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:21:07,297 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:21:07,297 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:21:08,448 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:21:08,448 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:21:08,448 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-11 15:21:08,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-11 15:21:08,449 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-11 15:21:08,449 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=647, Unknown=0, NotChecked=0, Total=702 [2018-04-11 15:21:08,449 INFO L87 Difference]: Start difference. First operand 115 states and 123 transitions. Second operand 27 states. [2018-04-11 15:21:09,948 WARN L148 SmtUtils]: Spent 153ms on a formula simplification that was a NOOP. DAG size: 55 [2018-04-11 15:21:10,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:21:10,228 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions. [2018-04-11 15:21:10,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-11 15:21:10,228 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 59 [2018-04-11 15:21:10,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:21:10,228 INFO L225 Difference]: With dead ends: 150 [2018-04-11 15:21:10,228 INFO L226 Difference]: Without dead ends: 150 [2018-04-11 15:21:10,229 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=156, Invalid=2196, Unknown=0, NotChecked=0, Total=2352 [2018-04-11 15:21:10,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-04-11 15:21:10,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 120. [2018-04-11 15:21:10,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-04-11 15:21:10,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2018-04-11 15:21:10,230 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 59 [2018-04-11 15:21:10,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:21:10,231 INFO L459 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2018-04-11 15:21:10,231 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-11 15:21:10,231 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2018-04-11 15:21:10,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-11 15:21:10,231 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:21:10,231 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:21:10,231 INFO L408 AbstractCegarLoop]: === Iteration 45 === [__U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:21:10,231 INFO L82 PathProgramCache]: Analyzing trace with hash -115109023, now seen corresponding path program 10 times [2018-04-11 15:21:10,231 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:21:10,231 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:21:10,232 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:21:10,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:21:10,232 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:21:10,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:21:10,239 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:21:10,241 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:21:10,241 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:21:10,241 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:21:10,241 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:21:10,263 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:21:10,263 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:21:10,266 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:21:10,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:21:10,283 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:21:10,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:21:10,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:21:10,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:21:10,292 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:21:10,305 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:21:10,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:21:10,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:21:10,325 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:21:10,326 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:21:10,327 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:21:10,327 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:21:10,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:21:10,334 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:16 [2018-04-11 15:21:11,606 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 103 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:21:11,606 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:21:11,607 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-04-11 15:21:11,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-11 15:21:11,607 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-11 15:21:11,607 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=751, Unknown=0, NotChecked=0, Total=812 [2018-04-11 15:21:11,607 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 29 states. [2018-04-11 15:21:13,483 WARN L151 SmtUtils]: Spent 281ms on a formula simplification. DAG size of input: 65 DAG size of output 64 [2018-04-11 15:21:13,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:21:13,913 INFO L93 Difference]: Finished difference Result 155 states and 163 transitions. [2018-04-11 15:21:13,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-11 15:21:13,914 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 60 [2018-04-11 15:21:13,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:21:13,914 INFO L225 Difference]: With dead ends: 155 [2018-04-11 15:21:13,914 INFO L226 Difference]: Without dead ends: 155 [2018-04-11 15:21:13,915 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=181, Invalid=2681, Unknown=0, NotChecked=0, Total=2862 [2018-04-11 15:21:13,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-04-11 15:21:13,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 120. [2018-04-11 15:21:13,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-04-11 15:21:13,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2018-04-11 15:21:13,916 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 60 [2018-04-11 15:21:13,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:21:13,916 INFO L459 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2018-04-11 15:21:13,916 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-11 15:21:13,916 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2018-04-11 15:21:13,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-11 15:21:13,917 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:21:13,917 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:21:13,917 INFO L408 AbstractCegarLoop]: === Iteration 46 === [__U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:21:13,917 INFO L82 PathProgramCache]: Analyzing trace with hash -888109124, now seen corresponding path program 6 times [2018-04-11 15:21:13,917 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:21:13,917 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:21:13,917 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:21:13,917 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:21:13,917 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:21:13,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:21:13,929 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:21:13,933 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:21:13,933 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:21:13,933 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:21:13,934 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:21:14,010 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-04-11 15:21:14,010 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:21:14,019 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:21:14,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:21:14,033 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:21:14,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:21:14,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:21:14,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:21:14,043 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:21:14,055 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:21:14,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:21:14,057 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:21:14,068 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:21:14,069 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:21:14,069 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:21:14,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:21:14,076 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:21:14,076 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:21:14,422 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:21:14,423 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:21:14,423 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-11 15:21:14,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 15:21:14,423 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 15:21:14,424 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-04-11 15:21:14,424 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 25 states. [2018-04-11 15:21:15,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:21:15,219 INFO L93 Difference]: Finished difference Result 145 states and 154 transitions. [2018-04-11 15:21:15,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 15:21:15,219 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 60 [2018-04-11 15:21:15,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:21:15,220 INFO L225 Difference]: With dead ends: 145 [2018-04-11 15:21:15,220 INFO L226 Difference]: Without dead ends: 145 [2018-04-11 15:21:15,220 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=148, Invalid=2014, Unknown=0, NotChecked=0, Total=2162 [2018-04-11 15:21:15,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-04-11 15:21:15,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 121. [2018-04-11 15:21:15,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-04-11 15:21:15,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 130 transitions. [2018-04-11 15:21:15,221 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 130 transitions. Word has length 60 [2018-04-11 15:21:15,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:21:15,221 INFO L459 AbstractCegarLoop]: Abstraction has 121 states and 130 transitions. [2018-04-11 15:21:15,221 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 15:21:15,222 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 130 transitions. [2018-04-11 15:21:15,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-11 15:21:15,222 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:21:15,222 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 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:21:15,222 INFO L408 AbstractCegarLoop]: === Iteration 47 === [__U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:21:15,222 INFO L82 PathProgramCache]: Analyzing trace with hash -20742010, now seen corresponding path program 11 times [2018-04-11 15:21:15,222 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:21:15,222 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:21:15,223 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:21:15,223 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:21:15,223 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:21:15,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:21:15,231 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:21:15,233 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:21:15,234 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:21:15,234 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:21:15,234 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:21:15,265 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-04-11 15:21:15,265 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:21:15,268 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:21:15,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:21:15,275 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:21:15,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:21:15,282 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:21:15,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:21:15,288 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:21:15,314 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:21:15,316 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:21:15,316 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:21:15,328 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:21:15,329 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:21:15,329 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:21:15,329 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:21:15,336 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:21:15,336 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:21:16,673 WARN L148 SmtUtils]: Spent 137ms on a formula simplification that was a NOOP. DAG size: 48 [2018-04-11 15:21:17,008 WARN L148 SmtUtils]: Spent 126ms on a formula simplification that was a NOOP. DAG size: 50 [2018-04-11 15:21:17,344 WARN L148 SmtUtils]: Spent 154ms on a formula simplification that was a NOOP. DAG size: 52 [2018-04-11 15:21:17,774 WARN L148 SmtUtils]: Spent 105ms on a formula simplification that was a NOOP. DAG size: 54 [2018-04-11 15:21:17,791 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:21:17,791 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:21:17,792 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-11 15:21:17,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-11 15:21:17,792 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-11 15:21:17,792 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=699, Unknown=0, NotChecked=0, Total=756 [2018-04-11 15:21:17,792 INFO L87 Difference]: Start difference. First operand 121 states and 130 transitions. Second operand 28 states. [2018-04-11 15:21:19,624 WARN L148 SmtUtils]: Spent 105ms on a formula simplification that was a NOOP. DAG size: 55 [2018-04-11 15:21:19,994 WARN L148 SmtUtils]: Spent 133ms on a formula simplification that was a NOOP. DAG size: 57 [2018-04-11 15:21:20,362 WARN L148 SmtUtils]: Spent 163ms on a formula simplification that was a NOOP. DAG size: 59 [2018-04-11 15:21:22,060 WARN L148 SmtUtils]: Spent 149ms on a formula simplification that was a NOOP. DAG size: 61 [2018-04-11 15:21:22,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:21:22,107 INFO L93 Difference]: Finished difference Result 153 states and 162 transitions. [2018-04-11 15:21:22,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-11 15:21:22,107 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 61 [2018-04-11 15:21:22,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:21:22,108 INFO L225 Difference]: With dead ends: 153 [2018-04-11 15:21:22,108 INFO L226 Difference]: Without dead ends: 153 [2018-04-11 15:21:22,108 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=151, Invalid=2299, Unknown=0, NotChecked=0, Total=2450 [2018-04-11 15:21:22,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-04-11 15:21:22,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 121. [2018-04-11 15:21:22,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-04-11 15:21:22,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 130 transitions. [2018-04-11 15:21:22,110 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 130 transitions. Word has length 61 [2018-04-11 15:21:22,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:21:22,110 INFO L459 AbstractCegarLoop]: Abstraction has 121 states and 130 transitions. [2018-04-11 15:21:22,110 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-11 15:21:22,110 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 130 transitions. [2018-04-11 15:21:22,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-11 15:21:22,111 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:21:22,111 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:21:22,111 INFO L408 AbstractCegarLoop]: === Iteration 48 === [__U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:21:22,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1171766948, now seen corresponding path program 7 times [2018-04-11 15:21:22,111 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:21:22,111 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:21:22,111 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:21:22,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:21:22,112 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:21:22,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:21:22,120 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:21:22,172 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:21:22,172 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:21:22,172 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:21:22,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:21:22,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:21:22,216 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:21:22,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:21:22,221 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:21:22,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:21:22,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:21:22,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:21:22,234 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:21:22,245 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:21:22,245 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:21:22,246 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:21:22,253 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:21:22,254 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:21:22,254 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:21:22,254 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:21:22,258 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:21:22,258 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:21:24,310 WARN L148 SmtUtils]: Spent 974ms on a formula simplification that was a NOOP. DAG size: 44 [2018-04-11 15:21:24,680 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:21:24,681 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:21:24,681 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-04-11 15:21:24,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-11 15:21:24,681 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-11 15:21:24,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=921, Unknown=0, NotChecked=0, Total=992 [2018-04-11 15:21:24,681 INFO L87 Difference]: Start difference. First operand 121 states and 130 transitions. Second operand 32 states. [2018-04-11 15:21:26,710 WARN L151 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 55 DAG size of output 54 [2018-04-11 15:21:27,819 WARN L148 SmtUtils]: Spent 1030ms on a formula simplification that was a NOOP. DAG size: 51 [2018-04-11 15:21:28,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:21:28,254 INFO L93 Difference]: Finished difference Result 139 states and 149 transitions. [2018-04-11 15:21:28,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-11 15:21:28,254 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 61 [2018-04-11 15:21:28,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:21:28,255 INFO L225 Difference]: With dead ends: 139 [2018-04-11 15:21:28,255 INFO L226 Difference]: Without dead ends: 139 [2018-04-11 15:21:28,255 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 617 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=200, Invalid=3222, Unknown=0, NotChecked=0, Total=3422 [2018-04-11 15:21:28,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-04-11 15:21:28,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 126. [2018-04-11 15:21:28,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-04-11 15:21:28,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 135 transitions. [2018-04-11 15:21:28,257 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 135 transitions. Word has length 61 [2018-04-11 15:21:28,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:21:28,257 INFO L459 AbstractCegarLoop]: Abstraction has 126 states and 135 transitions. [2018-04-11 15:21:28,257 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-11 15:21:28,257 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 135 transitions. [2018-04-11 15:21:28,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-11 15:21:28,257 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:21:28,257 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 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:21:28,257 INFO L408 AbstractCegarLoop]: === Iteration 49 === [__U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:21:28,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1613445025, now seen corresponding path program 12 times [2018-04-11 15:21:28,257 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:21:28,257 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:21:28,258 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:21:28,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:21:28,258 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:21:28,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:21:28,265 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:21:28,303 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:21:28,303 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:21:28,303 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:21:28,303 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:21:28,336 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-04-11 15:21:28,336 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:21:28,340 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:21:28,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:21:28,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:21:28,354 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:21:28,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:21:28,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:21:28,357 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:21:28,367 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:21:28,368 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:21:28,368 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:21:28,376 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:21:28,376 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:21:28,377 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:21:28,377 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:21:28,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:21:28,384 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:23 [2018-04-11 15:21:28,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-04-11 15:21:28,528 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:21:28,531 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:21:28,532 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:11 [2018-04-11 15:21:28,809 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:21:28,809 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:21:28,809 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-11 15:21:28,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-11 15:21:28,810 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-11 15:21:28,810 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=700, Unknown=0, NotChecked=0, Total=756 [2018-04-11 15:21:28,810 INFO L87 Difference]: Start difference. First operand 126 states and 135 transitions. Second operand 28 states. [2018-04-11 15:21:29,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:21:29,913 INFO L93 Difference]: Finished difference Result 151 states and 160 transitions. [2018-04-11 15:21:29,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 15:21:29,913 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 62 [2018-04-11 15:21:29,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:21:29,913 INFO L225 Difference]: With dead ends: 151 [2018-04-11 15:21:29,914 INFO L226 Difference]: Without dead ends: 151 [2018-04-11 15:21:29,914 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=171, Invalid=2585, Unknown=0, NotChecked=0, Total=2756 [2018-04-11 15:21:29,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-04-11 15:21:29,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 126. [2018-04-11 15:21:29,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-04-11 15:21:29,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 135 transitions. [2018-04-11 15:21:29,915 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 135 transitions. Word has length 62 [2018-04-11 15:21:29,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:21:29,915 INFO L459 AbstractCegarLoop]: Abstraction has 126 states and 135 transitions. [2018-04-11 15:21:29,915 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-11 15:21:29,916 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 135 transitions. [2018-04-11 15:21:29,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-11 15:21:29,916 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:21:29,916 INFO L355 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:21:29,916 INFO L408 AbstractCegarLoop]: === Iteration 50 === [__U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:21:29,916 INFO L82 PathProgramCache]: Analyzing trace with hash -461640060, now seen corresponding path program 8 times [2018-04-11 15:21:29,916 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:21:29,916 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:21:29,916 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:21:29,917 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:21:29,917 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:21:29,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:21:29,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:21:29,925 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:21:29,925 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:21:29,925 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:21:29,926 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:21:29,950 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:21:29,951 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:21:29,954 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:21:29,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:21:29,973 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:21:29,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:21:29,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:21:29,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:21:29,993 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:21:30,006 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:21:30,006 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:21:30,007 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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:21:30,007 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:21:30,013 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:21:30,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:21:30,017 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:21:30,018 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:21:31,186 WARN L148 SmtUtils]: Spent 334ms on a formula simplification that was a NOOP. DAG size: 45 [2018-04-11 15:21:33,750 WARN L148 SmtUtils]: Spent 365ms on a formula simplification that was a NOOP. DAG size: 47 [2018-04-11 15:21:34,177 WARN L148 SmtUtils]: Spent 204ms on a formula simplification that was a NOOP. DAG size: 50 [2018-04-11 15:21:39,110 WARN L148 SmtUtils]: Spent 2239ms on a formula simplification that was a NOOP. DAG size: 54 [2018-04-11 15:21:41,871 WARN L148 SmtUtils]: Spent 2556ms on a formula simplification that was a NOOP. DAG size: 53 [2018-04-11 15:21:42,314 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:21:42,315 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:21:42,315 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-04-11 15:21:42,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-11 15:21:42,315 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-11 15:21:42,315 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=750, Unknown=2, NotChecked=0, Total=812 [2018-04-11 15:21:42,315 INFO L87 Difference]: Start difference. First operand 126 states and 135 transitions. Second operand 29 states. [2018-04-11 15:21:44,926 WARN L148 SmtUtils]: Spent 201ms on a formula simplification that was a NOOP. DAG size: 52 [2018-04-11 15:21:45,295 WARN L148 SmtUtils]: Spent 152ms on a formula simplification that was a NOOP. DAG size: 54 [2018-04-11 15:21:45,786 WARN L148 SmtUtils]: Spent 128ms on a formula simplification that was a NOOP. DAG size: 57 [2018-04-11 15:21:46,484 WARN L148 SmtUtils]: Spent 428ms on a formula simplification that was a NOOP. DAG size: 61 [2018-04-11 15:21:47,181 WARN L151 SmtUtils]: Spent 515ms on a formula simplification. DAG size of input: 64 DAG size of output 63 [2018-04-11 15:21:47,456 WARN L148 SmtUtils]: Spent 138ms on a formula simplification that was a NOOP. DAG size: 60 [2018-04-11 15:21:47,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:21:47,792 INFO L93 Difference]: Finished difference Result 166 states and 175 transitions. [2018-04-11 15:21:47,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 15:21:47,792 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 64 [2018-04-11 15:21:47,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:21:47,793 INFO L225 Difference]: With dead ends: 166 [2018-04-11 15:21:47,793 INFO L226 Difference]: Without dead ends: 166 [2018-04-11 15:21:47,793 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=167, Invalid=2587, Unknown=2, NotChecked=0, Total=2756 [2018-04-11 15:21:47,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-04-11 15:21:47,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 131. [2018-04-11 15:21:47,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-04-11 15:21:47,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 140 transitions. [2018-04-11 15:21:47,795 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 140 transitions. Word has length 64 [2018-04-11 15:21:47,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:21:47,795 INFO L459 AbstractCegarLoop]: Abstraction has 131 states and 140 transitions. [2018-04-11 15:21:47,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-11 15:21:47,795 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 140 transitions. [2018-04-11 15:21:47,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-04-11 15:21:47,795 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:21:47,795 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:21:47,795 INFO L408 AbstractCegarLoop]: === Iteration 51 === [__U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:21:47,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1057294843, now seen corresponding path program 13 times [2018-04-11 15:21:47,795 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:21:47,795 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:21:47,796 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:21:47,796 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:21:47,796 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:21:47,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:21:47,804 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:21:47,806 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:21:47,806 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:21:47,806 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:21:47,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:21:47,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:21:47,836 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:21:47,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:21:47,842 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:21:47,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:21:47,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:21:47,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:21:47,851 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:21:47,861 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:21:47,862 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:21:47,862 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:21:47,862 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:21:47,867 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:21:47,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:21:47,871 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:21:47,871 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:21:49,792 WARN L148 SmtUtils]: Spent 786ms on a formula simplification that was a NOOP. DAG size: 54 [2018-04-11 15:21:50,347 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:21:50,348 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:21:50,348 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-04-11 15:21:50,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-11 15:21:50,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-11 15:21:50,348 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=866, Unknown=0, NotChecked=0, Total=930 [2018-04-11 15:21:50,348 INFO L87 Difference]: Start difference. First operand 131 states and 140 transitions. Second operand 31 states. [2018-04-11 15:21:52,639 WARN L151 SmtUtils]: Spent 197ms on a formula simplification. DAG size of input: 64 DAG size of output 63 [2018-04-11 15:21:53,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:21:53,260 INFO L93 Difference]: Finished difference Result 171 states and 180 transitions. [2018-04-11 15:21:53,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-11 15:21:53,260 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 65 [2018-04-11 15:21:53,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:21:53,261 INFO L225 Difference]: With dead ends: 171 [2018-04-11 15:21:53,261 INFO L226 Difference]: Without dead ends: 171 [2018-04-11 15:21:53,262 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=190, Invalid=3116, Unknown=0, NotChecked=0, Total=3306 [2018-04-11 15:21:53,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-04-11 15:21:53,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 131. [2018-04-11 15:21:53,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-04-11 15:21:53,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 140 transitions. [2018-04-11 15:21:53,264 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 140 transitions. Word has length 65 [2018-04-11 15:21:53,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:21:53,264 INFO L459 AbstractCegarLoop]: Abstraction has 131 states and 140 transitions. [2018-04-11 15:21:53,264 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-11 15:21:53,264 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 140 transitions. [2018-04-11 15:21:53,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-11 15:21:53,264 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:21:53,265 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 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:21:53,265 INFO L408 AbstractCegarLoop]: === Iteration 52 === [__U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:21:53,265 INFO L82 PathProgramCache]: Analyzing trace with hash 308967424, now seen corresponding path program 14 times [2018-04-11 15:21:53,265 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:21:53,265 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:21:53,265 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:21:53,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:21:53,265 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:21:53,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:21:53,273 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:21:53,275 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:21:53,275 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:21:53,275 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:21:53,276 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:21:53,300 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:21:53,300 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:21:53,303 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:21:53,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:21:53,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:21:53,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:21:53,311 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:21:53,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:21:53,314 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:21:53,324 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:21:53,324 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:21:53,325 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:21:53,340 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:21:53,340 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:21:53,341 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:21:53,341 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:21:53,344 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:21:53,345 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:21:53,716 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 0 proven. 113 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:21:53,716 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:21:53,716 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-04-11 15:21:53,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-11 15:21:53,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-11 15:21:53,717 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=756, Unknown=0, NotChecked=0, Total=812 [2018-04-11 15:21:53,717 INFO L87 Difference]: Start difference. First operand 131 states and 140 transitions. Second operand 29 states. [2018-04-11 15:21:54,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:21:54,822 INFO L93 Difference]: Finished difference Result 175 states and 185 transitions. [2018-04-11 15:21:54,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-11 15:21:54,823 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 66 [2018-04-11 15:21:54,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:21:54,823 INFO L225 Difference]: With dead ends: 175 [2018-04-11 15:21:54,823 INFO L226 Difference]: Without dead ends: 175 [2018-04-11 15:21:54,824 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=175, Invalid=2795, Unknown=0, NotChecked=0, Total=2970 [2018-04-11 15:21:54,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-04-11 15:21:54,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 136. [2018-04-11 15:21:54,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-04-11 15:21:54,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 147 transitions. [2018-04-11 15:21:54,826 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 147 transitions. Word has length 66 [2018-04-11 15:21:54,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:21:54,826 INFO L459 AbstractCegarLoop]: Abstraction has 136 states and 147 transitions. [2018-04-11 15:21:54,826 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-11 15:21:54,826 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 147 transitions. [2018-04-11 15:21:54,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-11 15:21:54,826 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:21:54,826 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:21:54,826 INFO L408 AbstractCegarLoop]: === Iteration 53 === [__U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:21:54,827 INFO L82 PathProgramCache]: Analyzing trace with hash -464032677, now seen corresponding path program 7 times [2018-04-11 15:21:54,827 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:21:54,827 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:21:54,827 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:21:54,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:21:54,827 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:21:54,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:21:54,835 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:21:54,858 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:21:54,858 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:21:54,858 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:21:54,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:21:54,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:21:54,908 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:21:54,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:21:54,912 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:21:54,916 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:21:54,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:21:54,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:21:54,920 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:21:54,936 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:21:54,937 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:21:54,937 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:21:54,944 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:21:54,944 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:21:54,944 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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:21:54,945 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:21:54,948 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:21:54,949 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:21:56,986 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:21:56,986 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:21:56,986 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-04-11 15:21:56,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-11 15:21:56,987 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-11 15:21:56,987 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1053, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 15:21:56,987 INFO L87 Difference]: Start difference. First operand 136 states and 147 transitions. Second operand 34 states. [2018-04-11 15:21:59,592 WARN L148 SmtUtils]: Spent 171ms on a formula simplification that was a NOOP. DAG size: 55 [2018-04-11 15:22:00,147 WARN L148 SmtUtils]: Spent 115ms on a formula simplification that was a NOOP. DAG size: 56 [2018-04-11 15:22:00,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:22:00,321 INFO L93 Difference]: Finished difference Result 150 states and 160 transitions. [2018-04-11 15:22:00,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-11 15:22:00,322 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2018-04-11 15:22:00,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:22:00,322 INFO L225 Difference]: With dead ends: 150 [2018-04-11 15:22:00,322 INFO L226 Difference]: Without dead ends: 150 [2018-04-11 15:22:00,322 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=198, Invalid=3708, Unknown=0, NotChecked=0, Total=3906 [2018-04-11 15:22:00,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-04-11 15:22:00,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 132. [2018-04-11 15:22:00,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-04-11 15:22:00,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 142 transitions. [2018-04-11 15:22:00,324 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 142 transitions. Word has length 66 [2018-04-11 15:22:00,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:22:00,324 INFO L459 AbstractCegarLoop]: Abstraction has 132 states and 142 transitions. [2018-04-11 15:22:00,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-11 15:22:00,324 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 142 transitions. [2018-04-11 15:22:00,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-04-11 15:22:00,324 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:22:00,324 INFO L355 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:22:00,324 INFO L408 AbstractCegarLoop]: === Iteration 54 === [__U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:22:00,324 INFO L82 PathProgramCache]: Analyzing trace with hash -910298979, now seen corresponding path program 8 times [2018-04-11 15:22:00,324 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:22:00,324 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:22:00,325 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:22:00,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:22:00,325 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:22:00,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:22:00,333 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:22:00,348 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:22:00,348 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:22:00,348 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:22:00,348 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:22:00,370 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:22:00,370 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:22:00,375 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:22:00,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:22:00,378 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:22:00,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:22:00,391 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:22:00,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:22:00,395 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:22:00,432 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:22:00,433 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:22:00,434 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:22:00,445 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:22:00,446 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:22:00,446 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:22:00,447 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:22:00,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:22:00,453 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:16 [2018-04-11 15:22:02,131 WARN L148 SmtUtils]: Spent 147ms on a formula simplification that was a NOOP. DAG size: 49 [2018-04-11 15:22:03,340 WARN L148 SmtUtils]: Spent 139ms on a formula simplification that was a NOOP. DAG size: 52 [2018-04-11 15:22:04,410 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:22:04,410 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:22:04,410 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-04-11 15:22:04,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-11 15:22:04,411 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-11 15:22:04,411 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1180, Unknown=0, NotChecked=0, Total=1260 [2018-04-11 15:22:04,411 INFO L87 Difference]: Start difference. First operand 132 states and 142 transitions. Second operand 36 states. [2018-04-11 15:22:06,419 WARN L148 SmtUtils]: Spent 162ms on a formula simplification that was a NOOP. DAG size: 55 [2018-04-11 15:22:09,251 WARN L148 SmtUtils]: Spent 2487ms on a formula simplification that was a NOOP. DAG size: 58 [2018-04-11 15:22:11,868 WARN L151 SmtUtils]: Spent 345ms on a formula simplification. DAG size of input: 65 DAG size of output 64 [2018-04-11 15:22:12,095 WARN L148 SmtUtils]: Spent 106ms on a formula simplification that was a NOOP. DAG size: 61 [2018-04-11 15:22:12,491 WARN L148 SmtUtils]: Spent 166ms on a formula simplification that was a NOOP. DAG size: 65 [2018-04-11 15:22:12,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:22:12,683 INFO L93 Difference]: Finished difference Result 152 states and 163 transitions. [2018-04-11 15:22:12,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-11 15:22:12,683 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 67 [2018-04-11 15:22:12,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:22:12,684 INFO L225 Difference]: With dead ends: 152 [2018-04-11 15:22:12,684 INFO L226 Difference]: Without dead ends: 152 [2018-04-11 15:22:12,684 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 834 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=238, Invalid=4318, Unknown=0, NotChecked=0, Total=4556 [2018-04-11 15:22:12,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-04-11 15:22:12,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 137. [2018-04-11 15:22:12,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-04-11 15:22:12,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 147 transitions. [2018-04-11 15:22:12,685 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 147 transitions. Word has length 67 [2018-04-11 15:22:12,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:22:12,686 INFO L459 AbstractCegarLoop]: Abstraction has 137 states and 147 transitions. [2018-04-11 15:22:12,686 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-11 15:22:12,686 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 147 transitions. [2018-04-11 15:22:12,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-11 15:22:12,686 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:22:12,686 INFO L355 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 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:22:12,686 INFO L408 AbstractCegarLoop]: === Iteration 55 === [__U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:22:12,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1319298878, now seen corresponding path program 9 times [2018-04-11 15:22:12,686 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:22:12,686 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:22:12,687 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:22:12,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:22:12,687 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:22:12,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:22:12,694 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:22:12,697 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:22:12,697 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:22:12,697 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:22:12,698 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:22:12,719 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-04-11 15:22:12,720 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:22:12,723 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:22:12,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:22:12,725 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:22:12,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:22:12,730 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:22:12,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:22:12,733 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:22:12,743 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:22:12,744 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:22:12,744 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:22:12,744 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:22:12,749 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:22:12,750 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:22:12,761 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:22:12,762 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:22:13,258 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:22:13,258 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:22:13,259 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-04-11 15:22:13,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-11 15:22:13,259 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-11 15:22:13,259 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=870, Unknown=0, NotChecked=0, Total=930 [2018-04-11 15:22:13,259 INFO L87 Difference]: Start difference. First operand 137 states and 147 transitions. Second operand 31 states. [2018-04-11 15:22:14,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:22:14,527 INFO L93 Difference]: Finished difference Result 143 states and 153 transitions. [2018-04-11 15:22:14,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-11 15:22:14,528 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 69 [2018-04-11 15:22:14,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:22:14,528 INFO L225 Difference]: With dead ends: 143 [2018-04-11 15:22:14,528 INFO L226 Difference]: Without dead ends: 143 [2018-04-11 15:22:14,528 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=183, Invalid=3239, Unknown=0, NotChecked=0, Total=3422 [2018-04-11 15:22:14,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-04-11 15:22:14,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2018-04-11 15:22:14,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-04-11 15:22:14,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 152 transitions. [2018-04-11 15:22:14,530 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 152 transitions. Word has length 69 [2018-04-11 15:22:14,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:22:14,530 INFO L459 AbstractCegarLoop]: Abstraction has 142 states and 152 transitions. [2018-04-11 15:22:14,530 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-11 15:22:14,530 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 152 transitions. [2018-04-11 15:22:14,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-04-11 15:22:14,530 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:22:14,531 INFO L355 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 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:22:14,531 INFO L408 AbstractCegarLoop]: === Iteration 56 === [__U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:22:14,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1491213754, now seen corresponding path program 8 times [2018-04-11 15:22:14,531 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:22:14,531 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:22:14,531 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:22:14,531 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:22:14,531 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:22:14,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:22:14,539 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:22:14,542 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:22:14,542 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:22:14,542 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:22:14,542 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:22:14,616 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:22:14,617 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:22:14,623 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:22:14,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:22:14,627 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:22:14,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:22:14,632 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:22:14,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:22:14,635 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:22:14,645 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:22:14,646 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:22:14,646 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:22:14,654 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:22:14,654 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:22:14,654 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:22:14,655 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:22:14,659 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:22:14,659 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:22:16,259 WARN L148 SmtUtils]: Spent 235ms on a formula simplification that was a NOOP. DAG size: 55 [2018-04-11 15:22:16,505 WARN L151 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 55 DAG size of output 51 [2018-04-11 15:22:16,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-04-11 15:22:16,996 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:22:17,180 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:22:17,180 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:111, output treesize:101 [2018-04-11 15:22:17,726 WARN L148 SmtUtils]: Spent 108ms on a formula simplification that was a NOOP. DAG size: 55 [2018-04-11 15:22:17,949 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:22:17,949 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:22:17,949 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-04-11 15:22:17,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-11 15:22:17,949 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-11 15:22:17,950 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=1468, Unknown=0, NotChecked=0, Total=1560 [2018-04-11 15:22:17,950 INFO L87 Difference]: Start difference. First operand 142 states and 152 transitions. Second operand 40 states. [2018-04-11 15:22:21,075 WARN L148 SmtUtils]: Spent 116ms on a formula simplification that was a NOOP. DAG size: 62 [2018-04-11 15:22:21,430 WARN L151 SmtUtils]: Spent 153ms on a formula simplification. DAG size of input: 91 DAG size of output 61 [2018-04-11 15:22:23,824 WARN L151 SmtUtils]: Spent 2280ms on a formula simplification. DAG size of input: 62 DAG size of output 58 [2018-04-11 15:22:24,037 WARN L151 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 66 DAG size of output 62 [2018-04-11 15:22:24,310 WARN L151 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 68 DAG size of output 64 [2018-04-11 15:22:24,548 WARN L151 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 71 DAG size of output 67 [2018-04-11 15:22:24,799 WARN L151 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 74 DAG size of output 69 [2018-04-11 15:22:25,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:22:25,447 INFO L93 Difference]: Finished difference Result 163 states and 174 transitions. [2018-04-11 15:22:25,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-11 15:22:25,447 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 72 [2018-04-11 15:22:25,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:22:25,448 INFO L225 Difference]: With dead ends: 163 [2018-04-11 15:22:25,448 INFO L226 Difference]: Without dead ends: 163 [2018-04-11 15:22:25,448 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1030 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=257, Invalid=5145, Unknown=0, NotChecked=0, Total=5402 [2018-04-11 15:22:25,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-04-11 15:22:25,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 143. [2018-04-11 15:22:25,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-04-11 15:22:25,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 154 transitions. [2018-04-11 15:22:25,449 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 154 transitions. Word has length 72 [2018-04-11 15:22:25,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:22:25,450 INFO L459 AbstractCegarLoop]: Abstraction has 143 states and 154 transitions. [2018-04-11 15:22:25,450 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-11 15:22:25,450 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 154 transitions. [2018-04-11 15:22:25,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-04-11 15:22:25,450 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:22:25,450 INFO L355 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:22:25,450 INFO L408 AbstractCegarLoop]: === Iteration 57 === [__U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:22:25,450 INFO L82 PathProgramCache]: Analyzing trace with hash -427201762, now seen corresponding path program 9 times [2018-04-11 15:22:25,450 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:22:25,450 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:22:25,451 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:22:25,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:22:25,451 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:22:25,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:22:25,461 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:22:25,463 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:22:25,463 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:22:25,463 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:22:25,463 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:22:25,557 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-04-11 15:22:25,558 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:22:25,566 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:22:25,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:22:25,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:22:25,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:22:25,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:22:25,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:22:25,576 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:22:25,588 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:22:25,589 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:22:25,589 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:22:25,595 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:22:25,595 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:22:25,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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:22:25,596 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:22:25,607 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:22:25,607 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:22:27,331 WARN L148 SmtUtils]: Spent 128ms on a formula simplification that was a NOOP. DAG size: 52 [2018-04-11 15:22:27,919 WARN L148 SmtUtils]: Spent 373ms on a formula simplification that was a NOOP. DAG size: 57 [2018-04-11 15:22:28,212 WARN L148 SmtUtils]: Spent 102ms on a formula simplification that was a NOOP. DAG size: 57 [2018-04-11 15:22:28,455 WARN L148 SmtUtils]: Spent 113ms on a formula simplification that was a NOOP. DAG size: 58 [2018-04-11 15:22:28,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-04-11 15:22:28,842 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:22:28,894 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:22:28,894 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:112, output treesize:102 [2018-04-11 15:22:29,205 WARN L148 SmtUtils]: Spent 170ms on a formula simplification that was a NOOP. DAG size: 57 [2018-04-11 15:22:29,230 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 0 proven. 243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:22:29,230 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:22:29,230 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-04-11 15:22:29,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-11 15:22:29,230 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-11 15:22:29,230 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1394, Unknown=0, NotChecked=0, Total=1482 [2018-04-11 15:22:29,230 INFO L87 Difference]: Start difference. First operand 143 states and 154 transitions. Second operand 39 states. [2018-04-11 15:22:33,531 WARN L151 SmtUtils]: Spent 291ms on a formula simplification. DAG size of input: 101 DAG size of output 70 [2018-04-11 15:22:33,967 WARN L148 SmtUtils]: Spent 248ms on a formula simplification that was a NOOP. DAG size: 64 [2018-04-11 15:22:34,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:22:34,597 INFO L93 Difference]: Finished difference Result 165 states and 177 transitions. [2018-04-11 15:22:34,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-11 15:22:34,597 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 73 [2018-04-11 15:22:34,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:22:34,597 INFO L225 Difference]: With dead ends: 165 [2018-04-11 15:22:34,598 INFO L226 Difference]: Without dead ends: 165 [2018-04-11 15:22:34,598 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 901 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=246, Invalid=4866, Unknown=0, NotChecked=0, Total=5112 [2018-04-11 15:22:34,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-04-11 15:22:34,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 148. [2018-04-11 15:22:34,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-04-11 15:22:34,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 159 transitions. [2018-04-11 15:22:34,599 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 159 transitions. Word has length 73 [2018-04-11 15:22:34,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:22:34,599 INFO L459 AbstractCegarLoop]: Abstraction has 148 states and 159 transitions. [2018-04-11 15:22:34,599 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-11 15:22:34,599 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 159 transitions. [2018-04-11 15:22:34,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-11 15:22:34,599 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:22:34,600 INFO L355 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 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:22:34,600 INFO L408 AbstractCegarLoop]: === Iteration 58 === [__U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:22:34,600 INFO L82 PathProgramCache]: Analyzing trace with hash -562911932, now seen corresponding path program 10 times [2018-04-11 15:22:34,600 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:22:34,600 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:22:34,600 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:22:34,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:22:34,600 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:22:34,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:22:34,607 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:22:34,609 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:22:34,609 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:22:34,609 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:22:34,610 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:22:34,638 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:22:34,638 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:22:34,641 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:22:34,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:22:34,644 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:22:34,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:22:34,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:22:34,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:22:34,651 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:22:34,661 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:22:34,662 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:22:34,662 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:22:34,668 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:22:34,668 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:22:34,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:22:34,668 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:22:34,672 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:22:34,672 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:22:35,570 WARN L148 SmtUtils]: Spent 206ms on a formula simplification that was a NOOP. DAG size: 45 [2018-04-11 15:22:38,827 WARN L148 SmtUtils]: Spent 382ms on a formula simplification that was a NOOP. DAG size: 58 [2018-04-11 15:22:39,982 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:22:39,982 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:22:39,982 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-04-11 15:22:39,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-11 15:22:39,982 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-11 15:22:39,982 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=987, Unknown=1, NotChecked=0, Total=1056 [2018-04-11 15:22:39,982 INFO L87 Difference]: Start difference. First operand 148 states and 159 transitions. Second operand 33 states. [2018-04-11 15:22:40,825 WARN L148 SmtUtils]: Spent 116ms on a formula simplification that was a NOOP. DAG size: 37 [2018-04-11 15:22:45,745 WARN L148 SmtUtils]: Spent 2880ms on a formula simplification that was a NOOP. DAG size: 65 [2018-04-11 15:22:46,415 WARN L151 SmtUtils]: Spent 172ms on a formula simplification. DAG size of input: 77 DAG size of output 76 [2018-04-11 15:22:47,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:22:47,005 INFO L93 Difference]: Finished difference Result 198 states and 209 transitions. [2018-04-11 15:22:47,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-11 15:22:47,006 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 74 [2018-04-11 15:22:47,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:22:47,006 INFO L225 Difference]: With dead ends: 198 [2018-04-11 15:22:47,006 INFO L226 Difference]: Without dead ends: 198 [2018-04-11 15:22:47,006 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=191, Invalid=3468, Unknown=1, NotChecked=0, Total=3660 [2018-04-11 15:22:47,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-04-11 15:22:47,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 153. [2018-04-11 15:22:47,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-04-11 15:22:47,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 164 transitions. [2018-04-11 15:22:47,008 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 164 transitions. Word has length 74 [2018-04-11 15:22:47,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:22:47,009 INFO L459 AbstractCegarLoop]: Abstraction has 153 states and 164 transitions. [2018-04-11 15:22:47,009 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-11 15:22:47,009 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 164 transitions. [2018-04-11 15:22:47,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-04-11 15:22:47,009 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:22:47,009 INFO L355 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 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:22:47,009 INFO L408 AbstractCegarLoop]: === Iteration 59 === [__U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:22:47,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1336737915, now seen corresponding path program 15 times [2018-04-11 15:22:47,010 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:22:47,010 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:22:47,010 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:22:47,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:22:47,011 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:22:47,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:22:47,022 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:22:47,025 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:22:47,025 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:22:47,025 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:22:47,025 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:22:47,075 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-04-11 15:22:47,075 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:22:47,080 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:22:47,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:22:47,083 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:22:47,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:22:47,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:22:47,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:22:47,092 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:22:47,105 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:22:47,106 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:22:47,107 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:22:47,107 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:22:47,114 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:22:47,114 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:22:47,119 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:22:47,119 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:22:50,195 WARN L148 SmtUtils]: Spent 2129ms on a formula simplification that was a NOOP. DAG size: 45 [2018-04-11 15:22:50,734 WARN L148 SmtUtils]: Spent 109ms on a formula simplification that was a NOOP. DAG size: 44 [2018-04-11 15:22:52,024 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:22:52,024 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:22:52,024 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-04-11 15:22:52,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-11 15:22:52,024 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-11 15:22:52,025 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=992, Unknown=0, NotChecked=0, Total=1056 [2018-04-11 15:22:52,025 INFO L87 Difference]: Start difference. First operand 153 states and 164 transitions. Second operand 33 states. [2018-04-11 15:22:57,009 WARN L151 SmtUtils]: Spent 405ms on a formula simplification. DAG size of input: 54 DAG size of output 53 [2018-04-11 15:22:59,658 WARN L148 SmtUtils]: Spent 100ms on a formula simplification that was a NOOP. DAG size: 51 [2018-04-11 15:22:59,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:22:59,835 INFO L93 Difference]: Finished difference Result 232 states and 243 transitions. [2018-04-11 15:22:59,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-11 15:22:59,835 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 75 [2018-04-11 15:22:59,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:22:59,836 INFO L225 Difference]: With dead ends: 232 [2018-04-11 15:22:59,836 INFO L226 Difference]: Without dead ends: 232 [2018-04-11 15:22:59,836 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=195, Invalid=3709, Unknown=2, NotChecked=0, Total=3906 [2018-04-11 15:22:59,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-04-11 15:22:59,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 153. [2018-04-11 15:22:59,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-04-11 15:22:59,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 164 transitions. [2018-04-11 15:22:59,838 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 164 transitions. Word has length 75 [2018-04-11 15:22:59,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:22:59,838 INFO L459 AbstractCegarLoop]: Abstraction has 153 states and 164 transitions. [2018-04-11 15:22:59,838 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-11 15:22:59,838 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 164 transitions. [2018-04-11 15:22:59,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-04-11 15:22:59,839 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:22:59,839 INFO L355 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 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:22:59,839 INFO L408 AbstractCegarLoop]: === Iteration 60 === [__U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:22:59,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1667105972, now seen corresponding path program 16 times [2018-04-11 15:22:59,839 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:22:59,839 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:22:59,840 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:22:59,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:22:59,840 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:22:59,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:22:59,857 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:22:59,861 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:22:59,861 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:22:59,861 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:22:59,862 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:22:59,948 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:22:59,948 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:22:59,953 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:22:59,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:22:59,957 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:22:59,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:22:59,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:22:59,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:22:59,966 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:22:59,980 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:22:59,980 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:22:59,981 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:22:59,981 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:22:59,987 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:22:59,988 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:00,006 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:23:00,006 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:23:02,117 WARN L148 SmtUtils]: Spent 107ms on a formula simplification that was a NOOP. DAG size: 47 [2018-04-11 15:23:03,905 WARN L148 SmtUtils]: Spent 186ms on a formula simplification that was a NOOP. DAG size: 59 [2018-04-11 15:23:04,155 WARN L148 SmtUtils]: Spent 109ms on a formula simplification that was a NOOP. DAG size: 60 [2018-04-11 15:23:04,424 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 204 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:23:04,424 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:23:04,425 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-04-11 15:23:04,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-11 15:23:04,425 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-11 15:23:04,425 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1471, Unknown=0, NotChecked=0, Total=1560 [2018-04-11 15:23:04,425 INFO L87 Difference]: Start difference. First operand 153 states and 164 transitions. Second operand 40 states. [2018-04-11 15:23:10,741 WARN L148 SmtUtils]: Spent 149ms on a formula simplification that was a NOOP. DAG size: 67 [2018-04-11 15:23:11,397 WARN L151 SmtUtils]: Spent 297ms on a formula simplification. DAG size of input: 70 DAG size of output 68 [2018-04-11 15:23:11,725 WARN L148 SmtUtils]: Spent 120ms on a formula simplification that was a NOOP. DAG size: 66 [2018-04-11 15:23:12,162 WARN L148 SmtUtils]: Spent 114ms on a formula simplification that was a NOOP. DAG size: 69 [2018-04-11 15:23:12,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:23:12,237 INFO L93 Difference]: Finished difference Result 177 states and 188 transitions. [2018-04-11 15:23:12,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-11 15:23:12,237 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 77 [2018-04-11 15:23:12,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:23:12,238 INFO L225 Difference]: With dead ends: 177 [2018-04-11 15:23:12,238 INFO L226 Difference]: Without dead ends: 177 [2018-04-11 15:23:12,238 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 989 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=265, Invalid=5435, Unknown=0, NotChecked=0, Total=5700 [2018-04-11 15:23:12,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-04-11 15:23:12,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 153. [2018-04-11 15:23:12,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-04-11 15:23:12,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 164 transitions. [2018-04-11 15:23:12,240 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 164 transitions. Word has length 77 [2018-04-11 15:23:12,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:23:12,240 INFO L459 AbstractCegarLoop]: Abstraction has 153 states and 164 transitions. [2018-04-11 15:23:12,240 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-11 15:23:12,240 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 164 transitions. [2018-04-11 15:23:12,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-04-11 15:23:12,241 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:23:12,241 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 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:23:12,241 INFO L408 AbstractCegarLoop]: === Iteration 61 === [__U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:23:12,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1134094466, now seen corresponding path program 17 times [2018-04-11 15:23:12,241 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:23:12,241 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:23:12,242 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:23:12,242 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:23:12,242 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:23:12,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:23:12,258 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:23:12,261 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:23:12,262 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:23:12,262 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:23:12,262 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:23:12,333 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-04-11 15:23:12,333 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:23:12,338 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:23:12,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:23:12,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:12,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:23:12,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:12,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:23:12,350 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:23:12,362 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:23:12,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:23:12,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:12,374 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:23:12,375 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:23:12,375 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:23:12,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:12,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:23:12,403 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:26 [2018-04-11 15:23:12,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-04-11 15:23:12,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:12,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:23:12,773 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:11 [2018-04-11 15:23:13,077 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:23:13,078 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:23:13,078 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-04-11 15:23:13,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-11 15:23:13,078 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-11 15:23:13,078 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1119, Unknown=0, NotChecked=0, Total=1190 [2018-04-11 15:23:13,078 INFO L87 Difference]: Start difference. First operand 153 states and 164 transitions. Second operand 35 states. [2018-04-11 15:23:15,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:23:15,078 INFO L93 Difference]: Finished difference Result 197 states and 209 transitions. [2018-04-11 15:23:15,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-11 15:23:15,079 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 78 [2018-04-11 15:23:15,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:23:15,079 INFO L225 Difference]: With dead ends: 197 [2018-04-11 15:23:15,079 INFO L226 Difference]: Without dead ends: 197 [2018-04-11 15:23:15,079 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 640 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=218, Invalid=4204, Unknown=0, NotChecked=0, Total=4422 [2018-04-11 15:23:15,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-04-11 15:23:15,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 158. [2018-04-11 15:23:15,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-04-11 15:23:15,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 171 transitions. [2018-04-11 15:23:15,081 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 171 transitions. Word has length 78 [2018-04-11 15:23:15,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:23:15,082 INFO L459 AbstractCegarLoop]: Abstraction has 158 states and 171 transitions. [2018-04-11 15:23:15,082 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-11 15:23:15,082 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 171 transitions. [2018-04-11 15:23:15,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-04-11 15:23:15,083 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:23:15,083 INFO L355 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 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:23:15,083 INFO L408 AbstractCegarLoop]: === Iteration 62 === [__U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncpy_alloca_true_valid_memsafety_true_termination_i__cstrncpyErr3RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:23:15,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1907094567, now seen corresponding path program 9 times [2018-04-11 15:23:15,083 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:23:15,083 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:23:15,084 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:23:15,084 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:23:15,084 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:23:15,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:23:15,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:23:15,104 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:23:15,105 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:23:15,105 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:23:15,105 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:23:15,230 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-04-11 15:23:15,230 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:23:15,246 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:23:15,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:23:15,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:15,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (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:23:15,261 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:15,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:23:15,265 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:23:15,277 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:23:15,278 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:23:15,279 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:15,287 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:23:15,287 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:23:15,288 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:23:15,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:23:15,292 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:23:15,293 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:23:16,022 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 252 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:23:16,022 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:23:16,022 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-04-11 15:23:16,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-11 15:23:16,023 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-11 15:23:16,023 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=927, Unknown=0, NotChecked=0, Total=992 [2018-04-11 15:23:16,023 INFO L87 Difference]: Start difference. First operand 158 states and 171 transitions. Second operand 32 states. Received shutdown request... [2018-04-11 15:23:17,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 15:23:17,101 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-11 15:23:17,104 WARN L197 ceAbstractionStarter]: Timeout [2018-04-11 15:23:17,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 03:23:17 BoogieIcfgContainer [2018-04-11 15:23:17,104 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 15:23:17,105 INFO L168 Benchmark]: Toolchain (without parser) took 185971.04 ms. Allocated memory was 403.7 MB in the beginning and 756.5 MB in the end (delta: 352.8 MB). Free memory was 335.1 MB in the beginning and 599.7 MB in the end (delta: -264.7 MB). Peak memory consumption was 88.2 MB. Max. memory is 5.3 GB. [2018-04-11 15:23:17,106 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 403.7 MB. Free memory is still 361.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 15:23:17,106 INFO L168 Benchmark]: CACSL2BoogieTranslator took 250.33 ms. Allocated memory is still 403.7 MB. Free memory was 333.2 MB in the beginning and 309.3 MB in the end (delta: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 5.3 GB. [2018-04-11 15:23:17,106 INFO L168 Benchmark]: Boogie Preprocessor took 37.13 ms. Allocated memory is still 403.7 MB. Free memory was 309.3 MB in the beginning and 306.7 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:23:17,106 INFO L168 Benchmark]: RCFGBuilder took 364.81 ms. Allocated memory was 403.7 MB in the beginning and 591.9 MB in the end (delta: 188.2 MB). Free memory was 306.7 MB in the beginning and 527.6 MB in the end (delta: -220.9 MB). Peak memory consumption was 23.5 MB. Max. memory is 5.3 GB. [2018-04-11 15:23:17,106 INFO L168 Benchmark]: TraceAbstraction took 185315.64 ms. Allocated memory was 591.9 MB in the beginning and 756.5 MB in the end (delta: 164.6 MB). Free memory was 527.6 MB in the beginning and 599.7 MB in the end (delta: -72.1 MB). Peak memory consumption was 92.5 MB. Max. memory is 5.3 GB. [2018-04-11 15:23:17,107 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.19 ms. Allocated memory is still 403.7 MB. Free memory is still 361.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 250.33 ms. Allocated memory is still 403.7 MB. Free memory was 333.2 MB in the beginning and 309.3 MB in the end (delta: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 37.13 ms. Allocated memory is still 403.7 MB. Free memory was 309.3 MB in the beginning and 306.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 364.81 ms. Allocated memory was 403.7 MB in the beginning and 591.9 MB in the end (delta: 188.2 MB). Free memory was 306.7 MB in the beginning and 527.6 MB in the end (delta: -220.9 MB). Peak memory consumption was 23.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 185315.64 ms. Allocated memory was 591.9 MB in the beginning and 756.5 MB in the end (delta: 164.6 MB). Free memory was 527.6 MB in the beginning and 599.7 MB in the end (delta: -72.1 MB). Peak memory consumption was 92.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (158states) and interpolant automaton (currently 24 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (112 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 547]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was constructing difference of abstraction (158states) and interpolant automaton (currently 24 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (112 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was constructing difference of abstraction (158states) and interpolant automaton (currently 24 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (112 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 547]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was constructing difference of abstraction (158states) and interpolant automaton (currently 24 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (112 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 547]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was constructing difference of abstraction (158states) and interpolant automaton (currently 24 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (112 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 547]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 547). Cancelled while BasicCegarLoop was constructing difference of abstraction (158states) and interpolant automaton (currently 24 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (112 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 567]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was constructing difference of abstraction (158states) and interpolant automaton (currently 24 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (112 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 556]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 556). Cancelled while BasicCegarLoop was constructing difference of abstraction (158states) and interpolant automaton (currently 24 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (112 states constructedinput type IntersectNwa). - TimeoutResultAtElement [Line: 567]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 567). Cancelled while BasicCegarLoop was constructing difference of abstraction (158states) and interpolant automaton (currently 24 states, 32 states before enhancement), while ReachableStatesComputation was computing reachable states (112 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 54 locations, 9 error locations. TIMEOUT Result, 185.2s OverallTime, 62 OverallIterations, 11 TraceHistogramMax, 108.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2140 SDtfs, 4051 SDslu, 33804 SDs, 0 SdLazy, 50170 SolverSat, 1315 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 22.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3699 GetRequests, 1423 SyntacticMatches, 5 SemanticMatches, 2271 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 17041 ImplicationChecksByTransitivity, 152.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158occurred in iteration=61, 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, 61 MinimizatonAttempts, 985 StatesRemovedByMinimization, 57 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 73.8s InterpolantComputationTime, 5428 NumberOfCodeBlocks, 5428 NumberOfCodeBlocksAsserted, 239 NumberOfCheckSat, 2754 ConstructedInterpolants, 201 QuantifiedInterpolants, 4015151 SizeOfPredicates, 1154 NumberOfNonLiveVariables, 14022 ConjunctsInSsa, 5029 ConjunctsInUnsatCore, 63 InterpolantComputations, 14 PerfectInterpolantSequences, 5/4256 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_15-23-17-112.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_15-23-17-112.csv Completed graceful shutdown