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_Camel.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 10:00:07,248 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 10:00:07,250 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 10:00:07,264 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 10:00:07,264 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 10:00:07,265 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 10:00:07,266 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 10:00:07,268 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 10:00:07,269 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 10:00:07,270 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 10:00:07,271 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 10:00:07,271 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 10:00:07,272 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 10:00:07,273 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 10:00:07,273 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 10:00:07,275 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 10:00:07,277 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 10:00:07,278 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 10:00:07,279 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 10:00:07,280 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 10:00:07,282 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 10:00:07,282 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 10:00:07,282 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 10:00:07,283 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 10:00:07,284 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 10:00:07,285 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 10:00:07,285 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 10:00:07,286 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 10:00:07,286 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 10:00:07,286 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 10:00:07,287 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 10:00:07,287 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-04-11 10:00:07,307 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 10:00:07,308 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 10:00:07,309 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 10:00:07,309 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 10:00:07,309 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 10:00:07,309 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 10:00:07,309 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 10:00:07,310 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 10:00:07,310 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 10:00:07,310 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 10:00:07,310 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 10:00:07,310 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 10:00:07,310 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 10:00:07,310 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 10:00:07,311 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 10:00:07,311 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 10:00:07,311 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 10:00:07,311 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 10:00:07,311 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 10:00:07,311 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 10:00:07,311 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 10:00:07,312 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 10:00:07,312 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 10:00:07,312 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-11 10:00:07,340 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 10:00:07,350 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 10:00:07,355 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 10:00:07,356 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 10:00:07,357 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 10:00:07,357 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,727 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG9038faf18 [2018-04-11 10:00:07,919 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 10:00:07,919 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 10:00:07,919 INFO L168 CDTParser]: Scanning openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,926 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 10:00:07,926 INFO L215 ultiparseSymbolTable]: [2018-04-11 10:00:07,926 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 10:00:07,926 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcat ('cstrcat') in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,926 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____bswap_64 ('__bswap_64') in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,927 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,927 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____bswap_32 ('__bswap_32') in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,927 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 10:00:07,927 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_rwlockattr_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,927 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____int16_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,927 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____u_long in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,927 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__daddr_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,927 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__u_char in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,927 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__ulong in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,927 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____pthread_list_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,927 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_barrierattr_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,927 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____off_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,927 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__blkcnt_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,927 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__u_long in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,927 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__clock_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,927 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____ino_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,928 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____syscall_slong_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,928 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____caddr_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,928 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__fd_mask in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,928 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_key_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,928 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____blkcnt_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,928 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_cond_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,928 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____fsid_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,928 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____ino64_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,928 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____sigset_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,928 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__blksize_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,928 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_spinlock_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,928 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__sigset_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,928 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__fsblkcnt_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,928 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____uint32_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,928 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__div_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,929 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__uint in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,929 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____int32_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,929 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____suseconds_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,929 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__u_int8_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,929 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__u_int16_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,929 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__quad_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,929 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____fd_mask in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,929 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__int16_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,929 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____rlim_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,929 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__clockid_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,929 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____clockid_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,929 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__key_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,930 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____sig_atomic_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,930 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__wchar_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,930 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__uid_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,930 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__lldiv_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,930 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_attr_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,930 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____pid_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,930 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_mutexattr_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,930 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____timer_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,930 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_barrier_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,930 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____fsblkcnt64_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,930 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____u_char in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,930 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____u_quad_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,930 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____off64_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__u_int32_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____quad_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____syscall_ulong_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____id_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____gid_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__u_int in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__gid_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__ldiv_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__off_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,931 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__u_short in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,932 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____blkcnt64_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,932 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__u_int64_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,932 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__timer_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,932 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____ssize_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,932 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____int8_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,932 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__pid_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,932 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__fsfilcnt_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,932 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__ino_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,932 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____nlink_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,932 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____fsfilcnt64_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,932 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____socklen_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,933 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__int32_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,933 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__register_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,933 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____uint64_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,933 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____fsword_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,933 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_once_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,933 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____intptr_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,933 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____uid_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,933 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__ssize_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,933 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__size_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,933 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__nlink_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,933 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__caddr_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,933 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__id_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,934 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____mode_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,934 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____u_int in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,934 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_condattr_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,934 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__dev_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,934 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__loff_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,934 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____clock_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,934 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__time_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,934 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_rwlock_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,934 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____uint8_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,934 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____key_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,934 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__fsid_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,934 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____dev_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,934 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____int64_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,934 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____fsblkcnt_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,934 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____u_short in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,934 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__pthread_mutex_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,934 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__fd_set in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,935 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____useconds_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,935 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__mode_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,935 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__suseconds_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,935 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____WAIT_STATUS in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,935 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__u_quad_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,935 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__ushort in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,935 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____time_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,935 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____loff_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,935 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__int8_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,935 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__int64_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,935 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____fsfilcnt_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,935 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____uint16_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,935 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____rlim64_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,936 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____daddr_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,936 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____blksize_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,936 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____qaddr_t in openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:07,954 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAG9038faf18 [2018-04-11 10:00:07,958 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 10:00:07,959 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 10:00:07,960 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 10:00:07,960 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 10:00:07,964 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 10:00:07,964 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 10:00:07" (1/1) ... [2018-04-11 10:00:07,966 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38a1fa6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:00:07, skipping insertion in model container [2018-04-11 10:00:07,966 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 10:00:07" (1/1) ... [2018-04-11 10:00:07,977 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 10:00:08,000 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 10:00:08,122 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 10:00:08,158 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 10:00:08,163 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-11 10:00:08,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:00:08 WrapperNode [2018-04-11 10:00:08,201 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 10:00:08,201 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 10:00:08,201 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 10:00:08,202 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 10:00:08,209 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:00:08" (1/1) ... [2018-04-11 10:00:08,209 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:00:08" (1/1) ... [2018-04-11 10:00:08,220 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:00:08" (1/1) ... [2018-04-11 10:00:08,220 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:00:08" (1/1) ... [2018-04-11 10:00:08,226 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:00:08" (1/1) ... [2018-04-11 10:00:08,231 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:00:08" (1/1) ... [2018-04-11 10:00:08,233 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:00:08" (1/1) ... [2018-04-11 10:00:08,236 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 10:00:08,237 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 10:00:08,237 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 10:00:08,237 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 10:00:08,238 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:00:08" (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 10:00:08,319 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 10:00:08,319 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 10:00:08,319 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-11 10:00:08,320 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-11 10:00:08,320 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcat [2018-04-11 10:00:08,320 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 10:00:08,320 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-11 10:00:08,320 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-11 10:00:08,320 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 10:00:08,320 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 10:00:08,320 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 10:00:08,320 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 10:00:08,320 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 10:00:08,320 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 10:00:08,321 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 10:00:08,321 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 10:00:08,321 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 10:00:08,321 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 10:00:08,321 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 10:00:08,321 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 10:00:08,321 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 10:00:08,321 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 10:00:08,321 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 10:00:08,322 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 10:00:08,322 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 10:00:08,322 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 10:00:08,322 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 10:00:08,322 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 10:00:08,322 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 10:00:08,322 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 10:00:08,322 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 10:00:08,322 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 10:00:08,323 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 10:00:08,323 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 10:00:08,323 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 10:00:08,323 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 10:00:08,323 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 10:00:08,323 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 10:00:08,323 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 10:00:08,323 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 10:00:08,323 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 10:00:08,324 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 10:00:08,324 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 10:00:08,324 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 10:00:08,324 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 10:00:08,324 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 10:00:08,324 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 10:00:08,324 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 10:00:08,324 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 10:00:08,324 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 10:00:08,325 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 10:00:08,325 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 10:00:08,325 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 10:00:08,325 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 10:00:08,325 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 10:00:08,325 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 10:00:08,325 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 10:00:08,325 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 10:00:08,325 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 10:00:08,325 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 10:00:08,326 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 10:00:08,326 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 10:00:08,326 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 10:00:08,326 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 10:00:08,326 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 10:00:08,326 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 10:00:08,326 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 10:00:08,326 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 10:00:08,326 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 10:00:08,326 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 10:00:08,327 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 10:00:08,327 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 10:00:08,327 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 10:00:08,327 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 10:00:08,327 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 10:00:08,327 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 10:00:08,327 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 10:00:08,327 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 10:00:08,327 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 10:00:08,327 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 10:00:08,327 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 10:00:08,328 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 10:00:08,328 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 10:00:08,328 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 10:00:08,328 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 10:00:08,328 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 10:00:08,328 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 10:00:08,328 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 10:00:08,328 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 10:00:08,328 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 10:00:08,328 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 10:00:08,329 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 10:00:08,329 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 10:00:08,329 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 10:00:08,329 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 10:00:08,329 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 10:00:08,329 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 10:00:08,329 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 10:00:08,329 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 10:00:08,329 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 10:00:08,329 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 10:00:08,330 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 10:00:08,330 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 10:00:08,330 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 10:00:08,330 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 10:00:08,330 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 10:00:08,330 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 10:00:08,330 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 10:00:08,330 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 10:00:08,330 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcat [2018-04-11 10:00:08,330 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 10:00:08,331 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 10:00:08,331 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 10:00:08,331 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 10:00:08,331 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 10:00:08,331 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 10:00:08,331 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 10:00:08,331 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 10:00:08,610 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 10:00:08,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 10:00:08 BoogieIcfgContainer [2018-04-11 10:00:08,611 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 10:00:08,611 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 10:00:08,611 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 10:00:08,613 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 10:00:08,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 10:00:07" (1/3) ... [2018-04-11 10:00:08,614 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2915bfcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 10:00:08, skipping insertion in model container [2018-04-11 10:00:08,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 10:00:08" (2/3) ... [2018-04-11 10:00:08,614 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2915bfcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 10:00:08, skipping insertion in model container [2018-04-11 10:00:08,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 10:00:08" (3/3) ... [2018-04-11 10:00:08,615 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-04-11 10:00:08,620 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 10:00:08,625 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-04-11 10:00:08,649 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 10:00:08,649 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 10:00:08,649 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 10:00:08,649 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 10:00:08,649 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 10:00:08,649 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 10:00:08,650 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 10:00:08,650 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 10:00:08,650 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 10:00:08,650 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 10:00:08,658 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2018-04-11 10:00:08,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-04-11 10:00:08,665 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:00:08,666 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:00:08,666 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 10:00:08,669 INFO L82 PathProgramCache]: Analyzing trace with hash 428257112, now seen corresponding path program 1 times [2018-04-11 10:00:08,670 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:00:08,670 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:00:08,698 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:00:08,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:00:08,698 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:00:08,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:00:08,732 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:00:08,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:00:08,799 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:00:08,800 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 10:00:08,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 10:00:08,808 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 10:00:08,808 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 10:00:08,810 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 5 states. [2018-04-11 10:00:08,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:00:08,929 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2018-04-11 10:00:08,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 10:00:08,930 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-04-11 10:00:08,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:00:08,938 INFO L225 Difference]: With dead ends: 92 [2018-04-11 10:00:08,939 INFO L226 Difference]: Without dead ends: 87 [2018-04-11 10:00:08,940 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 10:00:08,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-04-11 10:00:08,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 50. [2018-04-11 10:00:08,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-04-11 10:00:08,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-04-11 10:00:08,967 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 11 [2018-04-11 10:00:08,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:00:08,967 INFO L459 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-04-11 10:00:08,967 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 10:00:08,968 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-04-11 10:00:08,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-04-11 10:00:08,968 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:00:08,968 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:00:08,968 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 10:00:08,968 INFO L82 PathProgramCache]: Analyzing trace with hash 428259034, now seen corresponding path program 1 times [2018-04-11 10:00:08,968 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:00:08,968 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:00:08,969 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:00:08,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:00:08,969 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:00:08,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:00:08,977 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:00:08,989 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 10:00:08,989 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:00:08,989 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-11 10:00:08,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 10:00:08,990 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 10:00:08,990 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 10:00:08,991 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 3 states. [2018-04-11 10:00:09,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:00:09,009 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2018-04-11 10:00:09,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 10:00:09,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-04-11 10:00:09,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:00:09,009 INFO L225 Difference]: With dead ends: 51 [2018-04-11 10:00:09,010 INFO L226 Difference]: Without dead ends: 50 [2018-04-11 10:00:09,010 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 10:00:09,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-04-11 10:00:09,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2018-04-11 10:00:09,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-04-11 10:00:09,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2018-04-11 10:00:09,013 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 11 [2018-04-11 10:00:09,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:00:09,013 INFO L459 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2018-04-11 10:00:09,013 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 10:00:09,013 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-04-11 10:00:09,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-11 10:00:09,013 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:00:09,013 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:00:09,013 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 10:00:09,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1908357399, now seen corresponding path program 1 times [2018-04-11 10:00:09,014 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:00:09,014 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:00:09,014 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:00:09,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:00:09,014 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:00:09,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:00:09,031 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:00:09,074 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 10:00:09,074 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:00:09,074 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 10:00:09,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 10:00:09,075 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 10:00:09,075 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 10:00:09,075 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand 4 states. [2018-04-11 10:00:09,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:00:09,108 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2018-04-11 10:00:09,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 10:00:09,109 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-04-11 10:00:09,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:00:09,109 INFO L225 Difference]: With dead ends: 46 [2018-04-11 10:00:09,109 INFO L226 Difference]: Without dead ends: 46 [2018-04-11 10:00:09,110 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 10:00:09,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-04-11 10:00:09,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-04-11 10:00:09,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-04-11 10:00:09,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-04-11 10:00:09,114 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 15 [2018-04-11 10:00:09,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:00:09,115 INFO L459 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-04-11 10:00:09,115 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 10:00:09,115 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-04-11 10:00:09,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-04-11 10:00:09,115 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:00:09,115 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:00:09,115 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 10:00:09,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1908357398, now seen corresponding path program 1 times [2018-04-11 10:00:09,116 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:00:09,116 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:00:09,116 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:00:09,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:00:09,117 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:00:09,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:00:09,126 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:00:09,195 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 10:00:09,197 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:00:09,197 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 10:00:09,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 10:00:09,198 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 10:00:09,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-04-11 10:00:09,198 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 6 states. [2018-04-11 10:00:09,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:00:09,249 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-04-11 10:00:09,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 10:00:09,251 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-04-11 10:00:09,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:00:09,251 INFO L225 Difference]: With dead ends: 45 [2018-04-11 10:00:09,251 INFO L226 Difference]: Without dead ends: 45 [2018-04-11 10:00:09,252 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-04-11 10:00:09,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-04-11 10:00:09,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-04-11 10:00:09,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-04-11 10:00:09,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-04-11 10:00:09,255 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 15 [2018-04-11 10:00:09,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:00:09,255 INFO L459 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-04-11 10:00:09,255 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 10:00:09,255 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-04-11 10:00:09,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-11 10:00:09,256 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:00:09,256 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:00:09,256 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 10:00:09,256 INFO L82 PathProgramCache]: Analyzing trace with hash 970462777, now seen corresponding path program 1 times [2018-04-11 10:00:09,257 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:00:09,257 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:00:09,257 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:00:09,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:00:09,257 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:00:09,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:00:09,270 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:00:09,309 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 10:00:09,309 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:00:09,309 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 10:00:09,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 10:00:09,313 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 10:00:09,313 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 10:00:09,314 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 4 states. [2018-04-11 10:00:09,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:00:09,373 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2018-04-11 10:00:09,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 10:00:09,373 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-04-11 10:00:09,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:00:09,374 INFO L225 Difference]: With dead ends: 44 [2018-04-11 10:00:09,374 INFO L226 Difference]: Without dead ends: 44 [2018-04-11 10:00:09,374 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 10:00:09,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-04-11 10:00:09,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-04-11 10:00:09,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-04-11 10:00:09,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-04-11 10:00:09,377 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 16 [2018-04-11 10:00:09,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:00:09,378 INFO L459 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-04-11 10:00:09,378 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 10:00:09,378 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-04-11 10:00:09,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-11 10:00:09,378 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:00:09,378 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:00:09,378 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 10:00:09,378 INFO L82 PathProgramCache]: Analyzing trace with hash 970462778, now seen corresponding path program 1 times [2018-04-11 10:00:09,378 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:00:09,379 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:00:09,379 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:00:09,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:00:09,379 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:00:09,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:00:09,388 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:00:09,426 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 10:00:09,427 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:00:09,427 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 10:00:09,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 10:00:09,427 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 10:00:09,427 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-11 10:00:09,427 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 6 states. [2018-04-11 10:00:09,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:00:09,489 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-04-11 10:00:09,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 10:00:09,489 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-04-11 10:00:09,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:00:09,490 INFO L225 Difference]: With dead ends: 59 [2018-04-11 10:00:09,490 INFO L226 Difference]: Without dead ends: 59 [2018-04-11 10:00:09,490 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-04-11 10:00:09,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-04-11 10:00:09,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 51. [2018-04-11 10:00:09,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-04-11 10:00:09,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-04-11 10:00:09,493 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 16 [2018-04-11 10:00:09,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:00:09,494 INFO L459 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-04-11 10:00:09,494 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 10:00:09,494 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-04-11 10:00:09,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-04-11 10:00:09,495 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:00:09,495 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:00:09,495 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 10:00:09,495 INFO L82 PathProgramCache]: Analyzing trace with hash 161116152, now seen corresponding path program 1 times [2018-04-11 10:00:09,495 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:00:09,495 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:00:09,496 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:00:09,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:00:09,496 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:00:09,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:00:09,505 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:00:09,543 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 10:00:09,543 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:00:09,543 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 10:00:09,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 10:00:09,543 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 10:00:09,543 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-04-11 10:00:09,544 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 6 states. [2018-04-11 10:00:09,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:00:09,611 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2018-04-11 10:00:09,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 10:00:09,612 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-04-11 10:00:09,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:00:09,612 INFO L225 Difference]: With dead ends: 50 [2018-04-11 10:00:09,612 INFO L226 Difference]: Without dead ends: 50 [2018-04-11 10:00:09,613 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-04-11 10:00:09,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-04-11 10:00:09,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2018-04-11 10:00:09,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-04-11 10:00:09,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-04-11 10:00:09,615 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 16 [2018-04-11 10:00:09,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:00:09,615 INFO L459 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-04-11 10:00:09,615 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 10:00:09,615 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-04-11 10:00:09,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-11 10:00:09,616 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:00:09,616 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:00:09,616 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 10:00:09,616 INFO L82 PathProgramCache]: Analyzing trace with hash -954509684, now seen corresponding path program 1 times [2018-04-11 10:00:09,616 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:00:09,617 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:00:09,617 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:00:09,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:00:09,617 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:00:09,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:00:09,627 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:00:09,662 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 10:00:09,662 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:00:09,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 10:00:09,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 10:00:09,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 10:00:09,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 10:00:09,663 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 5 states. [2018-04-11 10:00:09,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:00:09,705 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2018-04-11 10:00:09,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 10:00:09,705 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-04-11 10:00:09,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:00:09,706 INFO L225 Difference]: With dead ends: 42 [2018-04-11 10:00:09,706 INFO L226 Difference]: Without dead ends: 42 [2018-04-11 10:00:09,706 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-11 10:00:09,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-04-11 10:00:09,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-04-11 10:00:09,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-04-11 10:00:09,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-04-11 10:00:09,708 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 20 [2018-04-11 10:00:09,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:00:09,708 INFO L459 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-04-11 10:00:09,708 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 10:00:09,708 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-04-11 10:00:09,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-11 10:00:09,708 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:00:09,708 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:00:09,708 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 10:00:09,708 INFO L82 PathProgramCache]: Analyzing trace with hash -954509683, now seen corresponding path program 1 times [2018-04-11 10:00:09,708 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:00:09,709 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:00:09,709 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:00:09,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:00:09,709 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:00:09,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:00:09,717 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:00:09,775 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 10:00:09,775 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:00:09,775 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 10:00:09,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 10:00:09,776 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 10:00:09,776 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-11 10:00:09,776 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 7 states. [2018-04-11 10:00:09,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:00:09,869 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-04-11 10:00:09,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 10:00:09,869 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-04-11 10:00:09,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:00:09,869 INFO L225 Difference]: With dead ends: 48 [2018-04-11 10:00:09,869 INFO L226 Difference]: Without dead ends: 48 [2018-04-11 10:00:09,870 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-04-11 10:00:09,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-04-11 10:00:09,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-04-11 10:00:09,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-04-11 10:00:09,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-04-11 10:00:09,872 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 20 [2018-04-11 10:00:09,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:00:09,873 INFO L459 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-04-11 10:00:09,873 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 10:00:09,873 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-04-11 10:00:09,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-11 10:00:09,873 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:00:09,873 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 10:00:09,874 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 10:00:09,874 INFO L82 PathProgramCache]: Analyzing trace with hash -2059393705, now seen corresponding path program 1 times [2018-04-11 10:00:09,874 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:00:09,874 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:00:09,875 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:00:09,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:00:09,875 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:00:09,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:00:09,882 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:00:09,914 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 10:00:09,915 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:00:09,915 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 10:00:09,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 10:00:09,915 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 10:00:09,915 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 10:00:09,915 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 6 states. [2018-04-11 10:00:09,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:00:09,959 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2018-04-11 10:00:09,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 10:00:09,960 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-04-11 10:00:09,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:00:09,960 INFO L225 Difference]: With dead ends: 43 [2018-04-11 10:00:09,961 INFO L226 Difference]: Without dead ends: 43 [2018-04-11 10:00:09,961 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 10:00:09,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-04-11 10:00:09,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-04-11 10:00:09,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-04-11 10:00:09,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-04-11 10:00:09,964 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 24 [2018-04-11 10:00:09,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:00:09,967 INFO L459 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-04-11 10:00:09,967 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 10:00:09,967 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-04-11 10:00:09,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-11 10:00:09,968 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:00:09,968 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 10:00:09,968 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 10:00:09,968 INFO L82 PathProgramCache]: Analyzing trace with hash -2059393704, now seen corresponding path program 1 times [2018-04-11 10:00:09,968 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:00:09,968 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:00:09,969 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:00:09,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:00:09,969 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:00:09,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:00:09,978 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:00:10,102 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 10:00:10,102 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:00:10,102 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 10:00:10,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 10:00:10,102 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 10:00:10,102 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-11 10:00:10,103 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 9 states. [2018-04-11 10:00:10,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:00:10,180 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-04-11 10:00:10,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 10:00:10,180 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-04-11 10:00:10,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:00:10,180 INFO L225 Difference]: With dead ends: 50 [2018-04-11 10:00:10,180 INFO L226 Difference]: Without dead ends: 50 [2018-04-11 10:00:10,181 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2018-04-11 10:00:10,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-04-11 10:00:10,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2018-04-11 10:00:10,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-04-11 10:00:10,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-04-11 10:00:10,182 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 24 [2018-04-11 10:00:10,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:00:10,182 INFO L459 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-04-11 10:00:10,183 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 10:00:10,183 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-04-11 10:00:10,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-11 10:00:10,183 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:00:10,183 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 10:00:10,183 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 10:00:10,183 INFO L82 PathProgramCache]: Analyzing trace with hash -2059340464, now seen corresponding path program 1 times [2018-04-11 10:00:10,183 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:00:10,183 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:00:10,184 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:00:10,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:00:10,184 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:00:10,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:00:10,189 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:00:10,243 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 10:00:10,244 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:00:10,244 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:00:10,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:00:10,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:00:10,281 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:00:10,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-04-11 10:00:10,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 10:00:10,318 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:00:10,322 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:00:10,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:00:10,324 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-04-11 10:00:10,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-04-11 10:00:10,358 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-04-11 10:00:10,359 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:00:10,360 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:00:10,363 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 10:00:10,363 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-04-11 10:00:10,372 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 10:00:10,391 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-04-11 10:00:10,391 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2018-04-11 10:00:10,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 10:00:10,391 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 10:00:10,391 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-04-11 10:00:10,392 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 13 states. [2018-04-11 10:00:10,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:00:10,684 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2018-04-11 10:00:10,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 10:00:10,685 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-04-11 10:00:10,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:00:10,686 INFO L225 Difference]: With dead ends: 91 [2018-04-11 10:00:10,686 INFO L226 Difference]: Without dead ends: 91 [2018-04-11 10:00:10,686 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=583, Unknown=0, NotChecked=0, Total=702 [2018-04-11 10:00:10,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-04-11 10:00:10,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 62. [2018-04-11 10:00:10,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-04-11 10:00:10,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2018-04-11 10:00:10,690 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 24 [2018-04-11 10:00:10,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:00:10,690 INFO L459 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2018-04-11 10:00:10,690 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 10:00:10,690 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2018-04-11 10:00:10,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-11 10:00:10,691 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:00:10,691 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:00:10,691 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 10:00:10,691 INFO L82 PathProgramCache]: Analyzing trace with hash 583304624, now seen corresponding path program 1 times [2018-04-11 10:00:10,691 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:00:10,691 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:00:10,692 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:00:10,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:00:10,692 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:00:10,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:00:10,701 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:00:10,732 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 10:00:10,732 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:00:10,733 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 10:00:10,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 10:00:10,733 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 10:00:10,733 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 10:00:10,733 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 6 states. [2018-04-11 10:00:10,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:00:10,769 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2018-04-11 10:00:10,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 10:00:10,769 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-04-11 10:00:10,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:00:10,770 INFO L225 Difference]: With dead ends: 61 [2018-04-11 10:00:10,770 INFO L226 Difference]: Without dead ends: 61 [2018-04-11 10:00:10,770 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 10:00:10,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-04-11 10:00:10,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-04-11 10:00:10,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-04-11 10:00:10,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2018-04-11 10:00:10,772 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 25 [2018-04-11 10:00:10,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:00:10,773 INFO L459 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2018-04-11 10:00:10,773 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 10:00:10,773 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2018-04-11 10:00:10,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-04-11 10:00:10,773 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:00:10,774 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:00:10,774 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 10:00:10,774 INFO L82 PathProgramCache]: Analyzing trace with hash 583304625, now seen corresponding path program 1 times [2018-04-11 10:00:10,774 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:00:10,774 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:00:10,775 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:00:10,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:00:10,775 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:00:10,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:00:10,783 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:00:10,873 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 10:00:10,874 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:00:10,874 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 10:00:10,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 10:00:10,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 10:00:10,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-04-11 10:00:10,875 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand 8 states. [2018-04-11 10:00:10,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:00:10,967 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2018-04-11 10:00:10,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 10:00:10,967 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-04-11 10:00:10,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:00:10,967 INFO L225 Difference]: With dead ends: 66 [2018-04-11 10:00:10,967 INFO L226 Difference]: Without dead ends: 66 [2018-04-11 10:00:10,967 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-04-11 10:00:10,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-04-11 10:00:10,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-04-11 10:00:10,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-04-11 10:00:10,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2018-04-11 10:00:10,969 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 25 [2018-04-11 10:00:10,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:00:10,970 INFO L459 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2018-04-11 10:00:10,970 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 10:00:10,970 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2018-04-11 10:00:10,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 10:00:10,970 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:00:10,970 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:00:10,970 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 10:00:10,970 INFO L82 PathProgramCache]: Analyzing trace with hash 895952721, now seen corresponding path program 1 times [2018-04-11 10:00:10,971 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:00:10,971 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:00:10,971 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:00:10,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:00:10,971 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:00:10,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:00:10,978 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:00:11,071 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-04-11 10:00:11,071 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:00:11,072 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-04-11 10:00:11,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 10:00:11,072 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 10:00:11,072 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-04-11 10:00:11,072 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand 12 states. [2018-04-11 10:00:11,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:00:11,239 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2018-04-11 10:00:11,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 10:00:11,239 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-04-11 10:00:11,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:00:11,240 INFO L225 Difference]: With dead ends: 104 [2018-04-11 10:00:11,240 INFO L226 Difference]: Without dead ends: 104 [2018-04-11 10:00:11,240 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2018-04-11 10:00:11,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-04-11 10:00:11,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 66. [2018-04-11 10:00:11,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-04-11 10:00:11,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2018-04-11 10:00:11,242 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 28 [2018-04-11 10:00:11,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:00:11,242 INFO L459 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2018-04-11 10:00:11,242 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 10:00:11,243 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2018-04-11 10:00:11,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 10:00:11,243 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:00:11,243 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:00:11,243 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 10:00:11,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1318654547, now seen corresponding path program 1 times [2018-04-11 10:00:11,243 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:00:11,243 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:00:11,244 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:00:11,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:00:11,244 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:00:11,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:00:11,250 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:00:11,416 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:00:11,416 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:00:11,416 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:00:11,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:00:11,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:00:11,444 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:00:11,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 6 treesize of output 5 [2018-04-11 10:00:11,451 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:00:11,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:00:11,457 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-11 10:00:11,509 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 14 treesize of output 11 [2018-04-11 10:00:11,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 10:00:11,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:00:11,512 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:00:11,526 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 10:00:11,526 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-04-11 10:00:11,619 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 18 treesize of output 14 [2018-04-11 10:00:11,626 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 14 treesize of output 11 [2018-04-11 10:00:11,627 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 10:00:11,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:00:11,642 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 10:00:11,643 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:35 [2018-04-11 10:00:11,752 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:00:11,787 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:00:11,787 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2018-04-11 10:00:11,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 10:00:11,788 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 10:00:11,788 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2018-04-11 10:00:11,788 INFO L87 Difference]: Start difference. First operand 66 states and 73 transitions. Second operand 22 states. [2018-04-11 10:00:13,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:00:13,187 INFO L93 Difference]: Finished difference Result 87 states and 97 transitions. [2018-04-11 10:00:13,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 10:00:13,187 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2018-04-11 10:00:13,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:00:13,188 INFO L225 Difference]: With dead ends: 87 [2018-04-11 10:00:13,188 INFO L226 Difference]: Without dead ends: 87 [2018-04-11 10:00:13,189 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=144, Invalid=978, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 10:00:13,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-04-11 10:00:13,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 78. [2018-04-11 10:00:13,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-04-11 10:00:13,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2018-04-11 10:00:13,192 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 28 [2018-04-11 10:00:13,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:00:13,193 INFO L459 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2018-04-11 10:00:13,193 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 10:00:13,193 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2018-04-11 10:00:13,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 10:00:13,197 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:00:13,197 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:00:13,197 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 10:00:13,197 INFO L82 PathProgramCache]: Analyzing trace with hash 2092930821, now seen corresponding path program 1 times [2018-04-11 10:00:13,197 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:00:13,197 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:00:13,198 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:00:13,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:00:13,198 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:00:13,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:00:13,213 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:00:13,396 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:00:13,396 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:00:13,397 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-04-11 10:00:13,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 10:00:13,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 10:00:13,400 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-04-11 10:00:13,400 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand 12 states. [2018-04-11 10:00:13,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:00:13,540 INFO L93 Difference]: Finished difference Result 145 states and 162 transitions. [2018-04-11 10:00:13,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 10:00:13,540 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2018-04-11 10:00:13,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:00:13,541 INFO L225 Difference]: With dead ends: 145 [2018-04-11 10:00:13,541 INFO L226 Difference]: Without dead ends: 145 [2018-04-11 10:00:13,541 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2018-04-11 10:00:13,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-04-11 10:00:13,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 136. [2018-04-11 10:00:13,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-04-11 10:00:13,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 156 transitions. [2018-04-11 10:00:13,545 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 156 transitions. Word has length 29 [2018-04-11 10:00:13,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:00:13,545 INFO L459 AbstractCegarLoop]: Abstraction has 136 states and 156 transitions. [2018-04-11 10:00:13,545 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 10:00:13,545 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 156 transitions. [2018-04-11 10:00:13,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 10:00:13,547 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:00:13,547 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:00:13,547 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 10:00:13,547 INFO L82 PathProgramCache]: Analyzing trace with hash -2073032434, now seen corresponding path program 1 times [2018-04-11 10:00:13,547 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:00:13,547 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:00:13,548 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:00:13,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:00:13,548 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:00:13,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:00:13,553 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:00:13,593 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:00:13,593 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:00:13,593 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:00:13,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:00:13,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:00:13,615 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:00:13,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 10:00:13,628 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:00:13,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:00:13,631 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-11 10:00:13,707 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:00:13,727 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:00:13,727 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2018-04-11 10:00:13,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 10:00:13,728 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 10:00:13,728 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-04-11 10:00:13,728 INFO L87 Difference]: Start difference. First operand 136 states and 156 transitions. Second operand 17 states. [2018-04-11 10:00:14,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:00:14,024 INFO L93 Difference]: Finished difference Result 152 states and 173 transitions. [2018-04-11 10:00:14,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 10:00:14,024 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 29 [2018-04-11 10:00:14,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:00:14,026 INFO L225 Difference]: With dead ends: 152 [2018-04-11 10:00:14,026 INFO L226 Difference]: Without dead ends: 152 [2018-04-11 10:00:14,027 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2018-04-11 10:00:14,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-04-11 10:00:14,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 137. [2018-04-11 10:00:14,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-04-11 10:00:14,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 156 transitions. [2018-04-11 10:00:14,032 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 156 transitions. Word has length 29 [2018-04-11 10:00:14,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:00:14,032 INFO L459 AbstractCegarLoop]: Abstraction has 137 states and 156 transitions. [2018-04-11 10:00:14,032 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 10:00:14,032 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 156 transitions. [2018-04-11 10:00:14,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 10:00:14,033 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:00:14,033 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:00:14,033 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 10:00:14,034 INFO L82 PathProgramCache]: Analyzing trace with hash 287492487, now seen corresponding path program 1 times [2018-04-11 10:00:14,034 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:00:14,034 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:00:14,034 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:00:14,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:00:14,035 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:00:14,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:00:14,044 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:00:14,176 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:00:14,176 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:00:14,176 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-04-11 10:00:14,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 10:00:14,177 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 10:00:14,177 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-04-11 10:00:14,177 INFO L87 Difference]: Start difference. First operand 137 states and 156 transitions. Second operand 15 states. [2018-04-11 10:00:14,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:00:14,480 INFO L93 Difference]: Finished difference Result 180 states and 197 transitions. [2018-04-11 10:00:14,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 10:00:14,481 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2018-04-11 10:00:14,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:00:14,481 INFO L225 Difference]: With dead ends: 180 [2018-04-11 10:00:14,482 INFO L226 Difference]: Without dead ends: 180 [2018-04-11 10:00:14,482 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=233, Invalid=889, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 10:00:14,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-04-11 10:00:14,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 157. [2018-04-11 10:00:14,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-04-11 10:00:14,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 176 transitions. [2018-04-11 10:00:14,487 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 176 transitions. Word has length 29 [2018-04-11 10:00:14,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:00:14,487 INFO L459 AbstractCegarLoop]: Abstraction has 157 states and 176 transitions. [2018-04-11 10:00:14,487 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 10:00:14,487 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 176 transitions. [2018-04-11 10:00:14,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 10:00:14,487 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:00:14,487 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:00:14,487 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 10:00:14,488 INFO L82 PathProgramCache]: Analyzing trace with hash 506347205, now seen corresponding path program 1 times [2018-04-11 10:00:14,488 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:00:14,488 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:00:14,488 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:00:14,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:00:14,488 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:00:14,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:00:14,495 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:00:14,669 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:00:14,669 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:00:14,669 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:00:14,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:00:14,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:00:14,692 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:00:14,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 10:00:14,696 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:00:14,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:00:14,700 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 10:00:14,741 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:00:14,742 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:00:14,742 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 10:00:14,743 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:00:14,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:00:14,746 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-04-11 10:00:14,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-11 10:00:14,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 10:00:14,790 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:00:14,792 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:00:14,796 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 10:00:14,797 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:25 [2018-04-11 10:00:14,819 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-04-11 10:00:14,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 10:00:14,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:00:14,824 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:00:14,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-04-11 10:00:14,830 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:39, output treesize:35 [2018-04-11 10:00:14,974 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 30 treesize of output 28 [2018-04-11 10:00:14,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 10:00:14,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 10:00:14,987 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 8 treesize of output 1 [2018-04-11 10:00:14,987 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 10:00:14,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:00:15,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:00:15,000 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:52, output treesize:29 [2018-04-11 10:00:15,043 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:00:15,076 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:00:15,077 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 23 [2018-04-11 10:00:15,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 10:00:15,077 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 10:00:15,078 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=495, Unknown=0, NotChecked=0, Total=552 [2018-04-11 10:00:15,078 INFO L87 Difference]: Start difference. First operand 157 states and 176 transitions. Second operand 24 states. [2018-04-11 10:00:16,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:00:16,076 INFO L93 Difference]: Finished difference Result 165 states and 185 transitions. [2018-04-11 10:00:16,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 10:00:16,076 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 29 [2018-04-11 10:00:16,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:00:16,077 INFO L225 Difference]: With dead ends: 165 [2018-04-11 10:00:16,077 INFO L226 Difference]: Without dead ends: 165 [2018-04-11 10:00:16,077 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=174, Invalid=1086, Unknown=0, NotChecked=0, Total=1260 [2018-04-11 10:00:16,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-04-11 10:00:16,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 162. [2018-04-11 10:00:16,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-04-11 10:00:16,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 181 transitions. [2018-04-11 10:00:16,081 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 181 transitions. Word has length 29 [2018-04-11 10:00:16,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:00:16,081 INFO L459 AbstractCegarLoop]: Abstraction has 162 states and 181 transitions. [2018-04-11 10:00:16,081 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 10:00:16,081 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 181 transitions. [2018-04-11 10:00:16,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-04-11 10:00:16,082 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:00:16,082 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:00:16,082 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 10:00:16,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1548705302, now seen corresponding path program 2 times [2018-04-11 10:00:16,083 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:00:16,083 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:00:16,083 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:00:16,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:00:16,083 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:00:16,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:00:16,092 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:00:16,416 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 10:00:16,416 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:00:16,416 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:00:16,422 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 10:00:16,437 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 10:00:16,437 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 10:00:16,439 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:00:16,442 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 10:00:16,442 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:00:16,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:00:16,446 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-11 10:00:16,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-11 10:00:16,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 10:00:16,464 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:00:16,465 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:00:16,469 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 10:00:16,469 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-04-11 10:00:16,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-04-11 10:00:16,596 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:00:16,600 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 19 treesize of output 25 [2018-04-11 10:00:16,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 10:00:16,607 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:00:16,615 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 10:00:16,615 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:58 [2018-04-11 10:00:16,721 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 10:00:16,740 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:00:16,740 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 27 [2018-04-11 10:00:16,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-11 10:00:16,740 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-11 10:00:16,741 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2018-04-11 10:00:16,741 INFO L87 Difference]: Start difference. First operand 162 states and 181 transitions. Second operand 28 states. [2018-04-11 10:00:17,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:00:17,200 INFO L93 Difference]: Finished difference Result 209 states and 234 transitions. [2018-04-11 10:00:17,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 10:00:17,200 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 32 [2018-04-11 10:00:17,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:00:17,201 INFO L225 Difference]: With dead ends: 209 [2018-04-11 10:00:17,201 INFO L226 Difference]: Without dead ends: 209 [2018-04-11 10:00:17,201 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=228, Invalid=1494, Unknown=0, NotChecked=0, Total=1722 [2018-04-11 10:00:17,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-04-11 10:00:17,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 170. [2018-04-11 10:00:17,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-04-11 10:00:17,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 191 transitions. [2018-04-11 10:00:17,207 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 191 transitions. Word has length 32 [2018-04-11 10:00:17,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:00:17,207 INFO L459 AbstractCegarLoop]: Abstraction has 170 states and 191 transitions. [2018-04-11 10:00:17,207 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-11 10:00:17,208 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 191 transitions. [2018-04-11 10:00:17,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-11 10:00:17,208 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:00:17,208 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:00:17,208 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 10:00:17,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1413916232, now seen corresponding path program 2 times [2018-04-11 10:00:17,209 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:00:17,209 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:00:17,209 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:00:17,210 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 10:00:17,210 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:00:17,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:00:17,220 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:00:17,536 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:00:17,536 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:00:17,536 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:00:17,541 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 10:00:17,561 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 10:00:17,561 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 10:00:17,564 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:00:17,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 10:00:17,571 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:00:17,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 10:00:17,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:00:17,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:00:17,579 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 10:00:17,612 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:00:17,613 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 10:00:17,613 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:00:17,619 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:00:17,620 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:00:17,620 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 10:00:17,620 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:00:17,624 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 10:00:17,624 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-11 10:00:17,654 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 10:00:17,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 10:00:17,655 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:00:17,656 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:00:17,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:00:17,659 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:20 [2018-04-11 10:00:17,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-04-11 10:00:17,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 10:00:17,680 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:00:17,684 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:00:17,687 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 10:00:17,688 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:30 [2018-04-11 10:00:17,831 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 33 treesize of output 32 [2018-04-11 10:00:17,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 25 [2018-04-11 10:00:17,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 10:00:17,847 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:00:17,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-04-11 10:00:17,859 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:43, output treesize:51 [2018-04-11 10:00:17,927 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 10:00:17,932 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 10:00:17,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 10:00:17,934 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:00:17,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:00:17,940 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:38 [2018-04-11 10:00:18,061 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:00:18,079 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:00:18,079 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 29 [2018-04-11 10:00:18,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-11 10:00:18,080 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-11 10:00:18,080 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=791, Unknown=0, NotChecked=0, Total=870 [2018-04-11 10:00:18,080 INFO L87 Difference]: Start difference. First operand 170 states and 191 transitions. Second operand 30 states. [2018-04-11 10:00:18,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:00:18,823 INFO L93 Difference]: Finished difference Result 182 states and 206 transitions. [2018-04-11 10:00:18,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 10:00:18,824 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 34 [2018-04-11 10:00:18,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:00:18,824 INFO L225 Difference]: With dead ends: 182 [2018-04-11 10:00:18,824 INFO L226 Difference]: Without dead ends: 182 [2018-04-11 10:00:18,825 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=184, Invalid=1538, Unknown=0, NotChecked=0, Total=1722 [2018-04-11 10:00:18,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-04-11 10:00:18,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 175. [2018-04-11 10:00:18,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-04-11 10:00:18,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 198 transitions. [2018-04-11 10:00:18,829 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 198 transitions. Word has length 34 [2018-04-11 10:00:18,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:00:18,829 INFO L459 AbstractCegarLoop]: Abstraction has 175 states and 198 transitions. [2018-04-11 10:00:18,829 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-11 10:00:18,829 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 198 transitions. [2018-04-11 10:00:18,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-11 10:00:18,830 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:00:18,830 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] [2018-04-11 10:00:18,830 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 10:00:18,830 INFO L82 PathProgramCache]: Analyzing trace with hash 395732773, now seen corresponding path program 1 times [2018-04-11 10:00:18,830 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:00:18,830 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:00:18,831 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:00:18,831 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 10:00:18,831 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:00:18,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:00:18,839 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:00:19,025 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 10:00:19,025 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:00:19,025 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:00:19,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:00:19,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:00:19,045 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:00:19,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 10:00:19,048 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:00:19,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 10:00:19,051 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:00:19,054 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 10:00:19,054 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:18, output treesize:13 [2018-04-11 10:00:19,079 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:00:19,079 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:00:19,080 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 10:00:19,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:00:19,084 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:00:19,084 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 10:00:19,085 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:00:19,089 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 10:00:19,089 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:13 [2018-04-11 10:00:19,272 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 10:00:19,290 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:00:19,290 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2018-04-11 10:00:19,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-11 10:00:19,291 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-11 10:00:19,291 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=687, Unknown=0, NotChecked=0, Total=756 [2018-04-11 10:00:19,291 INFO L87 Difference]: Start difference. First operand 175 states and 198 transitions. Second operand 28 states. [2018-04-11 10:00:20,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:00:20,016 INFO L93 Difference]: Finished difference Result 220 states and 250 transitions. [2018-04-11 10:00:20,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 10:00:20,017 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 34 [2018-04-11 10:00:20,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:00:20,017 INFO L225 Difference]: With dead ends: 220 [2018-04-11 10:00:20,017 INFO L226 Difference]: Without dead ends: 220 [2018-04-11 10:00:20,018 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=237, Invalid=1925, Unknown=0, NotChecked=0, Total=2162 [2018-04-11 10:00:20,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-04-11 10:00:20,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 184. [2018-04-11 10:00:20,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-04-11 10:00:20,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 210 transitions. [2018-04-11 10:00:20,024 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 210 transitions. Word has length 34 [2018-04-11 10:00:20,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:00:20,024 INFO L459 AbstractCegarLoop]: Abstraction has 184 states and 210 transitions. [2018-04-11 10:00:20,024 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-11 10:00:20,024 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 210 transitions. [2018-04-11 10:00:20,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-04-11 10:00:20,024 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:00:20,025 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] [2018-04-11 10:00:20,025 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 10:00:20,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1068524766, now seen corresponding path program 1 times [2018-04-11 10:00:20,025 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:00:20,025 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:00:20,025 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:00:20,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:00:20,026 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:00:20,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:00:20,034 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:00:20,089 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 10:00:20,089 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 10:00:20,089 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 10:00:20,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 10:00:20,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 10:00:20,090 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 10:00:20,090 INFO L87 Difference]: Start difference. First operand 184 states and 210 transitions. Second operand 6 states. [2018-04-11 10:00:20,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:00:20,154 INFO L93 Difference]: Finished difference Result 183 states and 209 transitions. [2018-04-11 10:00:20,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 10:00:20,155 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-04-11 10:00:20,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:00:20,155 INFO L225 Difference]: With dead ends: 183 [2018-04-11 10:00:20,156 INFO L226 Difference]: Without dead ends: 121 [2018-04-11 10:00:20,156 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-04-11 10:00:20,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-04-11 10:00:20,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 116. [2018-04-11 10:00:20,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-04-11 10:00:20,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 125 transitions. [2018-04-11 10:00:20,159 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 125 transitions. Word has length 35 [2018-04-11 10:00:20,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:00:20,159 INFO L459 AbstractCegarLoop]: Abstraction has 116 states and 125 transitions. [2018-04-11 10:00:20,159 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 10:00:20,159 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 125 transitions. [2018-04-11 10:00:20,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-11 10:00:20,159 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:00:20,160 INFO L355 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:00:20,160 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 10:00:20,160 INFO L82 PathProgramCache]: Analyzing trace with hash -895217575, now seen corresponding path program 3 times [2018-04-11 10:00:20,160 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:00:20,160 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:00:20,161 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:00:20,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:00:20,161 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:00:20,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:00:20,170 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:00:20,540 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:00:20,540 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:00:20,540 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:00:20,545 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 10:00:20,565 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-04-11 10:00:20,565 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 10:00:20,568 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:00:20,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 10:00:20,574 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:00:20,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:00:20,579 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-11 10:00:20,611 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 14 treesize of output 11 [2018-04-11 10:00:20,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 10:00:20,616 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:00:20,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:00:20,622 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 10:00:20,622 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-04-11 10:00:22,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2018-04-11 10:00:22,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 58 [2018-04-11 10:00:22,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 10 xjuncts. [2018-04-11 10:00:22,295 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:00:22,325 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 10:00:22,325 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:60, output treesize:143 [2018-04-11 10:00:22,570 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 30 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:00:22,586 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:00:22,586 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 35 [2018-04-11 10:00:22,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-11 10:00:22,587 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-11 10:00:22,587 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1146, Unknown=2, NotChecked=0, Total=1260 [2018-04-11 10:00:22,587 INFO L87 Difference]: Start difference. First operand 116 states and 125 transitions. Second operand 36 states. [2018-04-11 10:00:24,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:00:24,621 INFO L93 Difference]: Finished difference Result 148 states and 159 transitions. [2018-04-11 10:00:24,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-11 10:00:24,622 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2018-04-11 10:00:24,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:00:24,622 INFO L225 Difference]: With dead ends: 148 [2018-04-11 10:00:24,622 INFO L226 Difference]: Without dead ends: 148 [2018-04-11 10:00:24,623 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 633 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=321, Invalid=2869, Unknown=2, NotChecked=0, Total=3192 [2018-04-11 10:00:24,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-04-11 10:00:24,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 124. [2018-04-11 10:00:24,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-04-11 10:00:24,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2018-04-11 10:00:24,625 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 36 [2018-04-11 10:00:24,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:00:24,625 INFO L459 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2018-04-11 10:00:24,625 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-11 10:00:24,625 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2018-04-11 10:00:24,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 10:00:24,625 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:00:24,626 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:00:24,626 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 10:00:24,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1917191592, now seen corresponding path program 2 times [2018-04-11 10:00:24,626 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:00:24,626 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:00:24,626 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:00:24,626 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 10:00:24,626 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:00:24,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:00:24,632 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:00:24,995 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:00:24,995 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:00:24,995 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:00:25,002 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 10:00:25,022 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 10:00:25,022 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 10:00:25,024 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:00:25,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 10:00:25,060 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:00:25,067 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 10:00:25,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:00:25,071 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 10:00:25,072 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-04-11 10:00:25,115 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:00:25,116 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:00:25,116 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 10:00:25,117 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:00:25,122 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:00:25,123 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 10:00:25,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:00:25,127 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 10:00:25,127 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2018-04-11 10:00:25,158 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 14 treesize of output 11 [2018-04-11 10:00:25,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 10:00:25,160 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:00:25,160 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:00:25,164 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 10:00:25,164 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-04-11 10:00:25,224 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 18 treesize of output 14 [2018-04-11 10:00:25,229 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 14 treesize of output 15 [2018-04-11 10:00:25,230 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 10:00:25,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:00:25,239 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 10:00:25,239 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:39 [2018-04-11 10:00:25,416 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:00:25,433 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:00:25,433 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 34 [2018-04-11 10:00:25,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-11 10:00:25,434 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-11 10:00:25,434 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1097, Unknown=0, NotChecked=0, Total=1190 [2018-04-11 10:00:25,434 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 35 states. [2018-04-11 10:00:26,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:00:26,415 INFO L93 Difference]: Finished difference Result 163 states and 174 transitions. [2018-04-11 10:00:26,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-11 10:00:26,415 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 38 [2018-04-11 10:00:26,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:00:26,416 INFO L225 Difference]: With dead ends: 163 [2018-04-11 10:00:26,416 INFO L226 Difference]: Without dead ends: 163 [2018-04-11 10:00:26,417 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 698 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=249, Invalid=2507, Unknown=0, NotChecked=0, Total=2756 [2018-04-11 10:00:26,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-04-11 10:00:26,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 124. [2018-04-11 10:00:26,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-04-11 10:00:26,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2018-04-11 10:00:26,420 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 38 [2018-04-11 10:00:26,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:00:26,420 INFO L459 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2018-04-11 10:00:26,420 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-11 10:00:26,420 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2018-04-11 10:00:26,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-11 10:00:26,421 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:00:26,421 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:00:26,421 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 10:00:26,421 INFO L82 PathProgramCache]: Analyzing trace with hash -642244955, now seen corresponding path program 3 times [2018-04-11 10:00:26,421 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:00:26,421 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:00:26,422 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:00:26,422 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 10:00:26,422 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:00:26,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:00:26,431 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:00:26,668 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-11 10:00:26,669 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:00:26,669 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:00:26,681 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 10:00:26,714 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-11 10:00:26,714 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 10:00:26,718 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:00:26,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 10:00:26,721 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:00:26,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 10:00:26,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:00:26,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:00:26,730 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 10:00:26,766 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:00:26,766 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:00:26,767 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 10:00:26,769 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:00:26,773 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 10:00:26,774 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:00:26,779 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 10:00:26,779 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-11 10:00:26,815 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 10:00:26,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 10:00:26,818 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:00:26,820 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:00:26,825 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 10:00:26,825 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-04-11 10:00:26,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-04-11 10:00:26,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 10:00:26,931 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:00:26,934 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:00:26,938 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 10:00:26,938 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:33 [2018-04-11 10:00:27,041 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 34 treesize of output 33 [2018-04-11 10:00:27,055 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 25 [2018-04-11 10:00:27,056 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 10:00:27,067 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:00:27,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-04-11 10:00:27,083 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:44, output treesize:57 [2018-04-11 10:00:27,112 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 10:00:27,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 10:00:27,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:00:27,117 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:00:27,121 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 10:00:27,121 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2018-04-11 10:00:27,159 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 10:00:27,164 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 10:00:27,164 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 10:00:27,166 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:00:27,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:00:27,170 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-04-11 10:00:27,207 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 10:00:27,225 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:00:27,226 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 27 [2018-04-11 10:00:27,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-11 10:00:27,226 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-11 10:00:27,227 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=675, Unknown=0, NotChecked=0, Total=756 [2018-04-11 10:00:27,227 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 28 states. [2018-04-11 10:00:27,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:00:27,788 INFO L93 Difference]: Finished difference Result 123 states and 132 transitions. [2018-04-11 10:00:27,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 10:00:27,788 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 39 [2018-04-11 10:00:27,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:00:27,789 INFO L225 Difference]: With dead ends: 123 [2018-04-11 10:00:27,789 INFO L226 Difference]: Without dead ends: 93 [2018-04-11 10:00:27,789 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=221, Invalid=1339, Unknown=0, NotChecked=0, Total=1560 [2018-04-11 10:00:27,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-04-11 10:00:27,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 84. [2018-04-11 10:00:27,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-04-11 10:00:27,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2018-04-11 10:00:27,790 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 39 [2018-04-11 10:00:27,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:00:27,791 INFO L459 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2018-04-11 10:00:27,791 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-11 10:00:27,791 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2018-04-11 10:00:27,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-04-11 10:00:27,791 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:00:27,791 INFO L355 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:00:27,791 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 10:00:27,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1090524900, now seen corresponding path program 4 times [2018-04-11 10:00:27,791 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:00:27,791 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:00:27,792 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:00:27,792 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 10:00:27,792 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:00:27,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:00:27,799 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:00:28,437 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:00:28,437 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:00:28,437 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:00:28,442 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 10:00:28,457 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 10:00:28,457 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 10:00:28,459 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:00:28,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 10:00:28,468 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:00:28,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:00:28,471 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-11 10:00:28,503 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 14 treesize of output 11 [2018-04-11 10:00:28,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 10:00:28,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:00:28,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:00:28,510 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 10:00:28,510 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-04-11 10:00:29,019 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 48 treesize of output 38 [2018-04-11 10:00:29,021 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:00:29,021 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:00:29,022 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:00:29,023 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:00:29,023 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:00:29,025 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:00:29,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 93 [2018-04-11 10:00:29,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 10:00:29,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:00:29,082 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 10:00:29,082 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:73 [2018-04-11 10:00:29,217 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:00:29,245 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:00:29,246 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 41 [2018-04-11 10:00:29,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-11 10:00:29,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-11 10:00:29,246 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=1508, Unknown=0, NotChecked=0, Total=1722 [2018-04-11 10:00:29,247 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand 42 states. [2018-04-11 10:00:29,870 WARN L151 SmtUtils]: Spent 452ms on a formula simplification. DAG size of input: 45 DAG size of output 23 [2018-04-11 10:00:30,545 WARN L151 SmtUtils]: Spent 589ms on a formula simplification. DAG size of input: 59 DAG size of output 37 [2018-04-11 10:00:31,125 WARN L151 SmtUtils]: Spent 555ms on a formula simplification. DAG size of input: 59 DAG size of output 37 [2018-04-11 10:00:31,687 WARN L151 SmtUtils]: Spent 526ms on a formula simplification. DAG size of input: 61 DAG size of output 39 [2018-04-11 10:00:32,239 WARN L151 SmtUtils]: Spent 510ms on a formula simplification. DAG size of input: 64 DAG size of output 42 [2018-04-11 10:00:32,793 WARN L151 SmtUtils]: Spent 517ms on a formula simplification. DAG size of input: 64 DAG size of output 42 [2018-04-11 10:00:33,960 WARN L151 SmtUtils]: Spent 584ms on a formula simplification. DAG size of input: 59 DAG size of output 39 [2018-04-11 10:00:34,489 WARN L151 SmtUtils]: Spent 443ms on a formula simplification. DAG size of input: 51 DAG size of output 29 [2018-04-11 10:00:35,080 WARN L151 SmtUtils]: Spent 496ms on a formula simplification. DAG size of input: 55 DAG size of output 32 [2018-04-11 10:00:35,879 WARN L151 SmtUtils]: Spent 555ms on a formula simplification. DAG size of input: 56 DAG size of output 32 [2018-04-11 10:00:36,442 WARN L151 SmtUtils]: Spent 530ms on a formula simplification. DAG size of input: 52 DAG size of output 31 [2018-04-11 10:00:36,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:00:36,623 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2018-04-11 10:00:36,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 10:00:36,624 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 40 [2018-04-11 10:00:36,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:00:36,624 INFO L225 Difference]: With dead ends: 122 [2018-04-11 10:00:36,624 INFO L226 Difference]: Without dead ends: 122 [2018-04-11 10:00:36,625 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1135 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=512, Invalid=3648, Unknown=0, NotChecked=0, Total=4160 [2018-04-11 10:00:36,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-04-11 10:00:36,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 100. [2018-04-11 10:00:36,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-04-11 10:00:36,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2018-04-11 10:00:36,627 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 40 [2018-04-11 10:00:36,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:00:36,627 INFO L459 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2018-04-11 10:00:36,627 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-11 10:00:36,627 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2018-04-11 10:00:36,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-04-11 10:00:36,628 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:00:36,628 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:00:36,628 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 10:00:36,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1758680405, now seen corresponding path program 3 times [2018-04-11 10:00:36,628 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:00:36,628 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:00:36,629 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:00:36,629 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 10:00:36,629 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:00:36,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:00:36,641 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:00:37,488 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:00:37,488 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:00:37,489 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:00:37,496 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 10:00:37,520 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-11 10:00:37,520 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 10:00:37,523 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:00:37,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 10:00:37,527 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:00:37,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 10:00:37,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:00:37,537 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 10:00:37,537 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-04-11 10:00:37,576 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:00:37,577 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:00:37,577 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 10:00:37,577 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:00:37,586 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:00:37,587 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:00:37,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 10:00:37,587 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:00:37,592 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 10:00:37,592 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:19 [2018-04-11 10:00:37,633 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 14 treesize of output 11 [2018-04-11 10:00:37,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 10:00:37,636 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:00:37,638 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:00:37,642 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 10:00:37,642 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:29 [2018-04-11 10:00:37,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-04-11 10:00:37,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 29 [2018-04-11 10:00:37,860 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-04-11 10:00:37,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:00:37,883 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 10:00:37,883 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:99 [2018-04-11 10:00:38,190 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:00:38,208 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:00:38,208 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 41 [2018-04-11 10:00:38,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-11 10:00:38,208 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-11 10:00:38,209 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1593, Unknown=0, NotChecked=0, Total=1722 [2018-04-11 10:00:38,209 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 42 states. [2018-04-11 10:00:39,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:00:39,774 INFO L93 Difference]: Finished difference Result 115 states and 121 transitions. [2018-04-11 10:00:39,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-11 10:00:39,775 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2018-04-11 10:00:39,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:00:39,775 INFO L225 Difference]: With dead ends: 115 [2018-04-11 10:00:39,775 INFO L226 Difference]: Without dead ends: 115 [2018-04-11 10:00:39,777 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1005 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=329, Invalid=3211, Unknown=0, NotChecked=0, Total=3540 [2018-04-11 10:00:39,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-04-11 10:00:39,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 110. [2018-04-11 10:00:39,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-04-11 10:00:39,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 116 transitions. [2018-04-11 10:00:39,780 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 116 transitions. Word has length 42 [2018-04-11 10:00:39,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:00:39,780 INFO L459 AbstractCegarLoop]: Abstraction has 110 states and 116 transitions. [2018-04-11 10:00:39,780 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-11 10:00:39,780 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 116 transitions. [2018-04-11 10:00:39,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-11 10:00:39,781 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:00:39,781 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:00:39,781 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 10:00:39,781 INFO L82 PathProgramCache]: Analyzing trace with hash -295496146, now seen corresponding path program 4 times [2018-04-11 10:00:39,781 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:00:39,781 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:00:39,782 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:00:39,782 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 10:00:39,782 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:00:39,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:00:39,802 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:00:40,567 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 10:00:40,567 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:00:40,567 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:00:40,572 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 10:00:40,588 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 10:00:40,588 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 10:00:40,590 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:00:40,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 10:00:40,594 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:00:40,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 10:00:40,605 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:00:40,609 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 10:00:40,610 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:22 [2018-04-11 10:00:40,659 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:00:40,659 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:00:40,660 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 20 treesize of output 29 [2018-04-11 10:00:40,660 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:00:40,668 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:00:40,668 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:00:40,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 10:00:40,668 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:00:40,673 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 10:00:40,673 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:36, output treesize:22 [2018-04-11 10:00:40,724 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-11 10:00:40,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 10:00:40,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:00:40,728 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:00:40,734 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 10:00:40,734 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:32 [2018-04-11 10:00:41,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2018-04-11 10:00:41,067 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:00:41,067 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:00:41,068 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:00:41,073 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 30 treesize of output 58 [2018-04-11 10:00:41,073 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 10:00:41,087 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:00:41,101 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 10:00:41,102 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:84 [2018-04-11 10:00:41,437 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 10:00:41,455 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:00:41,455 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24] total 47 [2018-04-11 10:00:41,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-04-11 10:00:41,456 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-04-11 10:00:41,456 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=2116, Unknown=0, NotChecked=0, Total=2256 [2018-04-11 10:00:41,456 INFO L87 Difference]: Start difference. First operand 110 states and 116 transitions. Second operand 48 states. [2018-04-11 10:00:44,248 WARN L151 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 105 DAG size of output 85 [2018-04-11 10:00:46,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:00:46,062 INFO L93 Difference]: Finished difference Result 129 states and 135 transitions. [2018-04-11 10:00:46,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-11 10:00:46,062 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 46 [2018-04-11 10:00:46,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:00:46,063 INFO L225 Difference]: With dead ends: 129 [2018-04-11 10:00:46,063 INFO L226 Difference]: Without dead ends: 129 [2018-04-11 10:00:46,064 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1685 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=422, Invalid=5128, Unknown=0, NotChecked=0, Total=5550 [2018-04-11 10:00:46,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-04-11 10:00:46,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 115. [2018-04-11 10:00:46,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-04-11 10:00:46,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 121 transitions. [2018-04-11 10:00:46,066 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 121 transitions. Word has length 46 [2018-04-11 10:00:46,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:00:46,066 INFO L459 AbstractCegarLoop]: Abstraction has 115 states and 121 transitions. [2018-04-11 10:00:46,066 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-04-11 10:00:46,066 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 121 transitions. [2018-04-11 10:00:46,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-11 10:00:46,066 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:00:46,066 INFO L355 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:00:46,066 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 10:00:46,066 INFO L82 PathProgramCache]: Analyzing trace with hash 328207906, now seen corresponding path program 5 times [2018-04-11 10:00:46,067 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:00:46,067 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:00:46,067 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:00:46,067 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 10:00:46,067 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:00:46,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:00:46,079 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:00:47,118 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:00:47,118 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:00:47,118 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:00:47,124 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 10:00:47,141 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-04-11 10:00:47,141 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 10:00:47,143 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:00:47,146 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 10:00:47,146 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:00:47,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:00:47,150 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-11 10:00:47,184 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 14 treesize of output 11 [2018-04-11 10:00:47,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 10:00:47,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:00:47,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:00:47,190 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 10:00:47,190 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-04-11 10:00:48,543 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 68 treesize of output 54 [2018-04-11 10:00:48,545 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:00:48,546 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:00:48,547 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:00:48,547 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:00:48,548 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:00:48,548 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:00:48,549 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:00:48,549 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:00:48,550 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:00:48,550 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:00:48,551 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:00:48,551 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:00:48,552 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:00:48,553 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:00:48,554 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:00:48,568 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 54 treesize of output 187 [2018-04-11 10:00:48,569 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 10:00:48,623 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:00:48,650 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 10:00:48,650 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:89, output treesize:101 [2018-04-11 10:00:48,812 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:00:48,830 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:00:48,830 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28] total 53 [2018-04-11 10:00:48,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-04-11 10:00:48,830 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-04-11 10:00:48,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=396, Invalid=2465, Unknown=1, NotChecked=0, Total=2862 [2018-04-11 10:00:48,831 INFO L87 Difference]: Start difference. First operand 115 states and 121 transitions. Second operand 54 states. [2018-04-11 10:01:00,394 WARN L151 SmtUtils]: Spent 138ms on a formula simplification. DAG size of input: 123 DAG size of output 115 [2018-04-11 10:01:00,596 WARN L151 SmtUtils]: Spent 135ms on a formula simplification. DAG size of input: 113 DAG size of output 112 [2018-04-11 10:01:04,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:01:04,090 INFO L93 Difference]: Finished difference Result 184 states and 195 transitions. [2018-04-11 10:01:04,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-04-11 10:01:04,091 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 48 [2018-04-11 10:01:04,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:01:04,091 INFO L225 Difference]: With dead ends: 184 [2018-04-11 10:01:04,091 INFO L226 Difference]: Without dead ends: 184 [2018-04-11 10:01:04,093 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2487 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=964, Invalid=6847, Unknown=21, NotChecked=0, Total=7832 [2018-04-11 10:01:04,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-04-11 10:01:04,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 147. [2018-04-11 10:01:04,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-04-11 10:01:04,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 157 transitions. [2018-04-11 10:01:04,096 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 157 transitions. Word has length 48 [2018-04-11 10:01:04,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:01:04,096 INFO L459 AbstractCegarLoop]: Abstraction has 147 states and 157 transitions. [2018-04-11 10:01:04,096 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-04-11 10:01:04,096 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 157 transitions. [2018-04-11 10:01:04,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-11 10:01:04,097 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:01:04,097 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:01:04,097 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 10:01:04,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1516107727, now seen corresponding path program 5 times [2018-04-11 10:01:04,098 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:01:04,098 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:01:04,098 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:01:04,098 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 10:01:04,099 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:01:04,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:01:04,116 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:01:05,796 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:01:05,796 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:01:05,796 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:01:05,801 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 10:01:05,820 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-04-11 10:01:05,821 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 10:01:05,823 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:01:05,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2018-04-11 10:01:05,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:01:05,845 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-11 10:01:05,846 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:01:05,860 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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 24 [2018-04-11 10:01:05,861 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 10:01:05,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-11 10:01:05,875 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:01:05,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-04-11 10:01:05,876 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 10:01:05,877 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2018-04-11 10:01:05,878 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 10:01:05,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 10:01:05,891 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:71, output treesize:62 [2018-04-11 10:01:05,977 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:01:05,978 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:01:05,978 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 34 treesize of output 43 [2018-04-11 10:01:05,978 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:01:06,003 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:01:06,003 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:01:06,004 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 33 treesize of output 27 [2018-04-11 10:01:06,004 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:01:06,026 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:01:06,027 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:01:06,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2018-04-11 10:01:06,028 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 10:01:06,056 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:01:06,056 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:01:06,057 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 30 treesize of output 24 [2018-04-11 10:01:06,057 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:01:06,076 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:01:06,077 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:01:06,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-04-11 10:01:06,077 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-04-11 10:01:06,095 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:01:06,096 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 24 treesize of output 33 [2018-04-11 10:01:06,096 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 10:01:06,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 6 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-11 10:01:06,113 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:96, output treesize:60 [2018-04-11 10:01:06,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 31 [2018-04-11 10:01:06,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 11 treesize of output 10 [2018-04-11 10:01:06,210 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:01:06,215 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:01:06,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 34 [2018-04-11 10:01:06,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 18 treesize of output 17 [2018-04-11 10:01:06,239 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:01:06,244 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:01:06,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 34 [2018-04-11 10:01:06,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-04-11 10:01:06,264 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-11 10:01:06,268 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:01:06,283 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-04-11 10:01:06,283 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:109, output treesize:97 [2018-04-11 10:01:06,706 WARN L148 SmtUtils]: Spent 237ms on a formula simplification that was a NOOP. DAG size: 40 [2018-04-11 10:01:07,011 WARN L148 SmtUtils]: Spent 259ms on a formula simplification that was a NOOP. DAG size: 43 [2018-04-11 10:01:08,828 WARN L148 SmtUtils]: Spent 1697ms on a formula simplification that was a NOOP. DAG size: 45 [2018-04-11 10:01:10,977 WARN L148 SmtUtils]: Spent 2099ms on a formula simplification that was a NOOP. DAG size: 48 [2018-04-11 10:01:12,810 WARN L148 SmtUtils]: Spent 1774ms on a formula simplification that was a NOOP. DAG size: 48 [2018-04-11 10:01:15,209 WARN L148 SmtUtils]: Spent 2334ms on a formula simplification that was a NOOP. DAG size: 50 [2018-04-11 10:01:18,072 WARN L148 SmtUtils]: Spent 2622ms on a formula simplification that was a NOOP. DAG size: 56 [2018-04-11 10:01:18,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 60 [2018-04-11 10:01:18,077 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:01:18,078 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:01:18,078 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:01:18,079 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:01:18,079 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:01:18,080 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:01:18,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 121 [2018-04-11 10:01:18,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 10:01:18,116 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:01:18,177 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 70 treesize of output 60 [2018-04-11 10:01:18,179 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:01:18,179 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:01:18,180 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:01:18,180 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:01:18,181 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:01:18,181 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:01:18,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 121 [2018-04-11 10:01:18,189 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 10:01:18,217 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:01:18,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:01:18,244 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:208, output treesize:146 [2018-04-11 10:01:18,667 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:01:18,684 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:01:18,684 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 51 [2018-04-11 10:01:18,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-04-11 10:01:18,685 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-04-11 10:01:18,685 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=2512, Unknown=0, NotChecked=0, Total=2652 [2018-04-11 10:01:18,685 INFO L87 Difference]: Start difference. First operand 147 states and 157 transitions. Second operand 52 states. [2018-04-11 10:01:19,996 WARN L151 SmtUtils]: Spent 1028ms on a formula simplification. DAG size of input: 123 DAG size of output 73 [2018-04-11 10:01:20,423 WARN L151 SmtUtils]: Spent 290ms on a formula simplification. DAG size of input: 133 DAG size of output 71 [2018-04-11 10:01:21,617 WARN L151 SmtUtils]: Spent 1143ms on a formula simplification. DAG size of input: 137 DAG size of output 75 [2018-04-11 10:01:22,133 WARN L151 SmtUtils]: Spent 464ms on a formula simplification. DAG size of input: 134 DAG size of output 75 [2018-04-11 10:01:23,251 WARN L151 SmtUtils]: Spent 1043ms on a formula simplification. DAG size of input: 140 DAG size of output 77 [2018-04-11 10:01:25,156 WARN L151 SmtUtils]: Spent 1846ms on a formula simplification. DAG size of input: 143 DAG size of output 80 [2018-04-11 10:01:29,135 WARN L151 SmtUtils]: Spent 3912ms on a formula simplification. DAG size of input: 140 DAG size of output 80 [2018-04-11 10:01:32,123 WARN L151 SmtUtils]: Spent 2923ms on a formula simplification. DAG size of input: 129 DAG size of output 82 [2018-04-11 10:01:32,299 WARN L151 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 133 DAG size of output 85 [2018-04-11 10:01:32,485 WARN L151 SmtUtils]: Spent 118ms on a formula simplification. DAG size of input: 158 DAG size of output 85 [2018-04-11 10:01:37,061 WARN L151 SmtUtils]: Spent 4512ms on a formula simplification. DAG size of input: 136 DAG size of output 88 [2018-04-11 10:01:44,353 WARN L151 SmtUtils]: Spent 7218ms on a formula simplification. DAG size of input: 153 DAG size of output 105 [2018-04-11 10:01:50,556 WARN L151 SmtUtils]: Spent 6127ms on a formula simplification. DAG size of input: 144 DAG size of output 100 [2018-04-11 10:01:51,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:01:51,909 INFO L93 Difference]: Finished difference Result 185 states and 195 transitions. [2018-04-11 10:01:51,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-11 10:01:51,910 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 50 [2018-04-11 10:01:51,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:01:51,910 INFO L225 Difference]: With dead ends: 185 [2018-04-11 10:01:51,911 INFO L226 Difference]: Without dead ends: 185 [2018-04-11 10:01:51,912 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1746 ImplicationChecksByTransitivity, 46.1s TimeCoverageRelationStatistics Valid=406, Invalid=5914, Unknown=0, NotChecked=0, Total=6320 [2018-04-11 10:01:51,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-04-11 10:01:51,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 147. [2018-04-11 10:01:51,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-04-11 10:01:51,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 157 transitions. [2018-04-11 10:01:51,916 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 157 transitions. Word has length 50 [2018-04-11 10:01:51,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:01:51,917 INFO L459 AbstractCegarLoop]: Abstraction has 147 states and 157 transitions. [2018-04-11 10:01:51,917 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-04-11 10:01:51,917 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 157 transitions. [2018-04-11 10:01:51,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-04-11 10:01:51,917 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:01:51,918 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:01:51,918 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 10:01:51,918 INFO L82 PathProgramCache]: Analyzing trace with hash -509952630, now seen corresponding path program 6 times [2018-04-11 10:01:51,918 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:01:51,918 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:01:51,919 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:01:51,919 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 10:01:51,919 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:01:51,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:01:51,935 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:01:52,544 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-04-11 10:01:52,544 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:01:52,544 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:01:52,549 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 10:01:52,585 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-04-11 10:01:52,585 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 10:01:52,589 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:01:52,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 10:01:52,591 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:01:52,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 10:01:52,597 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:01:52,601 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 10:01:52,601 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:19 [2018-04-11 10:01:52,643 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:01:52,651 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:01:52,651 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 10:01:52,651 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:01:52,660 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:01:52,661 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:01:52,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 10:01:52,661 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:01:52,666 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 10:01:52,667 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:19 [2018-04-11 10:01:52,711 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 14 treesize of output 11 [2018-04-11 10:01:52,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 10:01:52,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:01:52,713 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:01:52,717 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 10:01:52,717 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:29 [2018-04-11 10:01:52,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2018-04-11 10:01:52,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 29 [2018-04-11 10:01:52,904 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-04-11 10:01:52,914 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:01:52,926 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 10:01:52,926 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:99 [2018-04-11 10:01:53,311 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:01:53,329 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:01:53,329 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 46 [2018-04-11 10:01:53,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-04-11 10:01:53,329 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-04-11 10:01:53,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=2008, Unknown=0, NotChecked=0, Total=2162 [2018-04-11 10:01:53,330 INFO L87 Difference]: Start difference. First operand 147 states and 157 transitions. Second operand 47 states. [2018-04-11 10:01:55,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:01:55,726 INFO L93 Difference]: Finished difference Result 189 states and 199 transitions. [2018-04-11 10:01:55,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-11 10:01:55,727 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 57 [2018-04-11 10:01:55,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:01:55,727 INFO L225 Difference]: With dead ends: 189 [2018-04-11 10:01:55,727 INFO L226 Difference]: Without dead ends: 159 [2018-04-11 10:01:55,728 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1684 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=528, Invalid=5478, Unknown=0, NotChecked=0, Total=6006 [2018-04-11 10:01:55,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-04-11 10:01:55,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 147. [2018-04-11 10:01:55,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-04-11 10:01:55,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 156 transitions. [2018-04-11 10:01:55,731 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 156 transitions. Word has length 57 [2018-04-11 10:01:55,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:01:55,731 INFO L459 AbstractCegarLoop]: Abstraction has 147 states and 156 transitions. [2018-04-11 10:01:55,731 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-04-11 10:01:55,731 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 156 transitions. [2018-04-11 10:01:55,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-04-11 10:01:55,731 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:01:55,731 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:01:55,731 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 10:01:55,732 INFO L82 PathProgramCache]: Analyzing trace with hash -415465545, now seen corresponding path program 7 times [2018-04-11 10:01:55,732 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:01:55,732 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:01:55,732 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:01:55,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 10:01:55,732 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:01:55,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:01:55,747 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:01:56,174 WARN L151 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 77 DAG size of output 61 [2018-04-11 10:01:56,336 WARN L151 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 69 DAG size of output 56 [2018-04-11 10:01:56,469 WARN L151 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 69 DAG size of output 56 [2018-04-11 10:01:56,593 WARN L151 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 72 DAG size of output 59 [2018-04-11 10:01:56,823 WARN L151 SmtUtils]: Spent 110ms on a formula simplification. DAG size of input: 81 DAG size of output 56 [2018-04-11 10:01:56,973 WARN L151 SmtUtils]: Spent 127ms on a formula simplification. DAG size of input: 84 DAG size of output 59 [2018-04-11 10:01:57,786 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 109 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:01:57,786 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:01:57,786 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:01:57,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:01:57,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:01:57,812 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:01:57,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 10:01:57,816 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:01:57,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 10:01:57,822 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:01:57,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:01:57,826 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:16 [2018-04-11 10:01:57,875 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:01:57,876 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:01:57,876 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 10:01:57,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:01:57,884 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:01:57,884 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:01:57,885 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 10:01:57,885 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:01:57,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:01:57,889 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2018-04-11 10:01:57,938 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 14 treesize of output 11 [2018-04-11 10:01:57,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 10:01:57,939 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:01:57,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:01:57,944 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 10:01:57,944 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2018-04-11 10:01:58,785 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 68 treesize of output 54 [2018-04-11 10:01:58,787 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:01:58,788 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:01:58,788 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:01:58,789 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:01:58,789 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:01:58,790 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:01:58,791 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:01:58,791 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:01:58,792 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:01:58,792 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:01:58,793 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:01:58,793 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:01:58,794 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:01:58,794 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:01:58,795 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:01:58,808 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 54 treesize of output 187 [2018-04-11 10:01:58,809 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 10:01:58,860 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:01:58,887 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 10:01:58,887 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:91, output treesize:150 [2018-04-11 10:01:59,258 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 109 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:01:59,275 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:01:59,275 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33] total 64 [2018-04-11 10:01:59,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-04-11 10:01:59,276 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-04-11 10:01:59,276 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=3914, Unknown=0, NotChecked=0, Total=4160 [2018-04-11 10:01:59,276 INFO L87 Difference]: Start difference. First operand 147 states and 156 transitions. Second operand 65 states. [2018-04-11 10:02:00,132 WARN L151 SmtUtils]: Spent 423ms on a formula simplification. DAG size of input: 139 DAG size of output 43 [2018-04-11 10:02:01,245 WARN L151 SmtUtils]: Spent 712ms on a formula simplification. DAG size of input: 137 DAG size of output 51 [2018-04-11 10:02:01,981 WARN L151 SmtUtils]: Spent 169ms on a formula simplification. DAG size of input: 140 DAG size of output 62 [2018-04-11 10:02:02,979 WARN L151 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 154 DAG size of output 101 [2018-04-11 10:02:06,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:02:06,084 INFO L93 Difference]: Finished difference Result 199 states and 209 transitions. [2018-04-11 10:02:06,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-04-11 10:02:06,084 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 58 [2018-04-11 10:02:06,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:02:06,085 INFO L225 Difference]: With dead ends: 199 [2018-04-11 10:02:06,085 INFO L226 Difference]: Without dead ends: 199 [2018-04-11 10:02:06,086 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4563 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=1052, Invalid=12287, Unknown=1, NotChecked=0, Total=13340 [2018-04-11 10:02:06,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-04-11 10:02:06,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 148. [2018-04-11 10:02:06,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-04-11 10:02:06,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 158 transitions. [2018-04-11 10:02:06,087 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 158 transitions. Word has length 58 [2018-04-11 10:02:06,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:02:06,088 INFO L459 AbstractCegarLoop]: Abstraction has 148 states and 158 transitions. [2018-04-11 10:02:06,088 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-04-11 10:02:06,088 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 158 transitions. [2018-04-11 10:02:06,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-04-11 10:02:06,088 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:02:06,088 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:02:06,088 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 10:02:06,088 INFO L82 PathProgramCache]: Analyzing trace with hash 2129422353, now seen corresponding path program 8 times [2018-04-11 10:02:06,088 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:02:06,088 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:02:06,089 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:02:06,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 10:02:06,089 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:02:06,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:02:06,098 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:02:07,501 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:02:07,501 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:02:07,501 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:02:07,507 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 10:02:07,529 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 10:02:07,529 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 10:02:07,532 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:02:07,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2018-04-11 10:02:07,536 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:02:07,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-04-11 10:02:07,545 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:02:07,553 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-04-11 10:02:07,553 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 10:02:07,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2018-04-11 10:02:07,554 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:02:07,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:02:07,563 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:42, output treesize:35 [2018-04-11 10:02:07,625 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:02:07,625 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:02:07,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-04-11 10:02:07,626 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:02:07,639 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:02:07,640 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:02:07,640 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 27 treesize of output 40 [2018-04-11 10:02:07,641 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:02:07,655 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:02:07,655 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:02:07,656 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 26 treesize of output 20 [2018-04-11 10:02:07,656 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-11 10:02:07,667 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:02:07,667 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:02:07,667 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 30 treesize of output 24 [2018-04-11 10:02:07,668 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:02:07,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:02:07,676 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:59, output treesize:34 [2018-04-11 10:02:07,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 28 [2018-04-11 10:02:07,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 10:02:07,739 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:02:07,742 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:02:07,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 31 [2018-04-11 10:02:07,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-04-11 10:02:07,753 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-11 10:02:07,755 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:02:07,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 10:02:07,763 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:66, output treesize:58 [2018-04-11 10:02:07,920 WARN L148 SmtUtils]: Spent 128ms on a formula simplification that was a NOOP. DAG size: 30 [2018-04-11 10:02:08,174 WARN L148 SmtUtils]: Spent 160ms on a formula simplification that was a NOOP. DAG size: 30 [2018-04-11 10:02:09,142 WARN L148 SmtUtils]: Spent 930ms on a formula simplification that was a NOOP. DAG size: 33 [2018-04-11 10:02:09,838 WARN L148 SmtUtils]: Spent 657ms on a formula simplification that was a NOOP. DAG size: 33 [2018-04-11 10:02:10,756 WARN L148 SmtUtils]: Spent 879ms on a formula simplification that was a NOOP. DAG size: 35 [2018-04-11 10:02:11,992 WARN L148 SmtUtils]: Spent 1187ms on a formula simplification that was a NOOP. DAG size: 38 [2018-04-11 10:02:13,502 WARN L148 SmtUtils]: Spent 1467ms on a formula simplification that was a NOOP. DAG size: 38 [2018-04-11 10:02:14,129 WARN L148 SmtUtils]: Spent 570ms on a formula simplification that was a NOOP. DAG size: 41 [2018-04-11 10:02:16,169 WARN L148 SmtUtils]: Spent 1851ms on a formula simplification that was a NOOP. DAG size: 46 [2018-04-11 10:02:16,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 54 [2018-04-11 10:02:16,174 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:02:16,175 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:02:16,175 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:02:16,176 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:02:16,176 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:02:16,177 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:02:16,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 93 [2018-04-11 10:02:16,185 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 10:02:16,212 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:02:16,238 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 57 [2018-04-11 10:02:16,240 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:02:16,240 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:02:16,241 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:02:16,241 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:02:16,242 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:02:16,242 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 10:02:16,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 121 [2018-04-11 10:02:16,250 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-04-11 10:02:16,275 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:02:16,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 10:02:16,300 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:132, output treesize:140 [2018-04-11 10:02:16,777 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:02:16,795 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 10:02:16,795 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29] total 57 [2018-04-11 10:02:16,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-04-11 10:02:16,795 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-04-11 10:02:16,795 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=3124, Unknown=0, NotChecked=0, Total=3306 [2018-04-11 10:02:16,795 INFO L87 Difference]: Start difference. First operand 148 states and 158 transitions. Second operand 58 states. [2018-04-11 10:02:19,195 WARN L151 SmtUtils]: Spent 2141ms on a formula simplification. DAG size of input: 101 DAG size of output 54 [2018-04-11 10:02:19,687 WARN L151 SmtUtils]: Spent 262ms on a formula simplification. DAG size of input: 134 DAG size of output 60 [2018-04-11 10:02:21,270 WARN L151 SmtUtils]: Spent 1529ms on a formula simplification. DAG size of input: 134 DAG size of output 60 [2018-04-11 10:02:22,342 WARN L151 SmtUtils]: Spent 1006ms on a formula simplification. DAG size of input: 144 DAG size of output 62 [2018-04-11 10:02:25,208 WARN L151 SmtUtils]: Spent 2795ms on a formula simplification. DAG size of input: 148 DAG size of output 65 [2018-04-11 10:02:26,707 WARN L151 SmtUtils]: Spent 1438ms on a formula simplification. DAG size of input: 128 DAG size of output 65 [2018-04-11 10:02:28,007 WARN L151 SmtUtils]: Spent 1235ms on a formula simplification. DAG size of input: 145 DAG size of output 68 [2018-04-11 10:02:32,099 WARN L151 SmtUtils]: Spent 3717ms on a formula simplification. DAG size of input: 137 DAG size of output 73 [2018-04-11 10:02:33,612 WARN L151 SmtUtils]: Spent 1443ms on a formula simplification. DAG size of input: 153 DAG size of output 82 [2018-04-11 10:02:35,080 WARN L151 SmtUtils]: Spent 1406ms on a formula simplification. DAG size of input: 142 DAG size of output 78 [2018-04-11 10:02:35,351 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 109 DAG size of output 58 [2018-04-11 10:02:35,674 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 119 DAG size of output 85 [2018-04-11 10:02:37,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 10:02:37,123 INFO L93 Difference]: Finished difference Result 205 states and 215 transitions. [2018-04-11 10:02:37,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-04-11 10:02:37,123 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 60 [2018-04-11 10:02:37,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 10:02:37,124 INFO L225 Difference]: With dead ends: 205 [2018-04-11 10:02:37,124 INFO L226 Difference]: Without dead ends: 205 [2018-04-11 10:02:37,125 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2982 ImplicationChecksByTransitivity, 29.5s TimeCoverageRelationStatistics Valid=732, Invalid=8774, Unknown=0, NotChecked=0, Total=9506 [2018-04-11 10:02:37,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-04-11 10:02:37,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 168. [2018-04-11 10:02:37,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-11 10:02:37,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 178 transitions. [2018-04-11 10:02:37,126 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 178 transitions. Word has length 60 [2018-04-11 10:02:37,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 10:02:37,127 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 178 transitions. [2018-04-11 10:02:37,127 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-04-11 10:02:37,127 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 178 transitions. [2018-04-11 10:02:37,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-11 10:02:37,127 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 10:02:37,127 INFO L355 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 10:02:37,127 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr2RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr4RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr0RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr3RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr1RequiresViolation, __U_MULTI_fopenbsd_cstrcat_alloca_true_valid_memsafety_true_termination_i__cstrcatErr5RequiresViolation]=== [2018-04-11 10:02:37,127 INFO L82 PathProgramCache]: Analyzing trace with hash -613997010, now seen corresponding path program 6 times [2018-04-11 10:02:37,128 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-04-11 10:02:37,128 INFO L68 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-04-11 10:02:37,128 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:02:37,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 10:02:37,128 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 10:02:37,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 10:02:37,140 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 10:02:38,018 WARN L151 SmtUtils]: Spent 266ms on a formula simplification. DAG size of input: 371 DAG size of output 81 [2018-04-11 10:02:38,291 WARN L151 SmtUtils]: Spent 242ms on a formula simplification. DAG size of input: 299 DAG size of output 74 [2018-04-11 10:02:38,578 WARN L151 SmtUtils]: Spent 251ms on a formula simplification. DAG size of input: 299 DAG size of output 74 [2018-04-11 10:02:38,870 WARN L151 SmtUtils]: Spent 252ms on a formula simplification. DAG size of input: 302 DAG size of output 77 [2018-04-11 10:02:39,154 WARN L151 SmtUtils]: Spent 240ms on a formula simplification. DAG size of input: 297 DAG size of output 72 [2018-04-11 10:02:39,506 WARN L151 SmtUtils]: Spent 304ms on a formula simplification. DAG size of input: 317 DAG size of output 83 [2018-04-11 10:02:39,861 WARN L151 SmtUtils]: Spent 293ms on a formula simplification. DAG size of input: 320 DAG size of output 86 [2018-04-11 10:02:40,204 WARN L151 SmtUtils]: Spent 285ms on a formula simplification. DAG size of input: 315 DAG size of output 81 [2018-04-11 10:02:40,436 WARN L151 SmtUtils]: Spent 191ms on a formula simplification. DAG size of input: 212 DAG size of output 72 [2018-04-11 10:02:40,673 WARN L151 SmtUtils]: Spent 193ms on a formula simplification. DAG size of input: 215 DAG size of output 75 [2018-04-11 10:02:40,903 WARN L151 SmtUtils]: Spent 183ms on a formula simplification. DAG size of input: 210 DAG size of output 70 [2018-04-11 10:02:42,201 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 10:02:42,201 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 10:02:42,201 INFO L213 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-04-11 10:02:42,206 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 10:02:42,241 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2018-04-11 10:02:42,241 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 10:02:42,243 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 10:02:42,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 10:02:42,281 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 10:02:42,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:02:42,286 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-11 10:02:42,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2018-04-11 10:02:42,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-11 10:02:42,318 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 10:02:42,319 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 10:02:42,323 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 10:02:42,323 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2018-04-11 10:03:25,710 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 89 treesize of output 67 [2018-04-11 10:03:26,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 11 select indices, 11 select index equivalence classes, 19 disjoint index pairs (out of 55 index pairs), introduced 9 new quantified variables, introduced 45 case distinctions, treesize of input 67 treesize of output 453 [2018-04-11 10:03:26,009 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 45 Received shutdown request... [2018-04-11 10:03:29,459 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-11 10:03:29,460 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-11 10:03:29,462 WARN L197 ceAbstractionStarter]: Timeout [2018-04-11 10:03:29,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 10:03:29 BoogieIcfgContainer [2018-04-11 10:03:29,463 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 10:03:29,463 INFO L168 Benchmark]: Toolchain (without parser) took 201504.88 ms. Allocated memory was 402.1 MB in the beginning and 1.6 GB in the end (delta: 1.2 GB). Free memory was 334.6 MB in the beginning and 1.2 GB in the end (delta: -829.7 MB). Peak memory consumption was 1.1 GB. Max. memory is 5.3 GB. [2018-04-11 10:03:29,464 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 402.1 MB. Free memory is still 359.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 10:03:29,464 INFO L168 Benchmark]: CACSL2BoogieTranslator took 241.37 ms. Allocated memory is still 402.1 MB. Free memory was 334.6 MB in the beginning and 310.8 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. [2018-04-11 10:03:29,464 INFO L168 Benchmark]: Boogie Preprocessor took 35.08 ms. Allocated memory is still 402.1 MB. Free memory was 310.8 MB in the beginning and 308.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-11 10:03:29,464 INFO L168 Benchmark]: RCFGBuilder took 373.91 ms. Allocated memory was 402.1 MB in the beginning and 580.4 MB in the end (delta: 178.3 MB). Free memory was 308.1 MB in the beginning and 516.5 MB in the end (delta: -208.4 MB). Peak memory consumption was 25.1 MB. Max. memory is 5.3 GB. [2018-04-11 10:03:29,464 INFO L168 Benchmark]: TraceAbstraction took 200851.39 ms. Allocated memory was 580.4 MB in the beginning and 1.6 GB in the end (delta: 1.1 GB). Free memory was 516.5 MB in the beginning and 1.2 GB in the end (delta: -647.8 MB). Peak memory consumption was 1.1 GB. Max. memory is 5.3 GB. [2018-04-11 10:03:29,465 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.15 ms. Allocated memory is still 402.1 MB. Free memory is still 359.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 241.37 ms. Allocated memory is still 402.1 MB. Free memory was 334.6 MB in the beginning and 310.8 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.08 ms. Allocated memory is still 402.1 MB. Free memory was 310.8 MB in the beginning and 308.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 373.91 ms. Allocated memory was 402.1 MB in the beginning and 580.4 MB in the end (delta: 178.3 MB). Free memory was 308.1 MB in the beginning and 516.5 MB in the end (delta: -208.4 MB). Peak memory consumption was 25.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 200851.39 ms. Allocated memory was 580.4 MB in the beginning and 1.6 GB in the end (delta: 1.1 GB). Free memory was 516.5 MB in the beginning and 1.2 GB in the end (delta: -647.8 MB). Peak memory consumption was 1.1 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 565]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 12, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 45 conjuction. - TimeoutResultAtElement [Line: 564]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 12, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 45 conjuction. - TimeoutResultAtElement [Line: 565]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 565). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 12, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 45 conjuction. - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 12, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 45 conjuction. - TimeoutResultAtElement [Line: 564]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 564). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 12, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 45 conjuction. - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 12, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 45 conjuction. - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 12, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 45 conjuction. - TimeoutResultAtElement [Line: 544]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 12, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 45 conjuction. - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 12, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 45 conjuction. - TimeoutResultAtElement [Line: 544]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 544). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 12, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 45 conjuction. - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 545). Cancelled while BasicCegarLoop was analyzing trace of length 65 with TraceHistMax 12, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while DnfTransformerHelper was transforming 45 conjuction. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 56 locations, 11 error locations. TIMEOUT Result, 200.8s OverallTime, 36 OverallIterations, 12 TraceHistogramMax, 101.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1171 SDtfs, 3116 SDslu, 10993 SDs, 0 SdLazy, 13733 SolverSat, 1255 SolverUnsat, 10 SolverUnknown, 0 SolverNotchecked, 14.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1664 GetRequests, 464 SyntacticMatches, 10 SemanticMatches, 1190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20955 ImplicationChecksByTransitivity, 126.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=184occurred 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, 35 MinimizatonAttempts, 565 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 45.2s InterpolantComputationTime, 1807 NumberOfCodeBlocks, 1805 NumberOfCodeBlocksAsserted, 83 NumberOfCheckSat, 1754 ConstructedInterpolants, 188 QuantifiedInterpolants, 1681191 SizeOfPredicates, 281 NumberOfNonLiveVariables, 3341 ConjunctsInSsa, 1096 ConjunctsInUnsatCore, 53 InterpolantComputations, 18 PerfectInterpolantSequences, 22/1318 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_cstrcat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_10-03-29-469.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_10-03-29-469.csv Completed graceful shutdown