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_cstrncat-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 15:19:24,733 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 15:19:24,735 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 15:19:24,748 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 15:19:24,748 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 15:19:24,749 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 15:19:24,750 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 15:19:24,752 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 15:19:24,753 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 15:19:24,754 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 15:19:24,755 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 15:19:24,755 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 15:19:24,756 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 15:19:24,757 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 15:19:24,758 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 15:19:24,760 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 15:19:24,761 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 15:19:24,763 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 15:19:24,764 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 15:19:24,765 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 15:19:24,766 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 15:19:24,767 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 15:19:24,767 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 15:19:24,768 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 15:19:24,769 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 15:19:24,769 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 15:19:24,770 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 15:19:24,770 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 15:19:24,771 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 15:19:24,771 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 15:19:24,772 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 15:19:24,772 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-04-11 15:19:24,793 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 15:19:24,793 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 15:19:24,794 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 15:19:24,794 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 15:19:24,795 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 15:19:24,795 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 15:19:24,795 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 15:19:24,795 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 15:19:24,795 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 15:19:24,795 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 15:19:24,796 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 15:19:24,796 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 15:19:24,796 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 15:19:24,796 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 15:19:24,796 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 15:19:24,796 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 15:19:24,797 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 15:19:24,797 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 15:19:24,797 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 15:19:24,797 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 15:19:24,797 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 15:19:24,797 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 15:19:24,797 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 15:19:24,798 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-11 15:19:24,829 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 15:19:24,837 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 15:19:24,839 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 15:19:24,840 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 15:19:24,841 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 15:19:24,841 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,132 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG73d05f20a [2018-04-11 15:19:25,264 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 15:19:25,264 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 15:19:25,265 INFO L168 CDTParser]: Scanning openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,272 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 15:19:25,272 INFO L215 ultiparseSymbolTable]: [2018-04-11 15:19:25,272 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 15:19:25,272 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____bswap_64 ('__bswap_64') in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,272 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____bswap_32 ('__bswap_32') in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,272 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,272 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncat ('cstrncat') in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,272 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 15:19:25,272 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__div_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,273 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____suseconds_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,273 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__fsblkcnt_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,273 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__time_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,273 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__mode_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,273 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__caddr_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,273 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__u_int in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,273 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____rlim64_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,273 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__uid_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,273 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____uint32_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,273 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_rwlock_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,273 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____id_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,273 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__size_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,273 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____syscall_ulong_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,273 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____int32_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,273 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____caddr_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,273 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____mode_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,273 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____ssize_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,273 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__blksize_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,274 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__key_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,274 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____dev_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,274 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__pid_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,274 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__int32_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,274 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____u_short in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,274 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__fsfilcnt_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,274 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__fd_set in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,274 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__gid_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,274 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____blkcnt64_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,274 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__ulong in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,274 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____int8_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,274 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__register_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,275 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__sigset_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,275 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_barrierattr_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,275 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__daddr_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,275 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____uint16_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,275 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_key_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,275 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____time_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,275 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__int8_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,275 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____WAIT_STATUS in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,275 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____qaddr_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,275 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____blksize_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,275 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____syscall_slong_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,276 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____fsblkcnt_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,276 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____fsfilcnt_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,276 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__ino_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,276 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____useconds_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,276 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__loff_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,276 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____fsfilcnt64_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,276 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_mutex_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,276 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__u_int64_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,276 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__ldiv_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,276 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__ushort in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,276 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__u_quad_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,276 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____int64_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,277 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____key_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,277 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____uint8_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,277 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__clockid_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,277 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____clockid_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,277 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_spinlock_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,277 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____daddr_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,277 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_cond_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,277 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__int64_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,277 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__id_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,277 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_condattr_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,278 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____loff_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,278 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__quad_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,278 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____u_int in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,278 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__u_int16_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,278 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____fd_mask in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,278 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__fsid_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,278 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__dev_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,278 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__u_int8_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,278 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____clock_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,279 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____blkcnt_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,279 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,279 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____sig_atomic_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,279 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__u_long in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,279 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____ino64_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,279 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____ino_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,279 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__suseconds_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,279 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__uint in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,279 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____sigset_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,279 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__clock_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,279 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__fd_mask in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,280 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____uint64_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,280 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____off_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,280 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____fsid_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,280 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__nlink_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,280 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_rwlockattr_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,280 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____fsword_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,280 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____uid_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,280 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__ssize_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,280 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____u_long in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,280 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____int16_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,280 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__u_short in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,280 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__u_char in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,281 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__off_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,281 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__timer_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,281 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____nlink_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,281 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____pthread_list_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,281 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__u_int32_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,281 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__blkcnt_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,281 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_once_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,281 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____intptr_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,281 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____u_quad_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,281 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____off64_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,281 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_attr_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,281 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_barrier_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,281 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____u_char in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,281 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____gid_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,281 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____timer_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,282 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__lldiv_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,282 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____pid_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,282 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____socklen_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,282 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__int16_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,282 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__pthread_mutexattr_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,282 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____fsblkcnt64_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,282 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____rlim_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,282 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__wchar_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,282 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____quad_t in openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:25,296 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG73d05f20a [2018-04-11 15:19:25,299 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 15:19:25,300 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 15:19:25,300 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 15:19:25,300 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 15:19:25,304 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 15:19:25,304 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 03:19:25" (1/1) ... [2018-04-11 15:19:25,306 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a4ea829 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:19:25, skipping insertion in model container [2018-04-11 15:19:25,306 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 03:19:25" (1/1) ... [2018-04-11 15:19:25,316 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 15:19:25,339 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 15:19:25,463 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 15:19:25,501 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 15:19:25,507 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-11 15:19:25,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:19:25 WrapperNode [2018-04-11 15:19:25,537 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 15:19:25,538 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 15:19:25,538 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 15:19:25,538 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 15:19:25,549 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:19:25" (1/1) ... [2018-04-11 15:19:25,550 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:19:25" (1/1) ... [2018-04-11 15:19:25,561 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:19:25" (1/1) ... [2018-04-11 15:19:25,561 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:19:25" (1/1) ... [2018-04-11 15:19:25,568 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:19:25" (1/1) ... [2018-04-11 15:19:25,573 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:19:25" (1/1) ... [2018-04-11 15:19:25,574 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:19:25" (1/1) ... [2018-04-11 15:19:25,577 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 15:19:25,577 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 15:19:25,577 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 15:19:25,577 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 15:19:25,578 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:19:25" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 15:19:25,683 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 15:19:25,684 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 15:19:25,684 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-11 15:19:25,684 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-11 15:19:25,684 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncat [2018-04-11 15:19:25,684 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 15:19:25,684 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-11 15:19:25,684 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-11 15:19:25,684 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 15:19:25,684 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 15:19:25,684 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 15:19:25,685 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 15:19:25,685 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 15:19:25,685 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 15:19:25,685 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 15:19:25,685 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 15:19:25,685 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 15:19:25,685 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 15:19:25,685 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 15:19:25,685 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 15:19:25,686 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 15:19:25,686 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 15:19:25,686 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 15:19:25,686 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 15:19:25,686 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 15:19:25,686 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 15:19:25,686 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 15:19:25,686 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 15:19:25,687 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 15:19:25,687 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 15:19:25,687 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 15:19:25,687 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 15:19:25,687 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 15:19:25,687 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 15:19:25,687 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 15:19:25,687 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 15:19:25,687 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 15:19:25,687 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 15:19:25,688 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 15:19:25,688 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 15:19:25,688 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 15:19:25,688 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 15:19:25,688 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 15:19:25,688 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 15:19:25,688 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 15:19:25,688 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 15:19:25,688 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 15:19:25,689 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 15:19:25,689 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 15:19:25,689 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 15:19:25,689 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 15:19:25,689 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 15:19:25,689 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 15:19:25,689 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 15:19:25,689 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 15:19:25,689 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 15:19:25,690 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 15:19:25,690 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 15:19:25,690 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 15:19:25,690 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 15:19:25,690 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 15:19:25,690 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 15:19:25,690 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 15:19:25,690 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 15:19:25,690 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 15:19:25,690 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 15:19:25,691 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 15:19:25,691 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 15:19:25,691 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 15:19:25,691 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 15:19:25,691 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 15:19:25,691 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 15:19:25,691 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 15:19:25,691 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 15:19:25,691 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 15:19:25,691 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 15:19:25,692 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 15:19:25,692 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 15:19:25,692 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 15:19:25,692 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 15:19:25,692 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 15:19:25,692 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 15:19:25,692 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 15:19:25,692 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 15:19:25,692 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 15:19:25,692 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 15:19:25,693 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 15:19:25,693 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 15:19:25,693 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 15:19:25,693 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 15:19:25,693 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 15:19:25,693 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 15:19:25,693 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 15:19:25,693 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 15:19:25,693 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 15:19:25,693 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 15:19:25,693 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 15:19:25,694 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 15:19:25,694 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 15:19:25,694 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 15:19:25,694 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 15:19:25,694 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 15:19:25,694 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 15:19:25,694 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 15:19:25,694 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 15:19:25,694 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 15:19:25,694 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 15:19:25,695 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 15:19:25,695 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 15:19:25,695 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncat [2018-04-11 15:19:25,695 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 15:19:25,695 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 15:19:25,695 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 15:19:25,695 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 15:19:25,695 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 15:19:25,695 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 15:19:25,695 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 15:19:25,695 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 15:19:25,990 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 15:19:25,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 03:19:25 BoogieIcfgContainer [2018-04-11 15:19:25,991 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 15:19:25,991 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 15:19:25,991 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 15:19:25,993 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 15:19:25,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 03:19:25" (1/3) ... [2018-04-11 15:19:25,994 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2284621 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 03:19:25, skipping insertion in model container [2018-04-11 15:19:25,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:19:25" (2/3) ... [2018-04-11 15:19:25,994 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2284621 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 03:19:25, skipping insertion in model container [2018-04-11 15:19:25,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 03:19:25" (3/3) ... [2018-04-11 15:19:25,996 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:19:26,003 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 15:19:26,009 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-04-11 15:19:26,031 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 15:19:26,032 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 15:19:26,032 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 15:19:26,032 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 15:19:26,032 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 15:19:26,032 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 15:19:26,032 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 15:19:26,032 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 15:19:26,032 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 15:19:26,033 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 15:19:26,040 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-04-11 15:19:26,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-04-11 15:19:26,045 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:19:26,046 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:19:26,046 INFO L408 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:19:26,048 INFO L82 PathProgramCache]: Analyzing trace with hash 320774661, now seen corresponding path program 1 times [2018-04-11 15:19:26,049 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:19:26,049 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:19:26,077 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:26,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:19:26,077 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:26,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:26,115 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:19:26,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:19:26,154 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:19:26,154 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-11 15:19:26,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 15:19:26,163 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 15:19:26,163 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 15:19:26,165 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 3 states. [2018-04-11 15:19:26,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:19:26,237 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2018-04-11 15:19:26,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 15:19:26,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-04-11 15:19:26,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:19:26,247 INFO L225 Difference]: With dead ends: 55 [2018-04-11 15:19:26,247 INFO L226 Difference]: Without dead ends: 51 [2018-04-11 15:19:26,248 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 15:19:26,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-04-11 15:19:26,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-04-11 15:19:26,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-04-11 15:19:26,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-04-11 15:19:26,283 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 11 [2018-04-11 15:19:26,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:19:26,284 INFO L459 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-04-11 15:19:26,284 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 15:19:26,284 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-04-11 15:19:26,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-11 15:19:26,284 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:19:26,285 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:19:26,285 INFO L408 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:19:26,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1076881686, now seen corresponding path program 1 times [2018-04-11 15:19:26,285 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:19:26,285 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:19:26,286 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:26,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:19:26,286 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:26,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:26,296 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:19:26,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:19:26,340 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:19:26,340 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 15:19:26,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:19:26,341 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:19:26,341 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:19:26,342 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 5 states. [2018-04-11 15:19:26,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:19:26,403 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-04-11 15:19:26,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 15:19:26,404 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-04-11 15:19:26,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:19:26,404 INFO L225 Difference]: With dead ends: 54 [2018-04-11 15:19:26,404 INFO L226 Difference]: Without dead ends: 51 [2018-04-11 15:19:26,405 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-04-11 15:19:26,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-04-11 15:19:26,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-04-11 15:19:26,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-04-11 15:19:26,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-04-11 15:19:26,408 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 15 [2018-04-11 15:19:26,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:19:26,409 INFO L459 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-04-11 15:19:26,409 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:19:26,409 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-04-11 15:19:26,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-11 15:19:26,409 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:19:26,409 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:19:26,409 INFO L408 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:19:26,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1756940056, now seen corresponding path program 1 times [2018-04-11 15:19:26,410 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:19:26,410 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:19:26,410 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:26,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:19:26,410 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:26,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:26,424 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:19:26,432 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:19:26,432 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:19:26,432 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:19:26,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:19:26,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:26,464 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:19:26,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:19:26,489 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:26,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:26,490 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 15:19:26,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 15:19:26,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:26,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:19:26,513 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-11 15:19:26,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:19:26,518 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:19:26,518 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:19:26,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 15:19:26,519 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 15:19:26,519 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:19:26,519 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 4 states. [2018-04-11 15:19:26,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:19:26,551 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-04-11 15:19:26,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 15:19:26,552 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-04-11 15:19:26,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:19:26,552 INFO L225 Difference]: With dead ends: 50 [2018-04-11 15:19:26,552 INFO L226 Difference]: Without dead ends: 50 [2018-04-11 15:19:26,553 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:19:26,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-04-11 15:19:26,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-04-11 15:19:26,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-04-11 15:19:26,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-04-11 15:19:26,555 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 15 [2018-04-11 15:19:26,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:19:26,555 INFO L459 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-04-11 15:19:26,555 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 15:19:26,555 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-04-11 15:19:26,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-11 15:19:26,556 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:19:26,556 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:19:26,556 INFO L408 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:19:26,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1756940057, now seen corresponding path program 1 times [2018-04-11 15:19:26,556 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:19:26,556 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:19:26,557 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:26,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:19:26,557 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:26,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:26,568 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:19:26,573 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:19:26,573 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:19:26,573 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:19:26,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:19:26,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:26,595 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:19:26,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:19:26,635 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:26,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:19:26,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:26,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:26,656 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:25 [2018-04-11 15:19:26,698 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:26,699 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:26,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-11 15:19:26,700 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:26,723 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:26,724 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:26,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:19:26,725 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:26,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:19:26,742 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:24 [2018-04-11 15:19:26,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:19:26,764 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:19:26,764 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 15:19:26,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 15:19:26,764 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 15:19:26,764 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-11 15:19:26,765 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 8 states. [2018-04-11 15:19:26,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:19:26,913 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-04-11 15:19:26,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 15:19:26,914 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2018-04-11 15:19:26,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:19:26,914 INFO L225 Difference]: With dead ends: 49 [2018-04-11 15:19:26,915 INFO L226 Difference]: Without dead ends: 49 [2018-04-11 15:19:26,915 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-04-11 15:19:26,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-04-11 15:19:26,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-04-11 15:19:26,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-04-11 15:19:26,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-04-11 15:19:26,919 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 15 [2018-04-11 15:19:26,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:19:26,919 INFO L459 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-04-11 15:19:26,919 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 15:19:26,919 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-04-11 15:19:26,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-11 15:19:26,920 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:19:26,920 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:19:26,920 INFO L408 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:19:26,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1369433054, now seen corresponding path program 1 times [2018-04-11 15:19:26,920 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:19:26,920 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:19:26,921 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:26,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:19:26,921 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:26,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:26,931 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:19:26,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:19:26,950 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:19:26,951 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:19:26,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 15:19:26,951 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 15:19:26,951 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:19:26,951 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 4 states. [2018-04-11 15:19:26,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:19:26,976 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-04-11 15:19:26,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 15:19:26,977 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-04-11 15:19:26,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:19:26,977 INFO L225 Difference]: With dead ends: 48 [2018-04-11 15:19:26,977 INFO L226 Difference]: Without dead ends: 48 [2018-04-11 15:19:26,977 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:19:26,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-04-11 15:19:26,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-04-11 15:19:26,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-04-11 15:19:26,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-04-11 15:19:26,979 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 16 [2018-04-11 15:19:26,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:19:26,980 INFO L459 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2018-04-11 15:19:26,980 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 15:19:26,980 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-04-11 15:19:26,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-11 15:19:26,980 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:19:26,980 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:19:26,980 INFO L408 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:19:26,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1369433053, now seen corresponding path program 1 times [2018-04-11 15:19:26,980 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:19:26,980 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:19:26,981 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:26,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:19:26,981 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:26,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:26,991 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:19:27,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:19:27,035 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:19:27,035 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 15:19:27,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:19:27,035 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:19:27,035 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:19:27,035 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 5 states. [2018-04-11 15:19:27,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:19:27,068 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-04-11 15:19:27,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:19:27,068 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-04-11 15:19:27,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:19:27,068 INFO L225 Difference]: With dead ends: 47 [2018-04-11 15:19:27,069 INFO L226 Difference]: Without dead ends: 47 [2018-04-11 15:19:27,069 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:19:27,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-04-11 15:19:27,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-04-11 15:19:27,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-04-11 15:19:27,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-04-11 15:19:27,072 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 16 [2018-04-11 15:19:27,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:19:27,072 INFO L459 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-04-11 15:19:27,072 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:19:27,073 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-04-11 15:19:27,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-11 15:19:27,073 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:19:27,073 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:19:27,073 INFO L408 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:19:27,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1396804491, now seen corresponding path program 1 times [2018-04-11 15:19:27,073 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:19:27,074 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:19:27,074 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:27,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:19:27,074 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:27,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:27,085 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:19:27,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:19:27,132 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:19:27,132 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 15:19:27,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 15:19:27,132 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 15:19:27,133 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:19:27,133 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 6 states. [2018-04-11 15:19:27,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:19:27,192 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-04-11 15:19:27,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:19:27,193 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-04-11 15:19:27,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:19:27,195 INFO L225 Difference]: With dead ends: 47 [2018-04-11 15:19:27,195 INFO L226 Difference]: Without dead ends: 47 [2018-04-11 15:19:27,195 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-04-11 15:19:27,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-04-11 15:19:27,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2018-04-11 15:19:27,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-04-11 15:19:27,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-04-11 15:19:27,198 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 21 [2018-04-11 15:19:27,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:19:27,198 INFO L459 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-04-11 15:19:27,198 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 15:19:27,198 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-04-11 15:19:27,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-04-11 15:19:27,199 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:19:27,199 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:19:27,199 INFO L408 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:19:27,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1396804492, now seen corresponding path program 1 times [2018-04-11 15:19:27,199 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:19:27,199 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:19:27,200 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:27,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:19:27,200 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:27,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:27,210 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:19:27,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:19:27,319 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:19:27,319 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-11 15:19:27,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 15:19:27,320 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 15:19:27,320 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-04-11 15:19:27,320 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 10 states. [2018-04-11 15:19:27,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:19:27,455 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2018-04-11 15:19:27,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 15:19:27,456 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-04-11 15:19:27,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:19:27,456 INFO L225 Difference]: With dead ends: 57 [2018-04-11 15:19:27,456 INFO L226 Difference]: Without dead ends: 57 [2018-04-11 15:19:27,457 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2018-04-11 15:19:27,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-04-11 15:19:27,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 52. [2018-04-11 15:19:27,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-04-11 15:19:27,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2018-04-11 15:19:27,460 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 21 [2018-04-11 15:19:27,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:19:27,460 INFO L459 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2018-04-11 15:19:27,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 15:19:27,460 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2018-04-11 15:19:27,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-11 15:19:27,461 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:19:27,461 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:19:27,461 INFO L408 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:19:27,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1735549236, now seen corresponding path program 1 times [2018-04-11 15:19:27,462 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:19:27,462 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:19:27,462 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:27,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:19:27,463 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:27,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:27,476 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:19:27,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:19:27,512 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:19:27,513 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 15:19:27,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 15:19:27,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 15:19:27,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-11 15:19:27,513 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand 7 states. [2018-04-11 15:19:27,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:19:27,577 INFO L93 Difference]: Finished difference Result 54 states and 62 transitions. [2018-04-11 15:19:27,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 15:19:27,578 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-04-11 15:19:27,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:19:27,579 INFO L225 Difference]: With dead ends: 54 [2018-04-11 15:19:27,579 INFO L226 Difference]: Without dead ends: 54 [2018-04-11 15:19:27,579 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:19:27,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-04-11 15:19:27,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-04-11 15:19:27,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-04-11 15:19:27,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2018-04-11 15:19:27,583 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 24 [2018-04-11 15:19:27,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:19:27,583 INFO L459 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2018-04-11 15:19:27,583 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 15:19:27,584 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2018-04-11 15:19:27,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-11 15:19:27,584 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:19:27,584 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:19:27,584 INFO L408 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:19:27,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1735549235, now seen corresponding path program 1 times [2018-04-11 15:19:27,585 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:19:27,585 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:19:27,588 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:27,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:19:27,588 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:27,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:27,598 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:19:27,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:19:27,698 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:19:27,698 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-04-11 15:19:27,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 15:19:27,699 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 15:19:27,699 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-04-11 15:19:27,699 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand 10 states. [2018-04-11 15:19:27,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:19:27,830 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2018-04-11 15:19:27,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 15:19:27,831 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-04-11 15:19:27,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:19:27,831 INFO L225 Difference]: With dead ends: 56 [2018-04-11 15:19:27,831 INFO L226 Difference]: Without dead ends: 56 [2018-04-11 15:19:27,831 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:19:27,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-04-11 15:19:27,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2018-04-11 15:19:27,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-04-11 15:19:27,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2018-04-11 15:19:27,833 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 24 [2018-04-11 15:19:27,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:19:27,834 INFO L459 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2018-04-11 15:19:27,834 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 15:19:27,834 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2018-04-11 15:19:27,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-11 15:19:27,834 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:19:27,834 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:19:27,834 INFO L408 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:19:27,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1735547792, now seen corresponding path program 1 times [2018-04-11 15:19:27,835 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:19:27,835 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:19:27,835 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:27,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:19:27,835 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:27,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:27,846 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:19:27,854 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:19:27,854 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:19:27,854 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:19:27,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:19:27,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:27,886 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:19:27,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:19:27,898 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:27,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:19:27,902 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:27,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:27,906 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:19:27,920 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:27,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:19:27,921 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:27,927 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:27,928 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:27,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:19:27,929 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:27,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:27,933 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:19:27,976 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:19:27,977 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:19:27,977 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-04-11 15:19:27,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 15:19:27,977 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 15:19:27,977 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-04-11 15:19:27,977 INFO L87 Difference]: Start difference. First operand 53 states and 60 transitions. Second operand 12 states. [2018-04-11 15:19:28,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:19:28,164 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2018-04-11 15:19:28,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 15:19:28,164 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2018-04-11 15:19:28,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:19:28,165 INFO L225 Difference]: With dead ends: 72 [2018-04-11 15:19:28,165 INFO L226 Difference]: Without dead ends: 72 [2018-04-11 15:19:28,165 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2018-04-11 15:19:28,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-04-11 15:19:28,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 64. [2018-04-11 15:19:28,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-04-11 15:19:28,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2018-04-11 15:19:28,167 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 24 [2018-04-11 15:19:28,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:19:28,168 INFO L459 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2018-04-11 15:19:28,168 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 15:19:28,168 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2018-04-11 15:19:28,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-04-11 15:19:28,168 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:19:28,168 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:19:28,168 INFO L408 AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:19:28,168 INFO L82 PathProgramCache]: Analyzing trace with hash -888000244, now seen corresponding path program 2 times [2018-04-11 15:19:28,168 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:19:28,168 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:19:28,169 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:28,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:19:28,169 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:19:28,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:19:28,177 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:19:28,184 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:19:28,184 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:19:28,184 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:19:28,184 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:19:28,210 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:19:28,210 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:19:28,213 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:19:28,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:19:28,221 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:28,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:19:28,226 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:28,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:28,230 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:19:28,243 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:28,244 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:19:28,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:19:28,244 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:28,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:19:28,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:28,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:28,254 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-11 15:19:28,273 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 19 treesize of output 16 [2018-04-11 15:19:28,278 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 15:19:28,279 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:28,284 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:28,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:19:28,290 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-04-11 15:19:28,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-04-11 15:19:28,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:19:28,308 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:28,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:19:28,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 15:19:28,318 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:47 [2018-04-11 15:19:28,415 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2018-04-11 15:19:28,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-04-11 15:19:28,417 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:19:28,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, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 16 [2018-04-11 15:19:28,425 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 15:19:28,428 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:19:28,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:19:28,438 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:60, output treesize:35 [2018-04-11 15:19:28,501 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:19:28,502 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:19:28,502 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-11 15:19:28,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 15:19:28,502 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 15:19:28,502 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-04-11 15:19:28,503 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand 15 states. [2018-04-11 15:19:32,749 WARN L148 SmtUtils]: Spent 4024ms on a formula simplification that was a NOOP. DAG size: 51 [2018-04-11 15:19:38,800 WARN L148 SmtUtils]: Spent 6025ms on a formula simplification that was a NOOP. DAG size: 67 [2018-04-11 15:19:50,894 WARN L151 SmtUtils]: Spent 12068ms on a formula simplification. DAG size of input: 79 DAG size of output 76 [2018-04-11 15:19:56,685 WARN L148 SmtUtils]: Spent 4020ms on a formula simplification that was a NOOP. DAG size: 59 [2018-04-11 15:20:01,877 WARN L148 SmtUtils]: Spent 4016ms on a formula simplification that was a NOOP. DAG size: 59 [2018-04-11 15:20:03,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:20:03,798 INFO L93 Difference]: Finished difference Result 92 states and 107 transitions. [2018-04-11 15:20:03,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-11 15:20:03,799 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2018-04-11 15:20:03,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:20:03,799 INFO L225 Difference]: With dead ends: 92 [2018-04-11 15:20:03,799 INFO L226 Difference]: Without dead ends: 92 [2018-04-11 15:20:03,799 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 30.5s TimeCoverageRelationStatistics Valid=114, Invalid=536, Unknown=0, NotChecked=0, Total=650 [2018-04-11 15:20:03,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-04-11 15:20:03,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 67. [2018-04-11 15:20:03,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-04-11 15:20:03,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2018-04-11 15:20:03,802 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 27 [2018-04-11 15:20:03,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:20:03,802 INFO L459 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2018-04-11 15:20:03,802 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 15:20:03,802 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2018-04-11 15:20:03,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 15:20:03,803 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:20:03,803 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] [2018-04-11 15:20:03,803 INFO L408 AbstractCegarLoop]: === Iteration 13 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:20:03,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1029599467, now seen corresponding path program 1 times [2018-04-11 15:20:03,803 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:20:03,803 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:20:03,804 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:03,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:20:03,804 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:03,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:03,811 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:03,847 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:03,847 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:20:03,847 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 15:20:03,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:20:03,847 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:20:03,848 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:20:03,848 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand 5 states. [2018-04-11 15:20:03,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:20:03,877 INFO L93 Difference]: Finished difference Result 97 states and 112 transitions. [2018-04-11 15:20:03,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 15:20:03,877 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-04-11 15:20:03,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:20:03,879 INFO L225 Difference]: With dead ends: 97 [2018-04-11 15:20:03,879 INFO L226 Difference]: Without dead ends: 97 [2018-04-11 15:20:03,879 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:20:03,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-04-11 15:20:03,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 78. [2018-04-11 15:20:03,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-04-11 15:20:03,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 91 transitions. [2018-04-11 15:20:03,886 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 91 transitions. Word has length 28 [2018-04-11 15:20:03,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:20:03,886 INFO L459 AbstractCegarLoop]: Abstraction has 78 states and 91 transitions. [2018-04-11 15:20:03,887 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:20:03,887 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 91 transitions. [2018-04-11 15:20:03,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 15:20:03,887 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:20:03,887 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] [2018-04-11 15:20:03,888 INFO L408 AbstractCegarLoop]: === Iteration 14 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:20:03,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1847247917, now seen corresponding path program 1 times [2018-04-11 15:20:03,888 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:20:03,888 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:20:03,888 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:03,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:20:03,889 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:03,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:03,898 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:03,899 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:20:03,899 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:20:03,899 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:20:03,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:20:03,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:03,913 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:20:03,939 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:03,939 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:20:03,939 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 15:20:03,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 15:20:03,940 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 15:20:03,940 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-04-11 15:20:03,940 INFO L87 Difference]: Start difference. First operand 78 states and 91 transitions. Second operand 8 states. [2018-04-11 15:20:04,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:20:04,003 INFO L93 Difference]: Finished difference Result 90 states and 105 transitions. [2018-04-11 15:20:04,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 15:20:04,005 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-04-11 15:20:04,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:20:04,006 INFO L225 Difference]: With dead ends: 90 [2018-04-11 15:20:04,006 INFO L226 Difference]: Without dead ends: 87 [2018-04-11 15:20:04,006 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-04-11 15:20:04,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-04-11 15:20:04,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 67. [2018-04-11 15:20:04,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-04-11 15:20:04,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 78 transitions. [2018-04-11 15:20:04,009 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 78 transitions. Word has length 28 [2018-04-11 15:20:04,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:20:04,009 INFO L459 AbstractCegarLoop]: Abstraction has 67 states and 78 transitions. [2018-04-11 15:20:04,009 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 15:20:04,009 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2018-04-11 15:20:04,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 15:20:04,010 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:20:04,010 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:20:04,010 INFO L408 AbstractCegarLoop]: === Iteration 15 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:20:04,010 INFO L82 PathProgramCache]: Analyzing trace with hash 2126780026, now seen corresponding path program 1 times [2018-04-11 15:20:04,015 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:20:04,015 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:20:04,016 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:04,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:20:04,016 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:04,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:04,031 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:04,110 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:04,110 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:20:04,110 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 15:20:04,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 15:20:04,111 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 15:20:04,111 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:20:04,111 INFO L87 Difference]: Start difference. First operand 67 states and 78 transitions. Second operand 6 states. [2018-04-11 15:20:04,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:20:04,152 INFO L93 Difference]: Finished difference Result 126 states and 143 transitions. [2018-04-11 15:20:04,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:20:04,152 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-04-11 15:20:04,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:20:04,153 INFO L225 Difference]: With dead ends: 126 [2018-04-11 15:20:04,153 INFO L226 Difference]: Without dead ends: 126 [2018-04-11 15:20:04,153 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:04,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-04-11 15:20:04,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 110. [2018-04-11 15:20:04,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-04-11 15:20:04,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 131 transitions. [2018-04-11 15:20:04,156 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 131 transitions. Word has length 30 [2018-04-11 15:20:04,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:20:04,156 INFO L459 AbstractCegarLoop]: Abstraction has 110 states and 131 transitions. [2018-04-11 15:20:04,156 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 15:20:04,156 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 131 transitions. [2018-04-11 15:20:04,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 15:20:04,157 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:20:04,157 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 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:04,157 INFO L408 AbstractCegarLoop]: === Iteration 16 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:20:04,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1711730960, now seen corresponding path program 3 times [2018-04-11 15:20:04,158 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:20:04,158 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:20:04,158 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:04,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:20:04,159 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:04,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:04,170 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:04,182 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:20:04,182 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:20:04,183 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:20:04,183 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:20:04,215 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-11 15:20:04,215 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:20:04,219 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:20:04,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:20:04,231 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:04,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:04,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:04,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:04,246 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:20:04,265 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:04,266 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:04,267 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:04,267 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:04,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:20:04,279 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:04,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:04,284 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-11 15:20:04,305 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:04,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:20:04,308 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:04,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:04,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:04,319 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2018-04-11 15:20:04,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 30 [2018-04-11 15:20:04,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:20:04,341 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:04,367 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:04,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 15:20:04,373 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:39 [2018-04-11 15:20:04,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 15:20:04,507 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:04,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-04-11 15:20:04,522 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 10 treesize of output 1 [2018-04-11 15:20:04,523 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:04,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-11 15:20:04,534 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 15:20:04,539 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:20:04,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:20:04,548 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:48, output treesize:30 [2018-04-11 15:20:04,655 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:20:04,656 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:20:04,656 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 15:20:04,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 15:20:04,656 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 15:20:04,657 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-04-11 15:20:04,657 INFO L87 Difference]: Start difference. First operand 110 states and 131 transitions. Second operand 17 states. [2018-04-11 15:20:07,183 WARN L151 SmtUtils]: Spent 2050ms on a formula simplification. DAG size of input: 55 DAG size of output 47 [2018-04-11 15:20:07,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:20:07,842 INFO L93 Difference]: Finished difference Result 139 states and 159 transitions. [2018-04-11 15:20:07,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 15:20:07,843 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2018-04-11 15:20:07,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:20:07,844 INFO L225 Difference]: With dead ends: 139 [2018-04-11 15:20:07,844 INFO L226 Difference]: Without dead ends: 139 [2018-04-11 15:20:07,844 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=133, Invalid=737, Unknown=0, NotChecked=0, Total=870 [2018-04-11 15:20:07,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-04-11 15:20:07,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 113. [2018-04-11 15:20:07,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-04-11 15:20:07,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 135 transitions. [2018-04-11 15:20:07,848 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 135 transitions. Word has length 30 [2018-04-11 15:20:07,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:20:07,849 INFO L459 AbstractCegarLoop]: Abstraction has 113 states and 135 transitions. [2018-04-11 15:20:07,849 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 15:20:07,849 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 135 transitions. [2018-04-11 15:20:07,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 15:20:07,850 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:20:07,850 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:20:07,850 INFO L408 AbstractCegarLoop]: === Iteration 17 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:20:07,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1949332552, now seen corresponding path program 1 times [2018-04-11 15:20:07,850 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:20:07,850 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:20:07,851 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:07,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:20:07,851 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:07,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:07,865 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:08,004 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:08,005 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:20:08,005 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-11 15:20:08,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 15:20:08,006 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 15:20:08,006 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-04-11 15:20:08,006 INFO L87 Difference]: Start difference. First operand 113 states and 135 transitions. Second operand 11 states. [2018-04-11 15:20:08,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:20:08,212 INFO L93 Difference]: Finished difference Result 205 states and 239 transitions. [2018-04-11 15:20:08,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 15:20:08,214 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-04-11 15:20:08,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:20:08,215 INFO L225 Difference]: With dead ends: 205 [2018-04-11 15:20:08,215 INFO L226 Difference]: Without dead ends: 205 [2018-04-11 15:20:08,215 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2018-04-11 15:20:08,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-04-11 15:20:08,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 187. [2018-04-11 15:20:08,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-04-11 15:20:08,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 225 transitions. [2018-04-11 15:20:08,222 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 225 transitions. Word has length 30 [2018-04-11 15:20:08,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:20:08,222 INFO L459 AbstractCegarLoop]: Abstraction has 187 states and 225 transitions. [2018-04-11 15:20:08,222 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 15:20:08,222 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 225 transitions. [2018-04-11 15:20:08,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 15:20:08,223 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:20:08,223 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 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:08,223 INFO L408 AbstractCegarLoop]: === Iteration 18 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:20:08,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1492876242, now seen corresponding path program 1 times [2018-04-11 15:20:08,223 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:20:08,224 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:20:08,224 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:08,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:20:08,224 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:08,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:08,235 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:08,264 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:20:08,264 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:20:08,264 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:20:08,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:20:08,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:08,293 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:20:08,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:08,303 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:08,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:08,308 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-04-11 15:20:08,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:20:08,343 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:20:08,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:20:08,361 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:39 [2018-04-11 15:20:08,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 39 [2018-04-11 15:20:08,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-04-11 15:20:08,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:08,462 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:08,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 40 [2018-04-11 15:20:08,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 15:20:08,514 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:08,522 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:08,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 15:20:08,542 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:86, output treesize:78 [2018-04-11 15:20:08,579 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:08,581 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 62 treesize of output 63 [2018-04-11 15:20:08,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:08,583 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:08,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:08,617 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 58 treesize of output 53 [2018-04-11 15:20:08,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-04-11 15:20:08,621 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:08,631 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:08,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-04-11 15:20:08,650 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:121, output treesize:113 [2018-04-11 15:20:10,682 WARN L148 SmtUtils]: Spent 2020ms on a formula simplification that was a NOOP. DAG size: 59 [2018-04-11 15:20:11,211 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:11,212 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:11,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2018-04-11 15:20:11,222 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 20 [2018-04-11 15:20:11,223 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:11,236 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:11,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 41 [2018-04-11 15:20:11,242 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 15:20:11,250 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:20:11,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 15:20:11,270 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:90, output treesize:69 [2018-04-11 15:20:11,430 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:20:11,430 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:20:11,430 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-11 15:20:11,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 15:20:11,431 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 15:20:11,431 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2018-04-11 15:20:11,431 INFO L87 Difference]: Start difference. First operand 187 states and 225 transitions. Second operand 19 states. [2018-04-11 15:20:19,941 WARN L151 SmtUtils]: Spent 6182ms on a formula simplification. DAG size of input: 82 DAG size of output 78 [2018-04-11 15:20:20,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:20:20,540 INFO L93 Difference]: Finished difference Result 229 states and 267 transitions. [2018-04-11 15:20:20,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-11 15:20:20,540 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 30 [2018-04-11 15:20:20,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:20:20,542 INFO L225 Difference]: With dead ends: 229 [2018-04-11 15:20:20,542 INFO L226 Difference]: Without dead ends: 229 [2018-04-11 15:20:20,543 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=102, Invalid=653, Unknown=1, NotChecked=0, Total=756 [2018-04-11 15:20:20,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-04-11 15:20:20,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 152. [2018-04-11 15:20:20,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-04-11 15:20:20,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 183 transitions. [2018-04-11 15:20:20,551 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 183 transitions. Word has length 30 [2018-04-11 15:20:20,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:20:20,551 INFO L459 AbstractCegarLoop]: Abstraction has 152 states and 183 transitions. [2018-04-11 15:20:20,551 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 15:20:20,551 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 183 transitions. [2018-04-11 15:20:20,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 15:20:20,552 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:20:20,552 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:20:20,552 INFO L408 AbstractCegarLoop]: === Iteration 19 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:20:20,552 INFO L82 PathProgramCache]: Analyzing trace with hash 540196410, now seen corresponding path program 1 times [2018-04-11 15:20:20,552 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:20:20,552 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:20:20,553 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:20,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:20:20,553 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:20,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:20,565 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,719 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:20,719 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:20:20,719 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:20:20,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:20:20,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:20,734 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:20:20,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:20:20,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:20,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:20,739 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 15:20:20,794 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:20,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:20,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:20,798 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:20,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:20,804 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-04-11 15:20:20,926 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:20,931 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:20,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:20:20,935 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:20:20,942 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:20,943 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:54 [2018-04-11 15:20:21,018 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:21,018 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:20:21,018 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 22 [2018-04-11 15:20:21,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 15:20:21,019 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 15:20:21,019 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=453, Unknown=0, NotChecked=0, Total=506 [2018-04-11 15:20:21,019 INFO L87 Difference]: Start difference. First operand 152 states and 183 transitions. Second operand 23 states. [2018-04-11 15:20:21,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:20:21,557 INFO L93 Difference]: Finished difference Result 175 states and 210 transitions. [2018-04-11 15:20:21,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 15:20:21,558 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 30 [2018-04-11 15:20:21,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:20:21,559 INFO L225 Difference]: With dead ends: 175 [2018-04-11 15:20:21,559 INFO L226 Difference]: Without dead ends: 175 [2018-04-11 15:20:21,559 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=112, Invalid=818, Unknown=0, NotChecked=0, Total=930 [2018-04-11 15:20:21,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-04-11 15:20:21,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 160. [2018-04-11 15:20:21,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-04-11 15:20:21,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 194 transitions. [2018-04-11 15:20:21,565 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 194 transitions. Word has length 30 [2018-04-11 15:20:21,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:20:21,565 INFO L459 AbstractCegarLoop]: Abstraction has 160 states and 194 transitions. [2018-04-11 15:20:21,565 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 15:20:21,565 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 194 transitions. [2018-04-11 15:20:21,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-04-11 15:20:21,566 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:20:21,566 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 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,566 INFO L408 AbstractCegarLoop]: === Iteration 20 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:20:21,566 INFO L82 PathProgramCache]: Analyzing trace with hash 996652720, now seen corresponding path program 1 times [2018-04-11 15:20:21,566 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:20:21,566 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:20:21,567 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:21,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:20:21,567 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:21,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:21,585 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,619 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:20:21,619 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:20:21,619 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:20:21,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:20:21,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:21,655 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:20:21,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:20:21,670 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:21,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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,679 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:21,684 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,684 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:20:21,711 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:21,719 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,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:21,740 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:21,741 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:21,741 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,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:21,754 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,754 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-11 15:20:21,796 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 19 treesize of output 16 [2018-04-11 15:20:21,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 15:20:21,798 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:21,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:21,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:20:21,823 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-04-11 15:20:21,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-04-11 15:20:21,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:21,853 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:21,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:21,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 15:20:21,870 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:47 [2018-04-11 15:20:22,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2018-04-11 15:20:22,038 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:22,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 41 [2018-04-11 15:20:22,045 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:20:22,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2018-04-11 15:20:22,059 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:22,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:20:22,080 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:20:22,080 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:72, output treesize:49 [2018-04-11 15:20:22,200 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:20:22,200 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:20:22,200 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-11 15:20:22,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 15:20:22,200 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 15:20:22,200 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2018-04-11 15:20:22,201 INFO L87 Difference]: Start difference. First operand 160 states and 194 transitions. Second operand 18 states. [2018-04-11 15:20:22,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:20:22,854 INFO L93 Difference]: Finished difference Result 220 states and 259 transitions. [2018-04-11 15:20:22,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 15:20:22,854 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 30 [2018-04-11 15:20:22,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:20:22,855 INFO L225 Difference]: With dead ends: 220 [2018-04-11 15:20:22,855 INFO L226 Difference]: Without dead ends: 220 [2018-04-11 15:20:22,855 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=119, Invalid=693, Unknown=0, NotChecked=0, Total=812 [2018-04-11 15:20:22,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-04-11 15:20:22,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 163. [2018-04-11 15:20:22,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-04-11 15:20:22,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 198 transitions. [2018-04-11 15:20:22,858 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 198 transitions. Word has length 30 [2018-04-11 15:20:22,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:20:22,859 INFO L459 AbstractCegarLoop]: Abstraction has 163 states and 198 transitions. [2018-04-11 15:20:22,859 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 15:20:22,859 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 198 transitions. [2018-04-11 15:20:22,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 15:20:22,859 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:20:22,859 INFO L355 BasicCegarLoop]: trace histogram [5, 4, 4, 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:22,859 INFO L408 AbstractCegarLoop]: === Iteration 21 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:20:22,859 INFO L82 PathProgramCache]: Analyzing trace with hash -30361972, now seen corresponding path program 4 times [2018-04-11 15:20:22,859 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:20:22,859 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:20:22,860 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:22,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:20:22,860 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:22,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:22,869 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,878 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:20:22,878 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:20:22,879 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:20:22,879 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:20:22,904 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:20:22,904 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:20:22,908 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:20:22,918 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:20:22,918 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:22,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:22,931 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,931 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:20:22,951 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:22,952 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:22,953 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:22,970 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:22,971 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:22,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, 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,972 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:22,979 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,979 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-11 15:20:23,009 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:23,011 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 15:20:23,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:23,014 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:23,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:23,020 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-04-11 15:20:23,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 29 [2018-04-11 15:20:23,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:20:23,046 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:23,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:23,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 15:20:23,055 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2018-04-11 15:20:23,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-04-11 15:20:23,163 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 10 treesize of output 1 [2018-04-11 15:20:23,163 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:23,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-11 15:20:23,170 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 15:20:23,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:20:23,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:20:23,178 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:38, output treesize:20 [2018-04-11 15:20:23,241 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:20:23,241 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:20:23,241 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-11 15:20:23,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 15:20:23,242 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 15:20:23,242 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2018-04-11 15:20:23,242 INFO L87 Difference]: Start difference. First operand 163 states and 198 transitions. Second operand 19 states. [2018-04-11 15:20:23,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:20:23,982 INFO L93 Difference]: Finished difference Result 231 states and 268 transitions. [2018-04-11 15:20:23,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 15:20:23,982 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 33 [2018-04-11 15:20:23,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:20:23,983 INFO L225 Difference]: With dead ends: 231 [2018-04-11 15:20:23,983 INFO L226 Difference]: Without dead ends: 231 [2018-04-11 15:20:23,983 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=217, Invalid=1115, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 15:20:23,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-04-11 15:20:23,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 170. [2018-04-11 15:20:23,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-04-11 15:20:23,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 201 transitions. [2018-04-11 15:20:23,987 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 201 transitions. Word has length 33 [2018-04-11 15:20:23,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:20:23,988 INFO L459 AbstractCegarLoop]: Abstraction has 170 states and 201 transitions. [2018-04-11 15:20:23,988 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 15:20:23,988 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 201 transitions. [2018-04-11 15:20:23,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 15:20:23,988 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:20:23,988 INFO L355 BasicCegarLoop]: trace histogram [5, 4, 4, 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:23,989 INFO L408 AbstractCegarLoop]: === Iteration 22 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:20:23,989 INFO L82 PathProgramCache]: Analyzing trace with hash 110186638, now seen corresponding path program 2 times [2018-04-11 15:20:23,989 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:20:23,989 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:20:23,989 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:23,990 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:20:23,990 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:24,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:24,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:24,029 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:20:24,029 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:20:24,029 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:20:24,030 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:20:24,059 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:20:24,059 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:20:24,062 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:20:24,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:24,069 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:24,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:24,074 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:24,078 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,079 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:20:24,094 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:24,103 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:24,104 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,104 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:24,118 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,118 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:24,125 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,125 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-11 15:20:24,153 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 19 treesize of output 16 [2018-04-11 15:20:24,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 15:20:24,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:24,157 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:24,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:24,167 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2018-04-11 15:20:24,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-04-11 15:20:24,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:24,194 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:24,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:24,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 15:20:24,218 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:47 [2018-04-11 15:20:24,495 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 49 [2018-04-11 15:20:24,497 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 10 treesize of output 1 [2018-04-11 15:20:24,498 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:24,506 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:24,508 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:24,508 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:24,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 73 [2018-04-11 15:20:24,516 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 15:20:24,533 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:20:24,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-11 15:20:24,557 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:88, output treesize:178 [2018-04-11 15:20:24,705 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:20:24,705 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:20:24,705 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-11 15:20:24,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 15:20:24,705 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 15:20:24,706 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-04-11 15:20:24,706 INFO L87 Difference]: Start difference. First operand 170 states and 201 transitions. Second operand 19 states. [2018-04-11 15:20:25,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:20:25,428 INFO L93 Difference]: Finished difference Result 274 states and 319 transitions. [2018-04-11 15:20:25,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 15:20:25,428 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 33 [2018-04-11 15:20:25,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:20:25,429 INFO L225 Difference]: With dead ends: 274 [2018-04-11 15:20:25,429 INFO L226 Difference]: Without dead ends: 274 [2018-04-11 15:20:25,430 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=118, Invalid=694, Unknown=0, NotChecked=0, Total=812 [2018-04-11 15:20:25,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-04-11 15:20:25,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 184. [2018-04-11 15:20:25,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-04-11 15:20:25,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 217 transitions. [2018-04-11 15:20:25,435 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 217 transitions. Word has length 33 [2018-04-11 15:20:25,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:20:25,435 INFO L459 AbstractCegarLoop]: Abstraction has 184 states and 217 transitions. [2018-04-11 15:20:25,435 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 15:20:25,435 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 217 transitions. [2018-04-11 15:20:25,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-11 15:20:25,436 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:20:25,436 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:20:25,436 INFO L408 AbstractCegarLoop]: === Iteration 23 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:20:25,436 INFO L82 PathProgramCache]: Analyzing trace with hash -919032110, now seen corresponding path program 1 times [2018-04-11 15:20:25,436 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:20:25,436 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:20:25,437 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:25,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:20:25,437 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:25,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:25,446 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,461 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:20:25,461 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:20:25,461 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:20:25,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:20:25,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:25,487 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:20:25,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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,503 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:25,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:20:25,512 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:25,520 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:25,520 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:22 [2018-04-11 15:20:25,545 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:25,546 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:25,547 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,547 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:25,556 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:25,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-04-11 15:20:25,557 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:25,578 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:20:25,578 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:21 [2018-04-11 15:20:25,800 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:20:25,801 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:20:25,801 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-11 15:20:25,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 15:20:25,801 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 15:20:25,802 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2018-04-11 15:20:25,802 INFO L87 Difference]: Start difference. First operand 184 states and 217 transitions. Second operand 16 states. [2018-04-11 15:20:26,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:20:26,360 INFO L93 Difference]: Finished difference Result 272 states and 316 transitions. [2018-04-11 15:20:26,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 15:20:26,360 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 35 [2018-04-11 15:20:26,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:20:26,361 INFO L225 Difference]: With dead ends: 272 [2018-04-11 15:20:26,361 INFO L226 Difference]: Without dead ends: 272 [2018-04-11 15:20:26,362 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2018-04-11 15:20:26,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-04-11 15:20:26,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 198. [2018-04-11 15:20:26,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-04-11 15:20:26,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 236 transitions. [2018-04-11 15:20:26,367 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 236 transitions. Word has length 35 [2018-04-11 15:20:26,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:20:26,367 INFO L459 AbstractCegarLoop]: Abstraction has 198 states and 236 transitions. [2018-04-11 15:20:26,367 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 15:20:26,367 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 236 transitions. [2018-04-11 15:20:26,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-11 15:20:26,368 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:20:26,368 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:20:26,368 INFO L408 AbstractCegarLoop]: === Iteration 24 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:20:26,368 INFO L82 PathProgramCache]: Analyzing trace with hash -644412504, now seen corresponding path program 1 times [2018-04-11 15:20:26,368 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:20:26,368 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:20:26,368 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:26,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:20:26,368 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:26,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:26,376 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,378 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:20:26,378 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:20:26,378 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:20:26,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:20:26,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:26,394 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:20:26,424 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:26,425 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:26,428 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:26,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:26,432 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:26,437 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:26,437 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-11 15:20:26,476 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:26,477 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:20:26,477 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 15:20:26,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 15:20:26,477 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 15:20:26,477 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-04-11 15:20:26,477 INFO L87 Difference]: Start difference. First operand 198 states and 236 transitions. Second operand 8 states. [2018-04-11 15:20:26,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:20:26,600 INFO L93 Difference]: Finished difference Result 197 states and 235 transitions. [2018-04-11 15:20:26,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 15:20:26,600 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2018-04-11 15:20:26,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:20:26,601 INFO L225 Difference]: With dead ends: 197 [2018-04-11 15:20:26,601 INFO L226 Difference]: Without dead ends: 118 [2018-04-11 15:20:26,602 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-04-11 15:20:26,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-04-11 15:20:26,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2018-04-11 15:20:26,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-04-11 15:20:26,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 132 transitions. [2018-04-11 15:20:26,604 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 132 transitions. Word has length 36 [2018-04-11 15:20:26,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:20:26,604 INFO L459 AbstractCegarLoop]: Abstraction has 117 states and 132 transitions. [2018-04-11 15:20:26,604 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 15:20:26,605 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 132 transitions. [2018-04-11 15:20:26,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-11 15:20:26,605 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:20:26,605 INFO L355 BasicCegarLoop]: trace histogram [6, 5, 5, 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,605 INFO L408 AbstractCegarLoop]: === Iteration 25 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:20:26,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1215080494, now seen corresponding path program 3 times [2018-04-11 15:20:26,605 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:20:26,606 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:20:26,606 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:26,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:20:26,606 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:26,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:26,619 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,670 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:20:26,670 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:20:26,670 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:20:26,671 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:20:26,704 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-04-11 15:20:26,704 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:20:26,708 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:20:26,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:26,747 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:26,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:20:26,756 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:26,762 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,763 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:20 [2018-04-11 15:20:26,781 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:26,782 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,782 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:26,792 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:26,792 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:26,793 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,793 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:26,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:20:26,800 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:27 [2018-04-11 15:20:26,826 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 19 treesize of output 16 [2018-04-11 15:20:26,827 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 15:20:26,827 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:26,829 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:26,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:20:26,838 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:42 [2018-04-11 15:20:26,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 44 [2018-04-11 15:20:26,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2018-04-11 15:20:26,900 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:26,924 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:26,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 15:20:26,938 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:62, output treesize:58 [2018-04-11 15:20:27,385 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:27,385 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:27,443 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:27,445 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:27,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 57 [2018-04-11 15:20:27,455 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 20 [2018-04-11 15:20:27,456 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:27,476 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:27,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 117 [2018-04-11 15:20:27,518 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-11 15:20:27,531 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 36 xjuncts. [2018-04-11 15:20:27,642 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 15:20:27,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 14 dim-0 vars, and 2 xjuncts. [2018-04-11 15:20:27,693 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:120, output treesize:824 [2018-04-11 15:20:27,982 WARN L151 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 267 DAG size of output 99 [2018-04-11 15:20:28,141 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:20:28,141 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:20:28,141 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 15:20:28,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 15:20:28,142 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 15:20:28,142 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-04-11 15:20:28,142 INFO L87 Difference]: Start difference. First operand 117 states and 132 transitions. Second operand 23 states. [2018-04-11 15:20:29,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:20:29,150 INFO L93 Difference]: Finished difference Result 125 states and 140 transitions. [2018-04-11 15:20:29,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 15:20:29,150 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 36 [2018-04-11 15:20:29,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:20:29,150 INFO L225 Difference]: With dead ends: 125 [2018-04-11 15:20:29,150 INFO L226 Difference]: Without dead ends: 120 [2018-04-11 15:20:29,151 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=185, Invalid=1147, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 15:20:29,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-04-11 15:20:29,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-04-11 15:20:29,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-04-11 15:20:29,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 135 transitions. [2018-04-11 15:20:29,152 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 135 transitions. Word has length 36 [2018-04-11 15:20:29,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:20:29,152 INFO L459 AbstractCegarLoop]: Abstraction has 120 states and 135 transitions. [2018-04-11 15:20:29,152 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 15:20:29,153 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 135 transitions. [2018-04-11 15:20:29,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-11 15:20:29,153 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:20:29,153 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:20:29,153 INFO L408 AbstractCegarLoop]: === Iteration 26 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:20:29,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1574776871, now seen corresponding path program 2 times [2018-04-11 15:20:29,153 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:20:29,153 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:20:29,154 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:29,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:20:29,154 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:29,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:29,162 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,169 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:20:29,169 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:20:29,169 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:20:29,170 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:20:29,188 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:20:29,188 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:20:29,190 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:20:29,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:20:29,196 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:29,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:29,199 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 15:20:29,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:29,210 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:29,220 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:29,221 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:29,221 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,222 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:29,226 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,227 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2018-04-11 15:20:29,248 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:29,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:29,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:29,251 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:29,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:29,258 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:25 [2018-04-11 15:20:29,360 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:29,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:20:29,372 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:29,378 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:29,387 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:29,387 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:23 [2018-04-11 15:20:29,435 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:29,444 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:29,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:20:29,448 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:20:29,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:20:29,459 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:38 [2018-04-11 15:20:29,538 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:29,539 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:20:29,539 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-11 15:20:29,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 15:20:29,539 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 15:20:29,539 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2018-04-11 15:20:29,540 INFO L87 Difference]: Start difference. First operand 120 states and 135 transitions. Second operand 18 states. [2018-04-11 15:20:29,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:20:29,978 INFO L93 Difference]: Finished difference Result 137 states and 151 transitions. [2018-04-11 15:20:29,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 15:20:29,979 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 36 [2018-04-11 15:20:29,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:20:29,979 INFO L225 Difference]: With dead ends: 137 [2018-04-11 15:20:29,979 INFO L226 Difference]: Without dead ends: 137 [2018-04-11 15:20:29,980 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=650, Unknown=0, NotChecked=0, Total=756 [2018-04-11 15:20:29,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-04-11 15:20:29,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 128. [2018-04-11 15:20:29,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-04-11 15:20:29,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 145 transitions. [2018-04-11 15:20:29,981 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 145 transitions. Word has length 36 [2018-04-11 15:20:29,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:20:29,982 INFO L459 AbstractCegarLoop]: Abstraction has 128 states and 145 transitions. [2018-04-11 15:20:29,982 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 15:20:29,982 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 145 transitions. [2018-04-11 15:20:29,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-11 15:20:29,982 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:20:29,982 INFO L355 BasicCegarLoop]: trace histogram [6, 5, 5, 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:29,982 INFO L408 AbstractCegarLoop]: === Iteration 27 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:20:29,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1693683408, now seen corresponding path program 2 times [2018-04-11 15:20:29,982 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:20:29,982 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:20:29,983 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:29,983 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:20:29,983 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:29,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:29,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:29,996 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:20:29,996 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:20:29,996 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:20:29,997 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:20:30,017 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:20:30,017 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:20:30,020 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:20:30,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:30,034 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:30,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:20:30,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:30,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:30,054 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:20:30,073 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:30,074 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:30,074 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:30,087 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:30,087 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:30,088 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:30,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:30,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:30,093 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-11 15:20:30,118 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 19 treesize of output 16 [2018-04-11 15:20:30,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 15:20:30,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:30,127 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:30,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:30,134 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2018-04-11 15:20:30,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-04-11 15:20:30,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:30,170 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:30,175 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:30,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 15:20:30,185 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:47 [2018-04-11 15:20:30,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 53 [2018-04-11 15:20:30,569 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 10 treesize of output 1 [2018-04-11 15:20:30,570 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:30,590 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:30,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 117 [2018-04-11 15:20:30,623 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-04-11 15:20:30,632 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 36 xjuncts. [2018-04-11 15:20:30,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:20:30,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 15:20:30,798 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:104, output treesize:230 [2018-04-11 15:20:31,021 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:20:31,021 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:20:31,021 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-11 15:20:31,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 15:20:31,021 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 15:20:31,022 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2018-04-11 15:20:31,022 INFO L87 Difference]: Start difference. First operand 128 states and 145 transitions. Second operand 22 states. [2018-04-11 15:20:31,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:20:31,895 INFO L93 Difference]: Finished difference Result 155 states and 175 transitions. [2018-04-11 15:20:31,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 15:20:31,895 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 36 [2018-04-11 15:20:31,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:20:31,896 INFO L225 Difference]: With dead ends: 155 [2018-04-11 15:20:31,896 INFO L226 Difference]: Without dead ends: 154 [2018-04-11 15:20:31,896 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=162, Invalid=1028, Unknown=0, NotChecked=0, Total=1190 [2018-04-11 15:20:31,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-04-11 15:20:31,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 131. [2018-04-11 15:20:31,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-04-11 15:20:31,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 149 transitions. [2018-04-11 15:20:31,899 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 149 transitions. Word has length 36 [2018-04-11 15:20:31,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:20:31,899 INFO L459 AbstractCegarLoop]: Abstraction has 131 states and 149 transitions. [2018-04-11 15:20:31,899 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 15:20:31,899 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 149 transitions. [2018-04-11 15:20:31,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 15:20:31,899 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:20:31,899 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:20:31,899 INFO L408 AbstractCegarLoop]: === Iteration 28 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:20:31,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1238114358, now seen corresponding path program 1 times [2018-04-11 15:20:31,900 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:20:31,900 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:20:31,900 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:31,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:20:31,900 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:31,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:31,907 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:20:31,914 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:20:31,914 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:20:31,914 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:20:31,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:20:31,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:31,929 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:20:31,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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,937 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:31,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:20:31,952 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:31,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:31,960 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-04-11 15:20:31,996 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:31,996 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:31,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:20:31,997 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:32,008 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:32,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 23 [2018-04-11 15:20:32,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:32,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:32,019 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:19 [2018-04-11 15:20:32,310 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:20:32,310 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:20:32,310 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-11 15:20:32,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 15:20:32,311 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 15:20:32,311 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=334, Unknown=0, NotChecked=0, Total=380 [2018-04-11 15:20:32,311 INFO L87 Difference]: Start difference. First operand 131 states and 149 transitions. Second operand 20 states. [2018-04-11 15:20:32,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:20:32,951 INFO L93 Difference]: Finished difference Result 151 states and 168 transitions. [2018-04-11 15:20:32,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 15:20:32,951 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2018-04-11 15:20:32,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:20:32,952 INFO L225 Difference]: With dead ends: 151 [2018-04-11 15:20:32,952 INFO L226 Difference]: Without dead ends: 150 [2018-04-11 15:20:32,952 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=161, Invalid=1099, Unknown=0, NotChecked=0, Total=1260 [2018-04-11 15:20:32,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-04-11 15:20:32,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 131. [2018-04-11 15:20:32,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-04-11 15:20:32,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 149 transitions. [2018-04-11 15:20:32,955 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 149 transitions. Word has length 38 [2018-04-11 15:20:32,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:20:32,956 INFO L459 AbstractCegarLoop]: Abstraction has 131 states and 149 transitions. [2018-04-11 15:20:32,956 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 15:20:32,956 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 149 transitions. [2018-04-11 15:20:32,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-11 15:20:32,956 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:20:32,956 INFO L355 BasicCegarLoop]: trace histogram [7, 6, 6, 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,957 INFO L408 AbstractCegarLoop]: === Iteration 29 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:20:32,957 INFO L82 PathProgramCache]: Analyzing trace with hash 478588046, now seen corresponding path program 4 times [2018-04-11 15:20:32,957 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:20:32,957 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:20:32,957 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:32,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:20:32,958 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:32,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:32,967 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,998 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:20:32,999 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:20:32,999 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:20:32,999 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:20:33,027 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:20:33,027 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:20:33,031 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:20:33,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:33,038 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:33,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:33,052 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:33,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:33,066 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:20:33,086 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:33,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:33,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:33,098 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:33,099 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:33,100 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:33,100 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:33,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:33,108 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-11 15:20:33,130 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 19 treesize of output 16 [2018-04-11 15:20:33,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 15:20:33,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:33,132 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:33,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:20:33,148 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2018-04-11 15:20:33,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-04-11 15:20:33,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:33,164 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:33,167 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:33,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-04-11 15:20:33,174 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:47 [2018-04-11 15:20:33,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 59 [2018-04-11 15:20:33,547 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 10 treesize of output 1 [2018-04-11 15:20:33,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:33,558 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:33,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 45 treesize of output 167 [2018-04-11 15:20:33,607 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2018-04-11 15:20:33,865 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 544 xjuncts. [2018-04-11 15:20:37,635 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:20:37,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:20:37,676 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:114, output treesize:193 [2018-04-11 15:20:37,798 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:20:37,798 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:20:37,799 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 15:20:37,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 15:20:37,799 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 15:20:37,799 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2018-04-11 15:20:37,799 INFO L87 Difference]: Start difference. First operand 131 states and 149 transitions. Second operand 23 states. [2018-04-11 15:20:38,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:20:38,791 INFO L93 Difference]: Finished difference Result 155 states and 177 transitions. [2018-04-11 15:20:38,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 15:20:38,792 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 39 [2018-04-11 15:20:38,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:20:38,793 INFO L225 Difference]: With dead ends: 155 [2018-04-11 15:20:38,793 INFO L226 Difference]: Without dead ends: 150 [2018-04-11 15:20:38,793 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=173, Invalid=1233, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 15:20:38,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-04-11 15:20:38,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 137. [2018-04-11 15:20:38,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-04-11 15:20:38,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 156 transitions. [2018-04-11 15:20:38,796 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 156 transitions. Word has length 39 [2018-04-11 15:20:38,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:20:38,796 INFO L459 AbstractCegarLoop]: Abstraction has 137 states and 156 transitions. [2018-04-11 15:20:38,796 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 15:20:38,796 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 156 transitions. [2018-04-11 15:20:38,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-11 15:20:38,796 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:20:38,796 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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:38,796 INFO L408 AbstractCegarLoop]: === Iteration 30 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:20:38,797 INFO L82 PathProgramCache]: Analyzing trace with hash -304518907, now seen corresponding path program 2 times [2018-04-11 15:20:38,797 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:20:38,797 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:20:38,797 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:38,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:20:38,797 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:38,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:38,808 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,811 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:20:38,811 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:20:38,811 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:20:38,812 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:20:38,838 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:20:38,838 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:20:38,841 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:20:38,855 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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,855 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:38,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:20:38,864 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:38,871 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,871 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2018-04-11 15:20:38,895 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:38,895 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:38,896 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,896 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:38,907 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,907 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:38,915 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:20:38,915 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:25 [2018-04-11 15:20:39,225 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:39,225 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:20:39,225 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-11 15:20:39,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 15:20:39,226 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 15:20:39,226 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2018-04-11 15:20:39,226 INFO L87 Difference]: Start difference. First operand 137 states and 156 transitions. Second operand 19 states. [2018-04-11 15:20:39,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:20:39,953 INFO L93 Difference]: Finished difference Result 159 states and 176 transitions. [2018-04-11 15:20:39,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-11 15:20:39,953 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 41 [2018-04-11 15:20:39,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:20:39,954 INFO L225 Difference]: With dead ends: 159 [2018-04-11 15:20:39,954 INFO L226 Difference]: Without dead ends: 158 [2018-04-11 15:20:39,954 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=121, Invalid=871, Unknown=0, NotChecked=0, Total=992 [2018-04-11 15:20:39,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-04-11 15:20:39,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 155. [2018-04-11 15:20:39,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-04-11 15:20:39,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 174 transitions. [2018-04-11 15:20:39,957 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 174 transitions. Word has length 41 [2018-04-11 15:20:39,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:20:39,957 INFO L459 AbstractCegarLoop]: Abstraction has 155 states and 174 transitions. [2018-04-11 15:20:39,957 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 15:20:39,957 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 174 transitions. [2018-04-11 15:20:39,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-11 15:20:39,958 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:20:39,958 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:20:39,958 INFO L408 AbstractCegarLoop]: === Iteration 31 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:20:39,958 INFO L82 PathProgramCache]: Analyzing trace with hash -807107502, now seen corresponding path program 2 times [2018-04-11 15:20:39,958 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:20:39,958 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:20:39,959 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:39,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:20:39,959 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:39,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:39,969 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,992 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:20:39,992 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:20:39,992 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:20:39,993 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:20:40,024 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:20:40,024 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:20:40,028 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:20:40,042 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:40,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:40,056 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,057 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2018-04-11 15:20:40,079 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:40,080 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:40,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 21 [2018-04-11 15:20:40,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:40,095 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:40,095 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:40,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:20:40,096 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:40,104 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,104 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:22 [2018-04-11 15:20:40,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2018-04-11 15:20:40,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 15:20:40,132 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:40,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:40,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:40,142 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2018-04-11 15:20:40,166 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:40,169 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-04-11 15:20:40,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 13 treesize of output 12 [2018-04-11 15:20:40,172 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:40,177 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:40,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:20:40,185 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:43 [2018-04-11 15:20:40,334 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:40,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2018-04-11 15:20:40,336 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 10 treesize of output 1 [2018-04-11 15:20:40,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:40,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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:40,351 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 15:20:40,354 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:20:40,366 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:40,366 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:58, output treesize:65 [2018-04-11 15:20:40,855 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:20:40,855 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:20:40,855 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-11 15:20:40,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-11 15:20:40,855 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-11 15:20:40,856 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=635, Unknown=0, NotChecked=0, Total=702 [2018-04-11 15:20:40,856 INFO L87 Difference]: Start difference. First operand 155 states and 174 transitions. Second operand 27 states. [2018-04-11 15:20:41,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:20:41,764 INFO L93 Difference]: Finished difference Result 168 states and 187 transitions. [2018-04-11 15:20:41,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-11 15:20:41,764 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 41 [2018-04-11 15:20:41,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:20:41,765 INFO L225 Difference]: With dead ends: 168 [2018-04-11 15:20:41,765 INFO L226 Difference]: Without dead ends: 167 [2018-04-11 15:20:41,765 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=163, Invalid=1397, Unknown=0, NotChecked=0, Total=1560 [2018-04-11 15:20:41,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-04-11 15:20:41,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-04-11 15:20:41,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-04-11 15:20:41,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 186 transitions. [2018-04-11 15:20:41,767 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 186 transitions. Word has length 41 [2018-04-11 15:20:41,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:20:41,767 INFO L459 AbstractCegarLoop]: Abstraction has 167 states and 186 transitions. [2018-04-11 15:20:41,767 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-11 15:20:41,767 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 186 transitions. [2018-04-11 15:20:41,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-11 15:20:41,768 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:20:41,768 INFO L355 BasicCegarLoop]: trace histogram [8, 7, 7, 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:41,768 INFO L408 AbstractCegarLoop]: === Iteration 32 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:20:41,768 INFO L82 PathProgramCache]: Analyzing trace with hash -1674982354, now seen corresponding path program 5 times [2018-04-11 15:20:41,768 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:20:41,768 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:20:41,768 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:41,768 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:20:41,769 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:41,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:41,782 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:41,891 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:20:41,891 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:20:41,891 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:20:41,892 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:20:41,927 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-04-11 15:20:41,927 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:20:41,930 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:20:41,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:41,954 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:41,958 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:41,958 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-04-11 15:20:41,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:20:41,977 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:20:41,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:20:41,986 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:39 [2018-04-11 15:20:42,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 40 [2018-04-11 15:20:42,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 15:20:42,036 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:42,045 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:42,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 39 [2018-04-11 15:20:42,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 14 treesize of output 13 [2018-04-11 15:20:42,074 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:42,081 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:42,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 15:20:42,097 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:86, output treesize:78 [2018-04-11 15:20:42,120 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:42,122 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 52 treesize of output 53 [2018-04-11 15:20:42,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:42,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:42,131 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:42,150 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 48 treesize of output 43 [2018-04-11 15:20:42,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-04-11 15:20:42,152 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:42,158 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:42,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-04-11 15:20:42,175 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:101, output treesize:93 [2018-04-11 15:20:42,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 75 [2018-04-11 15:20:42,523 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:42,525 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 76 treesize of output 71 [2018-04-11 15:20:42,525 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:42,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-04-11 15:20:42,551 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:157, output treesize:147 [2018-04-11 15:20:43,033 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-11 15:20:43,033 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:43,051 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:43,052 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 73 [2018-04-11 15:20:43,054 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:43,055 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:43,055 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:43,056 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:43,056 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:43,057 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:43,057 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:43,057 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:43,058 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:43,058 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:43,059 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:43,060 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:43,060 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:43,061 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:43,061 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:43,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 25 disjoint index pairs (out of 21 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 217 [2018-04-11 15:20:43,074 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 15:20:43,136 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 10 treesize of output 1 [2018-04-11 15:20:43,136 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:43,161 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:20:43,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-04-11 15:20:43,189 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:221, output treesize:144 [2018-04-11 15:20:43,366 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:20:43,366 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:20:43,366 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-11 15:20:43,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-11 15:20:43,366 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-11 15:20:43,366 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=591, Unknown=0, NotChecked=0, Total=650 [2018-04-11 15:20:43,366 INFO L87 Difference]: Start difference. First operand 167 states and 186 transitions. Second operand 26 states. [2018-04-11 15:20:44,212 WARN L151 SmtUtils]: Spent 147ms on a formula simplification. DAG size of input: 113 DAG size of output 113 [2018-04-11 15:20:44,393 WARN L151 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 65 DAG size of output 65 [2018-04-11 15:20:44,622 WARN L151 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 71 DAG size of output 71 [2018-04-11 15:20:44,963 WARN L151 SmtUtils]: Spent 116ms on a formula simplification. DAG size of input: 81 DAG size of output 81 [2018-04-11 15:20:45,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:20:45,236 INFO L93 Difference]: Finished difference Result 175 states and 194 transitions. [2018-04-11 15:20:45,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 15:20:45,236 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 42 [2018-04-11 15:20:45,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:20:45,237 INFO L225 Difference]: With dead ends: 175 [2018-04-11 15:20:45,237 INFO L226 Difference]: Without dead ends: 170 [2018-04-11 15:20:45,237 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=127, Invalid=1279, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 15:20:45,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-04-11 15:20:45,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2018-04-11 15:20:45,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-04-11 15:20:45,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 189 transitions. [2018-04-11 15:20:45,239 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 189 transitions. Word has length 42 [2018-04-11 15:20:45,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:20:45,239 INFO L459 AbstractCegarLoop]: Abstraction has 170 states and 189 transitions. [2018-04-11 15:20:45,240 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-11 15:20:45,240 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 189 transitions. [2018-04-11 15:20:45,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-11 15:20:45,240 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:20:45,240 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:20:45,240 INFO L408 AbstractCegarLoop]: === Iteration 33 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:20:45,240 INFO L82 PathProgramCache]: Analyzing trace with hash -850150316, now seen corresponding path program 3 times [2018-04-11 15:20:45,241 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:20:45,241 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:20:45,241 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:45,241 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:20:45,241 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:45,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:45,254 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:45,256 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:20:45,256 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:20:45,256 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:20:45,257 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:20:45,291 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-11 15:20:45,291 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:20:45,293 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:20:45,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:45,295 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:45,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:45,296 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 15:20:45,300 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:45,301 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:45,306 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:45,306 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:45,307 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:45,307 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:45,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:45,310 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-11 15:20:45,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 15:20:45,325 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:45,325 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:45,326 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:45,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:45,330 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-04-11 15:20:45,395 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:45,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 8 treesize of output 7 [2018-04-11 15:20:45,396 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:45,412 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:45,417 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:45,417 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2018-04-11 15:20:45,434 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:45,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:20:45,436 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:45,439 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:45,444 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:45,444 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-04-11 15:20:45,473 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-11 15:20:45,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-11 15:20:45,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:20:45,480 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:20:45,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:20:45,485 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:30 [2018-04-11 15:20:45,536 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:20:45,536 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:20:45,536 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 15:20:45,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 15:20:45,537 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 15:20:45,537 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2018-04-11 15:20:45,537 INFO L87 Difference]: Start difference. First operand 170 states and 189 transitions. Second operand 17 states. [2018-04-11 15:20:45,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:20:45,859 INFO L93 Difference]: Finished difference Result 188 states and 205 transitions. [2018-04-11 15:20:45,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 15:20:45,859 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 42 [2018-04-11 15:20:45,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:20:45,859 INFO L225 Difference]: With dead ends: 188 [2018-04-11 15:20:45,860 INFO L226 Difference]: Without dead ends: 188 [2018-04-11 15:20:45,860 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2018-04-11 15:20:45,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-04-11 15:20:45,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 176. [2018-04-11 15:20:45,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-04-11 15:20:45,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 198 transitions. [2018-04-11 15:20:45,862 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 198 transitions. Word has length 42 [2018-04-11 15:20:45,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:20:45,862 INFO L459 AbstractCegarLoop]: Abstraction has 176 states and 198 transitions. [2018-04-11 15:20:45,862 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 15:20:45,862 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 198 transitions. [2018-04-11 15:20:45,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-11 15:20:45,862 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:20:45,863 INFO L355 BasicCegarLoop]: trace histogram [8, 7, 7, 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:45,863 INFO L408 AbstractCegarLoop]: === Iteration 34 === [__U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr7RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr6RequiresViolation, __U_MULTI_fopenbsd_cstrncat_alloca_true_valid_memsafety_true_termination_i__cstrncatErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:20:45,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1775979440, now seen corresponding path program 3 times [2018-04-11 15:20:45,863 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:20:45,863 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:20:45,863 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:45,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:20:45,864 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:20:45,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:20:45,874 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:45,878 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:20:45,878 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:20:45,878 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:20:45,879 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:20:45,906 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-04-11 15:20:45,906 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:20:45,909 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:20:45,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:45,925 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:45,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:20:45,931 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:45,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:45,935 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:20:45,948 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:45,948 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:20:45,949 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:45,949 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:45,955 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:45,956 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:45,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:45,961 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2018-04-11 15:20:45,980 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 19 treesize of output 16 [2018-04-11 15:20:45,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-04-11 15:20:45,981 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:45,982 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:45,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:45,989 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2018-04-11 15:20:46,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2018-04-11 15:20:46,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:20:46,005 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:46,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:20:46,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 15:20:46,015 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:47 [2018-04-11 15:20:46,376 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 62 [2018-04-11 15:20:46,378 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 10 treesize of output 1 [2018-04-11 15:20:46,378 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:20:46,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 48 treesize of output 203 [2018-04-11 15:20:46,464 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 15 [2018-04-11 15:20:46,627 WARN L152 XnfTransformerHelper]: Simplifying disjunction of 32768 conjuctions. This might take some time... Received shutdown request... [2018-04-11 15:22:48,409 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-11 15:22:48,409 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-11 15:22:48,412 WARN L197 ceAbstractionStarter]: Timeout [2018-04-11 15:22:48,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 03:22:48 BoogieIcfgContainer [2018-04-11 15:22:48,412 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 15:22:48,412 INFO L168 Benchmark]: Toolchain (without parser) took 203113.20 ms. Allocated memory was 399.0 MB in the beginning and 613.9 MB in the end (delta: 215.0 MB). Free memory was 330.8 MB in the beginning and 348.4 MB in the end (delta: -17.6 MB). Peak memory consumption was 843.7 MB. Max. memory is 5.3 GB. [2018-04-11 15:22:48,413 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 399.0 MB. Free memory is still 357.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 15:22:48,413 INFO L168 Benchmark]: CACSL2BoogieTranslator took 237.26 ms. Allocated memory is still 399.0 MB. Free memory was 329.0 MB in the beginning and 305.0 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 5.3 GB. [2018-04-11 15:22:48,413 INFO L168 Benchmark]: Boogie Preprocessor took 39.12 ms. Allocated memory is still 399.0 MB. Free memory was 305.0 MB in the beginning and 302.4 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:22:48,413 INFO L168 Benchmark]: RCFGBuilder took 414.07 ms. Allocated memory was 399.0 MB in the beginning and 613.9 MB in the end (delta: 215.0 MB). Free memory was 302.4 MB in the beginning and 546.5 MB in the end (delta: -244.2 MB). Peak memory consumption was 23.6 MB. Max. memory is 5.3 GB. [2018-04-11 15:22:48,413 INFO L168 Benchmark]: TraceAbstraction took 202420.39 ms. Allocated memory is still 613.9 MB. Free memory was 546.5 MB in the beginning and 348.4 MB in the end (delta: 198.1 MB). Peak memory consumption was 844.4 MB. Max. memory is 5.3 GB. [2018-04-11 15:22:48,414 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.10 ms. Allocated memory is still 399.0 MB. Free memory is still 357.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 237.26 ms. Allocated memory is still 399.0 MB. Free memory was 329.0 MB in the beginning and 305.0 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.12 ms. Allocated memory is still 399.0 MB. Free memory was 305.0 MB in the beginning and 302.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 414.07 ms. Allocated memory was 399.0 MB in the beginning and 613.9 MB in the end (delta: 215.0 MB). Free memory was 302.4 MB in the beginning and 546.5 MB in the end (delta: -244.2 MB). Peak memory consumption was 23.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 202420.39 ms. Allocated memory is still 613.9 MB. Free memory was 546.5 MB in the beginning and 348.4 MB in the end (delta: 198.1 MB). Peak memory consumption was 844.4 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 analyzing trace of length 43 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 32768 conjuctions. . - TimeoutResultAtElement [Line: 546]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 43 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 32768 conjuctions. . - TimeoutResultAtElement [Line: 553]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was analyzing trace of length 43 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 32768 conjuctions. . - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 43 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 32768 conjuctions. . - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 43 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 32768 conjuctions. . - TimeoutResultAtElement [Line: 546]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 546). Cancelled while BasicCegarLoop was analyzing trace of length 43 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 32768 conjuctions. . - TimeoutResultAtElement [Line: 553]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 553). Cancelled while BasicCegarLoop was analyzing trace of length 43 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 32768 conjuctions. . - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 549). Cancelled while BasicCegarLoop was analyzing trace of length 43 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 32768 conjuctions. . - TimeoutResultAtElement [Line: 574]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 574). Cancelled while BasicCegarLoop was analyzing trace of length 43 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 32768 conjuctions. . - TimeoutResultAtElement [Line: 573]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was analyzing trace of length 43 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 32768 conjuctions. . - TimeoutResultAtElement [Line: 574]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 574). Cancelled while BasicCegarLoop was analyzing trace of length 43 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 32768 conjuctions. . - TimeoutResultAtElement [Line: 557]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 557). Cancelled while BasicCegarLoop was analyzing trace of length 43 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 32768 conjuctions. . - TimeoutResultAtElement [Line: 573]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 573). Cancelled while BasicCegarLoop was analyzing trace of length 43 with TraceHistMax 8, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was XNF transformer was simplifying 32768 conjuctions. . - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 60 locations, 13 error locations. TIMEOUT Result, 202.3s OverallTime, 34 OverallIterations, 8 TraceHistogramMax, 60.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1266 SDtfs, 2058 SDslu, 7816 SDs, 0 SdLazy, 9328 SolverSat, 467 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 10.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1024 GetRequests, 384 SyntacticMatches, 4 SemanticMatches, 636 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3311 ImplicationChecksByTransitivity, 58.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=198occurred in iteration=23, 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, 33 MinimizatonAttempts, 600 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 18.5s InterpolantComputationTime, 1670 NumberOfCodeBlocks, 1670 NumberOfCodeBlocksAsserted, 81 NumberOfCheckSat, 949 ConstructedInterpolants, 250 QuantifiedInterpolants, 722900 SizeOfPredicates, 281 NumberOfNonLiveVariables, 3481 ConjunctsInSsa, 1026 ConjunctsInUnsatCore, 34 InterpolantComputations, 15 PerfectInterpolantSequences, 11/410 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_cstrncat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_15-22-48-421.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrncat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_15-22-48-421.csv Completed graceful shutdown