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 -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-35b68b2 [2018-04-06 19:35:31,009 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-06 19:35:31,011 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-06 19:35:31,024 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-06 19:35:31,024 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-06 19:35:31,025 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-06 19:35:31,026 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-06 19:35:31,028 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-06 19:35:31,030 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-06 19:35:31,031 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-06 19:35:31,032 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-06 19:35:31,032 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-06 19:35:31,033 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-06 19:35:31,034 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-06 19:35:31,035 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-06 19:35:31,037 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-06 19:35:31,039 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-06 19:35:31,041 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-06 19:35:31,042 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-06 19:35:31,044 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-06 19:35:31,046 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-06 19:35:31,046 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-06 19:35:31,047 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-06 19:35:31,048 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-06 19:35:31,049 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-06 19:35:31,050 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-06 19:35:31,050 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-06 19:35:31,051 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-06 19:35:31,052 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-06 19:35:31,052 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-06 19:35:31,053 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-06 19:35:31,053 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf [2018-04-06 19:35:31,103 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-06 19:35:31,103 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-06 19:35:31,104 INFO L131 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2018-04-06 19:35:31,104 INFO L133 SettingsManager]: * ultimate.logging.details=de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation=DEBUG; [2018-04-06 19:35:31,105 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-04-06 19:35:31,105 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-04-06 19:35:31,105 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-04-06 19:35:31,105 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-04-06 19:35:31,105 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-04-06 19:35:31,105 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-04-06 19:35:31,105 INFO L131 SettingsManager]: Preferences of LTL2Aut differ from their defaults: [2018-04-06 19:35:31,105 INFO L133 SettingsManager]: * Property to check=[] a a: x > 42 [2018-04-06 19:35:31,106 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-06 19:35:31,106 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-06 19:35:31,106 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-06 19:35:31,106 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-06 19:35:31,106 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-06 19:35:31,106 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-06 19:35:31,107 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-06 19:35:31,107 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-04-06 19:35:31,107 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-06 19:35:31,107 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-06 19:35:31,107 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-06 19:35:31,107 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-04-06 19:35:31,108 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-04-06 19:35:31,108 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-06 19:35:31,108 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-06 19:35:31,108 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-06 19:35:31,108 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-06 19:35:31,109 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-06 19:35:31,109 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-04-06 19:35:31,109 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-04-06 19:35:31,109 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:35:31,109 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-04-06 19:35:31,110 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-04-06 19:35:31,110 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-04-06 19:35:31,110 INFO L131 SettingsManager]: Preferences of Boogie Printer differ from their defaults: [2018-04-06 19:35:31,110 INFO L133 SettingsManager]: * Dump path:=C:\Users\alex\AppData\Local\Temp\ [2018-04-06 19:35:31,143 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-06 19:35:31,153 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-06 19:35:31,156 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-06 19:35:31,157 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-06 19:35:31,157 INFO L276 PluginConnector]: CDTParser initialized [2018-04-06 19:35:31,158 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,478 INFO L225 CDTParser]: Created temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGab5458185 [2018-04-06 19:35:31,651 INFO L287 CDTParser]: IsIndexed: true [2018-04-06 19:35:31,651 INFO L288 CDTParser]: Found 1 translation units. [2018-04-06 19:35:31,652 INFO L168 CDTParser]: Scanning openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,663 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-06 19:35:31,663 INFO L215 ultiparseSymbolTable]: [2018-04-06 19:35:31,663 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-06 19:35:31,664 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____bswap_64 ('__bswap_64') in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,664 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpy ('cstrlcpy') in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,664 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____bswap_32 ('__bswap_32') in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,664 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,664 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-06 19:35:31,664 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____ssize_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,664 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____mode_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,665 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__fsfilcnt_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,665 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____intptr_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,665 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____socklen_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,665 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__pid_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,665 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__int32_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,665 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__ino_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,665 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____fsfilcnt64_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,665 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____timer_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,665 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__size_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,665 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__key_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,665 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____nlink_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,665 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__off_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,666 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____int8_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,666 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__timer_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,666 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__caddr_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,666 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__mode_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,666 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__div_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,666 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____u_short in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,666 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____uint64_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,666 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__gid_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,666 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____blkcnt64_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,666 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____uid_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,666 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____fsword_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,666 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__ssize_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,667 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__u_short in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,667 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____qaddr_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,667 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____dev_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,667 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____fsblkcnt_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,667 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____int64_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,667 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____useconds_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,667 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__id_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,667 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__pthread_condattr_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,667 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____blksize_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,667 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____caddr_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,667 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__fd_set in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,667 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____u_int in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,667 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__dev_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,667 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__time_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,668 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__pthread_rwlock_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,668 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__pthread_key_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,668 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__fsid_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,668 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__register_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,668 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____clock_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,668 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____daddr_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,668 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__pthread_barrierattr_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,668 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__int64_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,668 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__pthread_mutex_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,668 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__u_quad_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,668 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__ushort in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,668 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__ldiv_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,669 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____rlim64_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,669 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____fsfilcnt_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,669 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__u_int64_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,669 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____key_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,669 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____uint8_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,669 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__loff_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,669 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____time_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,669 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__int8_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,669 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____quad_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,670 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____off_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,670 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____fsid_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,670 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__u_long in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,670 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__clock_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,670 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__pthread_barrier_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,670 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____uint16_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,670 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____gid_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,670 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____WAIT_STATUS in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,670 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____syscall_slong_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,671 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__pthread_cond_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,671 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__u_char in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,671 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____loff_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,671 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__daddr_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,671 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__quad_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,671 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__blkcnt_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,671 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__sigset_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,671 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__u_int16_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,671 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____blkcnt_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,671 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__ulong in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,672 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__suseconds_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,672 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____u_long in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,672 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____int16_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,672 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__fd_mask in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,672 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__pthread_spinlock_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,672 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__pthread_rwlockattr_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,672 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____ino_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,672 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____sigset_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,672 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__uint in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,672 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____ino64_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,673 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____fd_mask in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,673 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__nlink_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,673 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__blksize_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,673 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__lldiv_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,673 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____id_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,673 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__pthread_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,673 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____syscall_ulong_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,673 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__int16_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,673 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____uint32_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,674 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__pthread_attr_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,674 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__wchar_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,674 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__u_int8_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,674 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__pthread_once_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,674 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____sig_atomic_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,674 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__uid_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,674 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____clockid_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,674 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__clockid_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,675 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__u_int32_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,675 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__u_int in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,675 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____int32_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,675 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____pthread_list_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,675 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__fsblkcnt_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,675 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____rlim_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,675 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____pid_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,675 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____u_quad_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,675 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__pthread_mutexattr_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,676 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____fsblkcnt64_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,676 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____u_char in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,676 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____off64_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,676 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____suseconds_t in openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:31,702 INFO L330 CDTParser]: Deleted temporary CDT project at /storage/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGab5458185 [2018-04-06 19:35:31,706 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-06 19:35:31,707 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-06 19:35:31,708 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-06 19:35:31,708 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-06 19:35:31,713 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-06 19:35:31,714 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 07:35:31" (1/1) ... [2018-04-06 19:35:31,716 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18933a7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 07:35:31, skipping insertion in model container [2018-04-06 19:35:31,716 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 07:35:31" (1/1) ... [2018-04-06 19:35:31,729 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-06 19:35:31,759 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-06 19:35:31,922 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-06 19:35:31,972 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-06 19:35:31,980 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-06 19:35:32,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 07:35:32 WrapperNode [2018-04-06 19:35:32,035 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-06 19:35:32,036 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-06 19:35:32,036 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-06 19:35:32,036 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-06 19:35:32,052 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 07:35:32" (1/1) ... [2018-04-06 19:35:32,052 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 07:35:32" (1/1) ... [2018-04-06 19:35:32,068 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 07:35:32" (1/1) ... [2018-04-06 19:35:32,068 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 07:35:32" (1/1) ... [2018-04-06 19:35:32,082 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 07:35:32" (1/1) ... [2018-04-06 19:35:32,088 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 07:35:32" (1/1) ... [2018-04-06 19:35:32,091 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 07:35:32" (1/1) ... [2018-04-06 19:35:32,095 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-06 19:35:32,096 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-06 19:35:32,096 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-06 19:35:32,096 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-06 19:35:32,097 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 07:35:32" (1/1) ... No working directory specified, using /storage/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-06 19:35:32,219 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-06 19:35:32,219 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-06 19:35:32,219 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-06 19:35:32,219 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-06 19:35:32,219 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpy [2018-04-06 19:35:32,219 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-06 19:35:32,220 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-06 19:35:32,220 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-06 19:35:32,220 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-06 19:35:32,220 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-06 19:35:32,220 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-06 19:35:32,220 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-06 19:35:32,220 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-06 19:35:32,220 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-06 19:35:32,220 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-06 19:35:32,221 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-06 19:35:32,221 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-06 19:35:32,221 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-06 19:35:32,221 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-06 19:35:32,221 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-06 19:35:32,221 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-06 19:35:32,221 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-06 19:35:32,221 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-06 19:35:32,221 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-06 19:35:32,221 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-06 19:35:32,222 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-06 19:35:32,222 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-06 19:35:32,222 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-06 19:35:32,222 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-06 19:35:32,222 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-06 19:35:32,222 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-06 19:35:32,222 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-06 19:35:32,222 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-06 19:35:32,222 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-06 19:35:32,222 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-06 19:35:32,223 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-06 19:35:32,223 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-06 19:35:32,223 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-06 19:35:32,223 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-06 19:35:32,223 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-06 19:35:32,223 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-06 19:35:32,223 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-06 19:35:32,224 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-06 19:35:32,224 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-06 19:35:32,224 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-06 19:35:32,224 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-06 19:35:32,224 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-06 19:35:32,224 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-06 19:35:32,224 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-06 19:35:32,225 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-06 19:35:32,225 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-06 19:35:32,225 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-06 19:35:32,225 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-06 19:35:32,225 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-06 19:35:32,225 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-06 19:35:32,225 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-06 19:35:32,225 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-06 19:35:32,226 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-06 19:35:32,226 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-06 19:35:32,226 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-06 19:35:32,226 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-06 19:35:32,226 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-06 19:35:32,226 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-06 19:35:32,226 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-06 19:35:32,226 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-06 19:35:32,227 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-06 19:35:32,227 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-06 19:35:32,227 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-06 19:35:32,227 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-06 19:35:32,227 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-06 19:35:32,227 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-06 19:35:32,227 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-06 19:35:32,227 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-06 19:35:32,228 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-06 19:35:32,228 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-06 19:35:32,228 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-06 19:35:32,228 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-06 19:35:32,228 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-06 19:35:32,228 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-06 19:35:32,228 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-06 19:35:32,228 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-06 19:35:32,228 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-06 19:35:32,229 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-06 19:35:32,229 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-06 19:35:32,229 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-06 19:35:32,229 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-06 19:35:32,229 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-06 19:35:32,229 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-06 19:35:32,229 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-06 19:35:32,230 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-06 19:35:32,230 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-06 19:35:32,230 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-06 19:35:32,230 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-06 19:35:32,230 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-06 19:35:32,230 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-06 19:35:32,230 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-06 19:35:32,230 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-06 19:35:32,231 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-06 19:35:32,231 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-06 19:35:32,231 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-06 19:35:32,231 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-06 19:35:32,231 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-06 19:35:32,231 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-06 19:35:32,231 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-06 19:35:32,232 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-06 19:35:32,232 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-06 19:35:32,232 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-06 19:35:32,232 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-06 19:35:32,232 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-06 19:35:32,232 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpy [2018-04-06 19:35:32,232 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-06 19:35:32,232 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-06 19:35:32,233 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-06 19:35:32,233 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-06 19:35:32,233 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-06 19:35:32,233 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-06 19:35:32,233 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-06 19:35:32,233 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-06 19:35:32,677 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-06 19:35:32,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 07:35:32 BoogieIcfgContainer [2018-04-06 19:35:32,678 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-06 19:35:32,679 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-06 19:35:32,679 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-06 19:35:32,681 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-06 19:35:32,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.04 07:35:31" (1/3) ... [2018-04-06 19:35:32,682 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70437fd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 07:35:32, skipping insertion in model container [2018-04-06 19:35:32,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 07:35:32" (2/3) ... [2018-04-06 19:35:32,682 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70437fd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 07:35:32, skipping insertion in model container [2018-04-06 19:35:32,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 07:35:32" (3/3) ... [2018-04-06 19:35:32,684 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-06 19:35:32,690 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-06 19:35:32,696 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-04-06 19:35:32,732 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-06 19:35:32,733 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-06 19:35:32,733 INFO L370 AbstractCegarLoop]: Hoare is true [2018-04-06 19:35:32,733 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-06 19:35:32,733 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-06 19:35:32,733 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-06 19:35:32,733 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-06 19:35:32,733 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-06 19:35:32,734 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-06 19:35:32,734 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-06 19:35:32,751 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2018-04-06 19:35:32,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-06 19:35:32,756 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:35:32,756 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:35:32,757 INFO L408 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:35:32,762 INFO L82 PathProgramCache]: Analyzing trace with hash -156373956, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:35:32,773 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:35:32,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:35:32,812 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:35:32,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:35:32,850 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:35:32,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:35:32,855 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-06 19:35:32,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-06 19:35:32,885 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:35:32,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-06 19:35:32,891 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-06 19:35:32,903 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-06 19:35:32,904 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:35:32,946 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-06 19:35:32,971 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:35:32,971 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-06 19:35:32,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-06 19:35:32,984 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-06 19:35:32,984 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-06 19:35:32,986 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 4 states. [2018-04-06 19:35:33,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:35:33,073 INFO L93 Difference]: Finished difference Result 117 states and 129 transitions. [2018-04-06 19:35:33,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-06 19:35:33,074 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-04-06 19:35:33,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:35:33,083 INFO L225 Difference]: With dead ends: 117 [2018-04-06 19:35:33,083 INFO L226 Difference]: Without dead ends: 83 [2018-04-06 19:35:33,087 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-06 19:35:33,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-04-06 19:35:33,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-04-06 19:35:33,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-04-06 19:35:33,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2018-04-06 19:35:33,126 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 19 [2018-04-06 19:35:33,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:35:33,127 INFO L459 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2018-04-06 19:35:33,127 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-06 19:35:33,127 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2018-04-06 19:35:33,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-06 19:35:33,128 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:35:33,128 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:35:33,128 INFO L408 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:35:33,129 INFO L82 PathProgramCache]: Analyzing trace with hash -156373955, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:35:33,135 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:35:33,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:35:33,151 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:35:33,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:35:33,176 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:35:33,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:35:33,184 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:35:33,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:35:33,199 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-06 19:35:33,253 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:35:33,255 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-06 19:35:33,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:35:33,283 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:35:33,284 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:35:33,285 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-06 19:35:33,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:35:33,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:35:33,302 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-06 19:35:33,348 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-06 19:35:33,349 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:35:33,637 WARN L148 SmtUtils]: Spent 180ms on a formula simplification that was a NOOP. DAG size: 26 [2018-04-06 19:35:33,648 INFO L267 ElimStorePlain]: Start of recursive call 1: End of recursive call: and 1 xjuncts. [2018-04-06 19:35:33,648 INFO L202 ElimStorePlain]: Needed 1 recursive calls to eliminate 5 variables, input treesize:25, output treesize:3 [2018-04-06 19:35:33,655 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-06 19:35:33,678 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:35:33,679 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2018-04-06 19:35:33,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-06 19:35:33,680 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-06 19:35:33,680 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-04-06 19:35:33,680 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand 9 states. [2018-04-06 19:35:33,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:35:33,923 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2018-04-06 19:35:33,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-06 19:35:33,924 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-04-06 19:35:33,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:35:33,925 INFO L225 Difference]: With dead ends: 83 [2018-04-06 19:35:33,926 INFO L226 Difference]: Without dead ends: 82 [2018-04-06 19:35:33,927 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-04-06 19:35:33,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-04-06 19:35:33,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-04-06 19:35:33,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-04-06 19:35:33,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2018-04-06 19:35:33,936 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 19 [2018-04-06 19:35:33,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:35:33,937 INFO L459 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2018-04-06 19:35:33,937 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-06 19:35:33,937 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2018-04-06 19:35:33,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-06 19:35:33,938 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:35:33,938 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-06 19:35:33,938 INFO L408 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:35:33,938 INFO L82 PathProgramCache]: Analyzing trace with hash -552625248, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:35:33,951 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:35:33,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:35:33,968 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:35:33,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:35:33,983 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:35:33,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:35:33,986 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-06 19:35:33,994 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-06 19:35:33,994 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:35:34,012 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-06 19:35:34,041 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:35:34,041 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2018-04-06 19:35:34,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-06 19:35:34,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-06 19:35:34,041 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-06 19:35:34,042 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand 4 states. [2018-04-06 19:35:34,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:35:34,083 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2018-04-06 19:35:34,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-06 19:35:34,083 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-04-06 19:35:34,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:35:34,084 INFO L225 Difference]: With dead ends: 82 [2018-04-06 19:35:34,084 INFO L226 Difference]: Without dead ends: 81 [2018-04-06 19:35:34,085 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 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-06 19:35:34,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-04-06 19:35:34,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-04-06 19:35:34,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-04-06 19:35:34,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2018-04-06 19:35:34,090 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 20 [2018-04-06 19:35:34,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:35:34,090 INFO L459 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2018-04-06 19:35:34,090 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-06 19:35:34,090 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2018-04-06 19:35:34,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-04-06 19:35:34,091 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:35:34,091 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-06 19:35:34,091 INFO L408 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:35:34,091 INFO L82 PathProgramCache]: Analyzing trace with hash -552625247, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:35:34,098 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:35:34,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:35:34,111 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:35:34,142 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:35:34,143 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:35:34,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:35:34,146 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-06 19:35:34,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:35:34,160 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:35:34,188 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-06 19:35:34,210 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:35:34,210 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2018-04-06 19:35:34,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-06 19:35:34,210 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-06 19:35:34,210 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-04-06 19:35:34,211 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand 7 states. [2018-04-06 19:35:34,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:35:34,282 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2018-04-06 19:35:34,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-06 19:35:34,282 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-04-06 19:35:34,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:35:34,284 INFO L225 Difference]: With dead ends: 81 [2018-04-06 19:35:34,284 INFO L226 Difference]: Without dead ends: 80 [2018-04-06 19:35:34,284 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-04-06 19:35:34,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-04-06 19:35:34,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-04-06 19:35:34,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-04-06 19:35:34,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2018-04-06 19:35:34,291 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 20 [2018-04-06 19:35:34,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:35:34,292 INFO L459 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2018-04-06 19:35:34,292 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-06 19:35:34,292 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2018-04-06 19:35:34,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-06 19:35:34,293 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:35:34,293 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:35:34,293 INFO L408 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:35:34,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1883922487, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:35:34,300 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:35:34,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:35:34,319 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:35:34,335 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-06 19:35:34,335 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:35:34,341 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-06 19:35:34,362 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:35:34,362 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2018-04-06 19:35:34,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-06 19:35:34,363 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-06 19:35:34,363 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-06 19:35:34,363 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand 6 states. [2018-04-06 19:35:34,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:35:34,491 INFO L93 Difference]: Finished difference Result 107 states and 118 transitions. [2018-04-06 19:35:34,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-06 19:35:34,491 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-04-06 19:35:34,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:35:34,496 INFO L225 Difference]: With dead ends: 107 [2018-04-06 19:35:34,496 INFO L226 Difference]: Without dead ends: 106 [2018-04-06 19:35:34,505 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 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-06 19:35:34,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-04-06 19:35:34,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 88. [2018-04-06 19:35:34,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-04-06 19:35:34,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 99 transitions. [2018-04-06 19:35:34,515 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 99 transitions. Word has length 31 [2018-04-06 19:35:34,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:35:34,515 INFO L459 AbstractCegarLoop]: Abstraction has 88 states and 99 transitions. [2018-04-06 19:35:34,515 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-06 19:35:34,516 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 99 transitions. [2018-04-06 19:35:34,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-06 19:35:34,516 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:35:34,517 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:35:34,517 INFO L408 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:35:34,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1883922488, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:35:34,526 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:35:34,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:35:34,547 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:35:34,559 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-06 19:35:34,559 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:35:34,571 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-06 19:35:34,592 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:35:34,592 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2018-04-06 19:35:34,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-06 19:35:34,593 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-06 19:35:34,593 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-06 19:35:34,593 INFO L87 Difference]: Start difference. First operand 88 states and 99 transitions. Second operand 5 states. [2018-04-06 19:35:34,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:35:34,624 INFO L93 Difference]: Finished difference Result 145 states and 160 transitions. [2018-04-06 19:35:34,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-06 19:35:34,625 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-04-06 19:35:34,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:35:34,626 INFO L225 Difference]: With dead ends: 145 [2018-04-06 19:35:34,626 INFO L226 Difference]: Without dead ends: 121 [2018-04-06 19:35:34,626 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-04-06 19:35:34,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-04-06 19:35:34,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 90. [2018-04-06 19:35:34,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-04-06 19:35:34,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 101 transitions. [2018-04-06 19:35:34,635 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 101 transitions. Word has length 31 [2018-04-06 19:35:34,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:35:34,635 INFO L459 AbstractCegarLoop]: Abstraction has 90 states and 101 transitions. [2018-04-06 19:35:34,636 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-06 19:35:34,636 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 101 transitions. [2018-04-06 19:35:34,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-06 19:35:34,637 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:35:34,637 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] [2018-04-06 19:35:34,637 INFO L408 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:35:34,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1602049071, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:35:34,644 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:35:34,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:35:34,667 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:35:34,690 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-06 19:35:34,690 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:35:34,694 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-06 19:35:34,723 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:35:34,723 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2018-04-06 19:35:34,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-06 19:35:34,724 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-06 19:35:34,724 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-06 19:35:34,724 INFO L87 Difference]: Start difference. First operand 90 states and 101 transitions. Second operand 7 states. [2018-04-06 19:35:34,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:35:34,827 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2018-04-06 19:35:34,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-06 19:35:34,827 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-04-06 19:35:34,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:35:34,828 INFO L225 Difference]: With dead ends: 110 [2018-04-06 19:35:34,828 INFO L226 Difference]: Without dead ends: 109 [2018-04-06 19:35:34,829 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-04-06 19:35:34,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-04-06 19:35:34,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 97. [2018-04-06 19:35:34,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-04-06 19:35:34,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2018-04-06 19:35:34,835 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 34 [2018-04-06 19:35:34,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:35:34,835 INFO L459 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2018-04-06 19:35:34,835 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-06 19:35:34,835 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2018-04-06 19:35:34,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-06 19:35:34,836 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:35:34,836 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] [2018-04-06 19:35:34,836 INFO L408 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:35:34,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1602049072, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:35:34,843 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:35:34,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:35:34,863 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:35:34,921 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-06 19:35:34,921 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:35:34,929 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-04-06 19:35:34,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:35:34,938 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-04-06 19:35:34,939 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:35:34,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:35:34,942 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-04-06 19:35:34,952 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-06 19:35:34,975 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:35:34,975 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 9 [2018-04-06 19:35:34,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-06 19:35:34,976 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-06 19:35:34,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-04-06 19:35:34,976 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand 10 states. [2018-04-06 19:35:35,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:35:35,134 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2018-04-06 19:35:35,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-06 19:35:35,134 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-04-06 19:35:35,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:35:35,135 INFO L225 Difference]: With dead ends: 111 [2018-04-06 19:35:35,135 INFO L226 Difference]: Without dead ends: 110 [2018-04-06 19:35:35,135 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-04-06 19:35:35,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-04-06 19:35:35,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 101. [2018-04-06 19:35:35,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-04-06 19:35:35,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2018-04-06 19:35:35,143 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 34 [2018-04-06 19:35:35,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:35:35,143 INFO L459 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2018-04-06 19:35:35,144 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-06 19:35:35,144 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2018-04-06 19:35:35,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-04-06 19:35:35,145 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:35:35,145 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:35:35,145 INFO L408 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:35:35,145 INFO L82 PathProgramCache]: Analyzing trace with hash 937564900, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:35:35,151 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:35:35,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:35:35,168 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:35:35,216 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-06 19:35:35,216 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:35:35,224 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-04-06 19:35:35,225 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:35:35,230 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-04-06 19:35:35,231 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:35:35,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:35:35,233 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-04-06 19:35:35,244 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-06 19:35:35,265 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:35:35,265 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 8 [2018-04-06 19:35:35,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-06 19:35:35,265 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-06 19:35:35,265 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-04-06 19:35:35,266 INFO L87 Difference]: Start difference. First operand 101 states and 114 transitions. Second operand 9 states. [2018-04-06 19:35:35,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:35:35,377 INFO L93 Difference]: Finished difference Result 119 states and 132 transitions. [2018-04-06 19:35:35,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-06 19:35:35,377 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-04-06 19:35:35,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:35:35,378 INFO L225 Difference]: With dead ends: 119 [2018-04-06 19:35:35,379 INFO L226 Difference]: Without dead ends: 118 [2018-04-06 19:35:35,379 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-04-06 19:35:35,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-04-06 19:35:35,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 101. [2018-04-06 19:35:35,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-04-06 19:35:35,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2018-04-06 19:35:35,385 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 36 [2018-04-06 19:35:35,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:35:35,386 INFO L459 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2018-04-06 19:35:35,386 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-06 19:35:35,386 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2018-04-06 19:35:35,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-06 19:35:35,387 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:35:35,387 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:35:35,388 INFO L408 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:35:35,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1777398855, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:35:35,398 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:35:35,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:35:35,417 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:35:35,462 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-06 19:35:35,462 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:35:35,468 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-06 19:35:35,489 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:35:35,489 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2018-04-06 19:35:35,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-06 19:35:35,489 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-06 19:35:35,490 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-06 19:35:35,490 INFO L87 Difference]: Start difference. First operand 101 states and 113 transitions. Second operand 7 states. [2018-04-06 19:35:35,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:35:35,589 INFO L93 Difference]: Finished difference Result 107 states and 119 transitions. [2018-04-06 19:35:35,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-06 19:35:35,590 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-04-06 19:35:35,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:35:35,591 INFO L225 Difference]: With dead ends: 107 [2018-04-06 19:35:35,591 INFO L226 Difference]: Without dead ends: 106 [2018-04-06 19:35:35,592 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-04-06 19:35:35,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-04-06 19:35:35,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 100. [2018-04-06 19:35:35,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-04-06 19:35:35,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 112 transitions. [2018-04-06 19:35:35,598 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 112 transitions. Word has length 38 [2018-04-06 19:35:35,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:35:35,599 INFO L459 AbstractCegarLoop]: Abstraction has 100 states and 112 transitions. [2018-04-06 19:35:35,599 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-06 19:35:35,599 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 112 transitions. [2018-04-06 19:35:35,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-06 19:35:35,600 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:35:35,600 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:35:35,600 INFO L408 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:35:35,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1777398856, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:35:35,613 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:35:35,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:35:35,638 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:35:35,718 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-06 19:35:35,718 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:35:35,727 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-04-06 19:35:35,728 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:35:35,734 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-04-06 19:35:35,735 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:35:35,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:35:35,738 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-04-06 19:35:35,753 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-06 19:35:35,774 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:35:35,775 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 9 [2018-04-06 19:35:35,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-06 19:35:35,775 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-06 19:35:35,775 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-04-06 19:35:35,776 INFO L87 Difference]: Start difference. First operand 100 states and 112 transitions. Second operand 10 states. [2018-04-06 19:35:35,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:35:35,978 INFO L93 Difference]: Finished difference Result 110 states and 122 transitions. [2018-04-06 19:35:35,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-06 19:35:35,978 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-04-06 19:35:35,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:35:35,979 INFO L225 Difference]: With dead ends: 110 [2018-04-06 19:35:35,979 INFO L226 Difference]: Without dead ends: 109 [2018-04-06 19:35:35,980 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-04-06 19:35:35,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-04-06 19:35:35,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2018-04-06 19:35:35,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-04-06 19:35:35,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 118 transitions. [2018-04-06 19:35:35,985 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 118 transitions. Word has length 38 [2018-04-06 19:35:35,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:35:35,986 INFO L459 AbstractCegarLoop]: Abstraction has 106 states and 118 transitions. [2018-04-06 19:35:35,986 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-06 19:35:35,986 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 118 transitions. [2018-04-06 19:35:35,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-06 19:35:35,987 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:35:35,988 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:35:35,988 INFO L408 AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:35:35,988 INFO L82 PathProgramCache]: Analyzing trace with hash -735210339, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:35:35,998 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:35:36,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:35:36,026 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:35:36,053 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-06 19:35:36,053 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:35:36,058 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-06 19:35:36,080 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:35:36,080 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2018-04-06 19:35:36,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-06 19:35:36,080 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-06 19:35:36,081 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-06 19:35:36,081 INFO L87 Difference]: Start difference. First operand 106 states and 118 transitions. Second operand 7 states. [2018-04-06 19:35:36,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:35:36,220 INFO L93 Difference]: Finished difference Result 106 states and 118 transitions. [2018-04-06 19:35:36,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-06 19:35:36,220 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-04-06 19:35:36,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:35:36,221 INFO L225 Difference]: With dead ends: 106 [2018-04-06 19:35:36,221 INFO L226 Difference]: Without dead ends: 104 [2018-04-06 19:35:36,222 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-04-06 19:35:36,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-04-06 19:35:36,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-04-06 19:35:36,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-04-06 19:35:36,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 116 transitions. [2018-04-06 19:35:36,227 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 116 transitions. Word has length 39 [2018-04-06 19:35:36,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:35:36,227 INFO L459 AbstractCegarLoop]: Abstraction has 104 states and 116 transitions. [2018-04-06 19:35:36,227 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-06 19:35:36,227 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2018-04-06 19:35:36,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-06 19:35:36,228 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:35:36,228 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:35:36,228 INFO L408 AbstractCegarLoop]: === Iteration 13 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:35:36,228 INFO L82 PathProgramCache]: Analyzing trace with hash -735210338, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:35:36,236 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:35:36,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:35:36,256 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:35:36,327 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-06 19:35:36,327 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:35:36,337 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-04-06 19:35:36,338 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:35:36,347 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 10 [2018-04-06 19:35:36,348 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:35:36,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:35:36,364 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:29, output treesize:7 [2018-04-06 19:35:36,393 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-06 19:35:36,414 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:35:36,414 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 9 [2018-04-06 19:35:36,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-06 19:35:36,415 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-06 19:35:36,415 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-04-06 19:35:36,415 INFO L87 Difference]: Start difference. First operand 104 states and 116 transitions. Second operand 10 states. [2018-04-06 19:35:36,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:35:36,651 INFO L93 Difference]: Finished difference Result 120 states and 133 transitions. [2018-04-06 19:35:36,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-06 19:35:36,651 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-04-06 19:35:36,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:35:36,652 INFO L225 Difference]: With dead ends: 120 [2018-04-06 19:35:36,652 INFO L226 Difference]: Without dead ends: 119 [2018-04-06 19:35:36,652 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-04-06 19:35:36,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-04-06 19:35:36,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 105. [2018-04-06 19:35:36,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-04-06 19:35:36,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2018-04-06 19:35:36,657 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 39 [2018-04-06 19:35:36,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:35:36,657 INFO L459 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2018-04-06 19:35:36,657 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-06 19:35:36,657 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2018-04-06 19:35:36,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-04-06 19:35:36,658 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:35:36,658 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:35:36,658 INFO L408 AbstractCegarLoop]: === Iteration 14 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:35:36,659 INFO L82 PathProgramCache]: Analyzing trace with hash -2071333303, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:35:36,666 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:35:36,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:35:36,690 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:35:36,703 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-06 19:35:36,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-06 19:35:36,705 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:35:36,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:35:36,712 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-06 19:35:36,712 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-04-06 19:35:36,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-04-06 19:35:36,833 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-06 19:35:36,834 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-06 19:35:36,837 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:35:36,846 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-06 19:35:36,847 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-04-06 19:35:36,902 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:35:36,902 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:35:37,108 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-04-06 19:35:37,109 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:35:37,115 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 13 treesize of output 11 [2018-04-06 19:35:37,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-06 19:35:37,123 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 19:35:37,127 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:35:37,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:35:37,132 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-04-06 19:35:37,139 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:35:37,159 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:35:37,160 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-04-06 19:35:37,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-06 19:35:37,160 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-06 19:35:37,160 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2018-04-06 19:35:37,160 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand 21 states. [2018-04-06 19:35:40,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:35:40,008 INFO L93 Difference]: Finished difference Result 135 states and 147 transitions. [2018-04-06 19:35:40,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-06 19:35:40,009 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 41 [2018-04-06 19:35:40,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:35:40,010 INFO L225 Difference]: With dead ends: 135 [2018-04-06 19:35:40,010 INFO L226 Difference]: Without dead ends: 134 [2018-04-06 19:35:40,011 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=251, Invalid=1155, Unknown=0, NotChecked=0, Total=1406 [2018-04-06 19:35:40,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-04-06 19:35:40,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 112. [2018-04-06 19:35:40,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-04-06 19:35:40,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 125 transitions. [2018-04-06 19:35:40,015 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 125 transitions. Word has length 41 [2018-04-06 19:35:40,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:35:40,015 INFO L459 AbstractCegarLoop]: Abstraction has 112 states and 125 transitions. [2018-04-06 19:35:40,015 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-06 19:35:40,015 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 125 transitions. [2018-04-06 19:35:40,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-06 19:35:40,016 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:35:40,016 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:35:40,016 INFO L408 AbstractCegarLoop]: === Iteration 15 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:35:40,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1148291530, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:35:40,022 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:35:40,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:35:40,041 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:35:40,121 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:35:40,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-04-06 19:35:40,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-06 19:35:40,128 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:35:40,131 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:35:40,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-06 19:35:40,136 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-06 19:35:40,182 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true [2018-04-06 19:35:40,189 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true [2018-04-06 19:35:40,204 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-06 19:35:40,205 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:35:40,243 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_15| Int)) (or (= |c_old(#valid)| (store (store (store |c_#valid| |v_main_#t~malloc11.base_15| 1) |c_main_#t~malloc10.base| 0) |v_main_#t~malloc11.base_15| 0)) (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_15|))))) is different from false [2018-04-06 19:35:40,247 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc10.base_14| Int) (|v_main_#t~malloc11.base_15| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_14| 1))) (or (= (store (store (store .cse0 |v_main_#t~malloc11.base_15| 1) |v_main_#t~malloc10.base_14| 0) |v_main_#t~malloc11.base_15| 0) |c_old(#valid)|) (not (= (select .cse0 |v_main_#t~malloc11.base_15|) 0)) (not (= 0 (select |c_#valid| |v_main_#t~malloc10.base_14|)))))) is different from false [2018-04-06 19:35:40,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:35:40,307 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:35:40,307 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-06 19:35:40,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-06 19:35:40,308 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-06 19:35:40,308 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-06 19:35:40,308 INFO L87 Difference]: Start difference. First operand 112 states and 125 transitions. Second operand 12 states. [2018-04-06 19:35:40,333 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_main_#t~malloc10.base_14| Int) (|v_main_#t~malloc11.base_15| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_14| 1))) (or (= (store (store (store .cse0 |v_main_#t~malloc11.base_15| 1) |v_main_#t~malloc10.base_14| 0) |v_main_#t~malloc11.base_15| 0) |c_old(#valid)|) (not (= (select .cse0 |v_main_#t~malloc11.base_15|) 0)) (not (= 0 (select |c_#valid| |v_main_#t~malloc10.base_14|))))))) is different from false [2018-04-06 19:35:40,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:35:40,636 INFO L93 Difference]: Finished difference Result 209 states and 234 transitions. [2018-04-06 19:35:40,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-06 19:35:40,636 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 44 [2018-04-06 19:35:40,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:35:40,637 INFO L225 Difference]: With dead ends: 209 [2018-04-06 19:35:40,637 INFO L226 Difference]: Without dead ends: 196 [2018-04-06 19:35:40,638 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-04-06 19:35:40,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-04-06 19:35:40,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 191. [2018-04-06 19:35:40,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-04-06 19:35:40,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 217 transitions. [2018-04-06 19:35:40,649 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 217 transitions. Word has length 44 [2018-04-06 19:35:40,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:35:40,649 INFO L459 AbstractCegarLoop]: Abstraction has 191 states and 217 transitions. [2018-04-06 19:35:40,649 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-06 19:35:40,649 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 217 transitions. [2018-04-06 19:35:40,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-06 19:35:40,650 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:35:40,650 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:35:40,650 INFO L408 AbstractCegarLoop]: === Iteration 16 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:35:40,650 INFO L82 PathProgramCache]: Analyzing trace with hash -733054375, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:35:40,656 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:35:40,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:35:40,672 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:35:40,693 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:35:40,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-06 19:35:40,696 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:35:40,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-06 19:35:40,697 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:35:40,701 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:35:40,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-06 19:35:40,704 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-06 19:35:40,729 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true [2018-04-06 19:35:40,732 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true [2018-04-06 19:35:40,737 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-06 19:35:40,737 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:35:40,755 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_17| Int)) (or (= (store (store (store |c_#valid| |v_main_#t~malloc11.base_17| 1) |c_main_#t~malloc10.base| 0) |v_main_#t~malloc11.base_17| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_17|))))) is different from false [2018-04-06 19:35:40,758 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc10.base_16| Int) (|v_main_#t~malloc11.base_17| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_16| 1))) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc10.base_16|))) (not (= (select .cse0 |v_main_#t~malloc11.base_17|) 0)) (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc11.base_17| 1) |v_main_#t~malloc10.base_16| 0) |v_main_#t~malloc11.base_17| 0))))) is different from false [2018-04-06 19:35:40,773 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-06 19:35:40,793 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:35:40,794 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-06 19:35:40,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-06 19:35:40,794 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-06 19:35:40,794 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-06 19:35:40,794 INFO L87 Difference]: Start difference. First operand 191 states and 217 transitions. Second operand 12 states. [2018-04-06 19:35:40,802 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_main_#t~malloc10.base_16| Int) (|v_main_#t~malloc11.base_17| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_16| 1))) (or (not (= 0 (select |c_#valid| |v_main_#t~malloc10.base_16|))) (not (= (select .cse0 |v_main_#t~malloc11.base_17|) 0)) (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc11.base_17| 1) |v_main_#t~malloc10.base_16| 0) |v_main_#t~malloc11.base_17| 0)))))) is different from false [2018-04-06 19:35:41,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:35:41,193 INFO L93 Difference]: Finished difference Result 287 states and 324 transitions. [2018-04-06 19:35:41,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-06 19:35:41,193 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2018-04-06 19:35:41,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:35:41,194 INFO L225 Difference]: With dead ends: 287 [2018-04-06 19:35:41,195 INFO L226 Difference]: Without dead ends: 274 [2018-04-06 19:35:41,195 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-04-06 19:35:41,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-04-06 19:35:41,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 190. [2018-04-06 19:35:41,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-04-06 19:35:41,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 215 transitions. [2018-04-06 19:35:41,208 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 215 transitions. Word has length 45 [2018-04-06 19:35:41,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:35:41,208 INFO L459 AbstractCegarLoop]: Abstraction has 190 states and 215 transitions. [2018-04-06 19:35:41,208 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-06 19:35:41,208 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 215 transitions. [2018-04-06 19:35:41,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-04-06 19:35:41,209 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:35:41,209 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 19:35:41,209 INFO L408 AbstractCegarLoop]: === Iteration 17 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:35:41,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1428528404, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:35:41,220 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:35:41,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:35:41,236 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:35:41,266 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-06 19:35:41,266 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:35:41,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-06 19:35:41,329 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:35:41,330 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 5] imperfect sequences [] total 11 [2018-04-06 19:35:41,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-06 19:35:41,330 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-06 19:35:41,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-04-06 19:35:41,330 INFO L87 Difference]: Start difference. First operand 190 states and 215 transitions. Second operand 11 states. [2018-04-06 19:35:41,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:35:41,548 INFO L93 Difference]: Finished difference Result 293 states and 323 transitions. [2018-04-06 19:35:41,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-06 19:35:41,549 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 45 [2018-04-06 19:35:41,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:35:41,550 INFO L225 Difference]: With dead ends: 293 [2018-04-06 19:35:41,550 INFO L226 Difference]: Without dead ends: 238 [2018-04-06 19:35:41,550 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2018-04-06 19:35:41,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-04-06 19:35:41,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 189. [2018-04-06 19:35:41,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-04-06 19:35:41,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 211 transitions. [2018-04-06 19:35:41,561 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 211 transitions. Word has length 45 [2018-04-06 19:35:41,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:35:41,561 INFO L459 AbstractCegarLoop]: Abstraction has 189 states and 211 transitions. [2018-04-06 19:35:41,561 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-06 19:35:41,561 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 211 transitions. [2018-04-06 19:35:41,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-04-06 19:35:41,561 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:35:41,562 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:35:41,562 INFO L408 AbstractCegarLoop]: === Iteration 18 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:35:41,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1610995837, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:35:41,575 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:35:41,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:35:41,595 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:35:41,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:35:41,599 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:35:41,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:35:41,604 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:35:41,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:35:41,609 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-06 19:35:41,623 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:35:41,624 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-06 19:35:41,625 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:35:41,632 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:35:41,632 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:35:41,633 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-06 19:35:41,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:35:41,637 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-06 19:35:41,637 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-06 19:35:41,784 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-06 19:35:41,784 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:35:42,164 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-06 19:35:42,185 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:35:42,185 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15, 14] imperfect sequences [] total 28 [2018-04-06 19:35:42,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-06 19:35:42,186 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-06 19:35:42,186 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=730, Unknown=0, NotChecked=0, Total=812 [2018-04-06 19:35:42,186 INFO L87 Difference]: Start difference. First operand 189 states and 211 transitions. Second operand 29 states. [2018-04-06 19:35:43,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:35:43,507 INFO L93 Difference]: Finished difference Result 294 states and 329 transitions. [2018-04-06 19:35:43,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-06 19:35:43,507 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 46 [2018-04-06 19:35:43,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:35:43,509 INFO L225 Difference]: With dead ends: 294 [2018-04-06 19:35:43,509 INFO L226 Difference]: Without dead ends: 293 [2018-04-06 19:35:43,509 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=432, Invalid=2324, Unknown=0, NotChecked=0, Total=2756 [2018-04-06 19:35:43,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-04-06 19:35:43,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 220. [2018-04-06 19:35:43,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-04-06 19:35:43,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 249 transitions. [2018-04-06 19:35:43,521 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 249 transitions. Word has length 46 [2018-04-06 19:35:43,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:35:43,521 INFO L459 AbstractCegarLoop]: Abstraction has 220 states and 249 transitions. [2018-04-06 19:35:43,521 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-06 19:35:43,522 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 249 transitions. [2018-04-06 19:35:43,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-04-06 19:35:43,522 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:35:43,522 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:35:43,522 INFO L408 AbstractCegarLoop]: === Iteration 19 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:35:43,522 INFO L82 PathProgramCache]: Analyzing trace with hash 2103473680, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:35:43,528 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:35:43,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:35:43,546 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:35:43,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:35:43,548 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:35:43,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:35:43,551 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-06 19:35:43,560 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 15 treesize of output 12 [2018-04-06 19:35:43,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-06 19:35:43,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:35:43,563 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:35:43,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:35:43,564 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-04-06 19:35:43,637 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-06 19:35:43,643 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-06 19:35:43,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-06 19:35:43,646 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:35:43,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:35:43,651 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-04-06 19:35:43,709 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:35:43,709 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:35:44,296 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 13 treesize of output 11 [2018-04-06 19:35:44,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-06 19:35:44,356 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:35:44,370 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:35:44,414 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-06 19:35:44,414 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:35 [2018-04-06 19:35:44,625 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 18 DAG size of output 16 [2018-04-06 19:35:44,687 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:35:44,721 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:35:44,721 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2018-04-06 19:35:44,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-06 19:35:44,722 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-06 19:35:44,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=776, Unknown=0, NotChecked=0, Total=870 [2018-04-06 19:35:44,722 INFO L87 Difference]: Start difference. First operand 220 states and 249 transitions. Second operand 30 states. [2018-04-06 19:35:45,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:35:45,761 INFO L93 Difference]: Finished difference Result 241 states and 269 transitions. [2018-04-06 19:35:45,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-06 19:35:45,762 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 48 [2018-04-06 19:35:45,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:35:45,763 INFO L225 Difference]: With dead ends: 241 [2018-04-06 19:35:45,763 INFO L226 Difference]: Without dead ends: 214 [2018-04-06 19:35:45,764 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=526, Invalid=2126, Unknown=0, NotChecked=0, Total=2652 [2018-04-06 19:35:45,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-04-06 19:35:45,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 185. [2018-04-06 19:35:45,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-04-06 19:35:45,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 208 transitions. [2018-04-06 19:35:45,775 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 208 transitions. Word has length 48 [2018-04-06 19:35:45,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:35:45,775 INFO L459 AbstractCegarLoop]: Abstraction has 185 states and 208 transitions. [2018-04-06 19:35:45,775 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-06 19:35:45,776 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 208 transitions. [2018-04-06 19:35:45,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-06 19:35:45,776 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:35:45,776 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:35:45,777 INFO L408 AbstractCegarLoop]: === Iteration 20 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:35:45,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1217280458, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:35:45,785 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:35:45,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:35:45,810 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:35:45,818 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-06 19:35:45,818 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:35:45,830 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-06 19:35:45,850 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:35:45,850 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 5 [2018-04-06 19:35:45,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-06 19:35:45,851 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-06 19:35:45,851 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-06 19:35:45,851 INFO L87 Difference]: Start difference. First operand 185 states and 208 transitions. Second operand 5 states. [2018-04-06 19:35:45,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:35:45,869 INFO L93 Difference]: Finished difference Result 214 states and 239 transitions. [2018-04-06 19:35:45,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-06 19:35:45,869 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-04-06 19:35:45,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:35:45,870 INFO L225 Difference]: With dead ends: 214 [2018-04-06 19:35:45,870 INFO L226 Difference]: Without dead ends: 185 [2018-04-06 19:35:45,870 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-04-06 19:35:45,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-04-06 19:35:45,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-04-06 19:35:45,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-04-06 19:35:45,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 204 transitions. [2018-04-06 19:35:45,877 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 204 transitions. Word has length 49 [2018-04-06 19:35:45,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:35:45,878 INFO L459 AbstractCegarLoop]: Abstraction has 185 states and 204 transitions. [2018-04-06 19:35:45,878 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-06 19:35:45,878 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 204 transitions. [2018-04-06 19:35:45,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-06 19:35:45,878 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:35:45,878 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:35:45,878 INFO L408 AbstractCegarLoop]: === Iteration 21 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:35:45,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1069605921, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:35:45,887 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:35:45,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:35:45,907 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:35:45,936 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-06 19:35:45,936 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:35:45,945 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-06 19:35:45,965 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:35:45,966 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2018-04-06 19:35:45,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-06 19:35:45,966 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-06 19:35:45,966 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-04-06 19:35:45,966 INFO L87 Difference]: Start difference. First operand 185 states and 204 transitions. Second operand 8 states. [2018-04-06 19:35:46,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:35:46,048 INFO L93 Difference]: Finished difference Result 185 states and 204 transitions. [2018-04-06 19:35:46,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-06 19:35:46,048 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2018-04-06 19:35:46,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:35:46,049 INFO L225 Difference]: With dead ends: 185 [2018-04-06 19:35:46,049 INFO L226 Difference]: Without dead ends: 184 [2018-04-06 19:35:46,049 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-04-06 19:35:46,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-04-06 19:35:46,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2018-04-06 19:35:46,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-04-06 19:35:46,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 202 transitions. [2018-04-06 19:35:46,057 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 202 transitions. Word has length 50 [2018-04-06 19:35:46,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:35:46,057 INFO L459 AbstractCegarLoop]: Abstraction has 184 states and 202 transitions. [2018-04-06 19:35:46,057 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-06 19:35:46,057 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 202 transitions. [2018-04-06 19:35:46,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-04-06 19:35:46,057 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:35:46,058 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:35:46,058 INFO L408 AbstractCegarLoop]: === Iteration 22 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:35:46,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1069605920, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:35:46,064 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:35:46,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:35:46,090 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:35:46,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:35:46,110 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:35:46,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:35:46,118 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:35:46,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:35:46,125 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:20 [2018-04-06 19:35:46,166 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:35:46,180 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:35:46,181 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-06 19:35:46,181 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:35:46,237 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-06 19:35:46,238 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:35:46,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:35:46,245 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2018-04-06 19:35:46,692 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-06 19:35:46,692 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:35:47,727 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 6 treesize of output 1 [2018-04-06 19:35:47,727 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:35:47,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-04-06 19:35:47,752 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 12 treesize of output 3 [2018-04-06 19:35:47,752 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 19:35:47,753 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-04-06 19:35:47,753 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 19:35:47,758 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:35:47,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:35:47,764 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:31, output treesize:14 [2018-04-06 19:35:47,931 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-06 19:35:47,952 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:35:47,952 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [24, 25] imperfect sequences [] total 48 [2018-04-06 19:35:47,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-04-06 19:35:47,953 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-04-06 19:35:47,953 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=2061, Unknown=0, NotChecked=0, Total=2256 [2018-04-06 19:35:47,953 INFO L87 Difference]: Start difference. First operand 184 states and 202 transitions. Second operand 48 states. [2018-04-06 19:35:49,853 WARN L151 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 83 DAG size of output 80 [2018-04-06 19:35:50,081 WARN L151 SmtUtils]: Spent 157ms on a formula simplification. DAG size of input: 85 DAG size of output 81 [2018-04-06 19:35:50,379 WARN L151 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 77 DAG size of output 73 [2018-04-06 19:35:50,644 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 68 DAG size of output 65 [2018-04-06 19:35:50,997 WARN L151 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 76 DAG size of output 73 [2018-04-06 19:35:51,540 WARN L151 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 66 DAG size of output 64 [2018-04-06 19:35:51,722 WARN L151 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 68 DAG size of output 66 [2018-04-06 19:35:53,020 WARN L151 SmtUtils]: Spent 139ms on a formula simplification. DAG size of input: 53 DAG size of output 52 [2018-04-06 19:35:53,336 WARN L151 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 71 DAG size of output 67 [2018-04-06 19:35:53,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:35:53,913 INFO L93 Difference]: Finished difference Result 326 states and 356 transitions. [2018-04-06 19:35:53,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-04-06 19:35:53,914 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 50 [2018-04-06 19:35:53,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:35:53,915 INFO L225 Difference]: With dead ends: 326 [2018-04-06 19:35:53,915 INFO L226 Difference]: Without dead ends: 290 [2018-04-06 19:35:53,917 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1697 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=1169, Invalid=7573, Unknown=0, NotChecked=0, Total=8742 [2018-04-06 19:35:53,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-04-06 19:35:53,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 217. [2018-04-06 19:35:53,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-04-06 19:35:53,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 242 transitions. [2018-04-06 19:35:53,928 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 242 transitions. Word has length 50 [2018-04-06 19:35:53,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:35:53,928 INFO L459 AbstractCegarLoop]: Abstraction has 217 states and 242 transitions. [2018-04-06 19:35:53,928 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-04-06 19:35:53,928 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 242 transitions. [2018-04-06 19:35:53,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-04-06 19:35:53,929 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:35:53,929 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:35:53,929 INFO L408 AbstractCegarLoop]: === Iteration 23 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:35:53,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1394559947, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:35:53,937 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:35:53,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:35:53,962 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:35:53,972 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-06 19:35:53,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-04-06 19:35:53,974 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:35:53,975 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:35:53,979 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-06 19:35:53,979 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-04-06 19:35:54,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-04-06 19:35:54,089 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-06 19:35:54,089 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-06 19:35:54,093 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:35:54,105 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-06 19:35:54,105 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-04-06 19:35:54,177 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:35:54,177 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:35:54,374 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-04-06 19:35:54,374 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:35:54,380 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 13 treesize of output 11 [2018-04-06 19:35:54,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-06 19:35:54,389 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 19:35:54,390 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:35:54,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:35:54,395 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-04-06 19:35:54,403 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:35:54,424 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:35:54,424 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-04-06 19:35:54,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-06 19:35:54,425 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-06 19:35:54,425 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2018-04-06 19:35:54,425 INFO L87 Difference]: Start difference. First operand 217 states and 242 transitions. Second operand 21 states. [2018-04-06 19:35:57,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:35:57,155 INFO L93 Difference]: Finished difference Result 247 states and 269 transitions. [2018-04-06 19:35:57,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-06 19:35:57,155 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 53 [2018-04-06 19:35:57,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:35:57,156 INFO L225 Difference]: With dead ends: 247 [2018-04-06 19:35:57,156 INFO L226 Difference]: Without dead ends: 246 [2018-04-06 19:35:57,157 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=169, Invalid=953, Unknown=0, NotChecked=0, Total=1122 [2018-04-06 19:35:57,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-04-06 19:35:57,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 217. [2018-04-06 19:35:57,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-04-06 19:35:57,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 240 transitions. [2018-04-06 19:35:57,167 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 240 transitions. Word has length 53 [2018-04-06 19:35:57,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:35:57,167 INFO L459 AbstractCegarLoop]: Abstraction has 217 states and 240 transitions. [2018-04-06 19:35:57,167 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-06 19:35:57,167 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 240 transitions. [2018-04-06 19:35:57,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-06 19:35:57,168 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:35:57,168 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:35:57,168 INFO L408 AbstractCegarLoop]: === Iteration 24 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:35:57,168 INFO L82 PathProgramCache]: Analyzing trace with hash 281685371, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:35:57,176 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:35:57,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:35:57,205 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:35:57,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:35:57,218 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:35:57,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:35:57,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:35:57,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:35:57,243 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-06 19:35:57,255 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:35:57,256 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:35:57,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-06 19:35:57,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:35:57,262 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-06 19:35:57,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:35:57,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:35:57,267 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-06 19:35:57,421 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-06 19:35:57,422 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:35:57,916 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-06 19:35:57,938 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:35:57,938 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 30 [2018-04-06 19:35:57,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-06 19:35:57,938 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-06 19:35:57,939 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2018-04-06 19:35:57,939 INFO L87 Difference]: Start difference. First operand 217 states and 240 transitions. Second operand 31 states. [2018-04-06 19:35:58,329 WARN L148 SmtUtils]: Spent 337ms on a formula simplification that was a NOOP. DAG size: 44 [2018-04-06 19:35:59,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:35:59,550 INFO L93 Difference]: Finished difference Result 248 states and 272 transitions. [2018-04-06 19:35:59,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-06 19:35:59,550 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 54 [2018-04-06 19:35:59,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:35:59,551 INFO L225 Difference]: With dead ends: 248 [2018-04-06 19:35:59,551 INFO L226 Difference]: Without dead ends: 247 [2018-04-06 19:35:59,552 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=461, Invalid=2731, Unknown=0, NotChecked=0, Total=3192 [2018-04-06 19:35:59,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-04-06 19:35:59,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 217. [2018-04-06 19:35:59,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-04-06 19:35:59,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 238 transitions. [2018-04-06 19:35:59,565 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 238 transitions. Word has length 54 [2018-04-06 19:35:59,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:35:59,566 INFO L459 AbstractCegarLoop]: Abstraction has 217 states and 238 transitions. [2018-04-06 19:35:59,566 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-06 19:35:59,566 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 238 transitions. [2018-04-06 19:35:59,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-06 19:35:59,567 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:35:59,567 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:35:59,567 INFO L408 AbstractCegarLoop]: === Iteration 25 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:35:59,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1419306272, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:35:59,575 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:35:59,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:35:59,597 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:35:59,617 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:35:59,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-04-06 19:35:59,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-06 19:35:59,620 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:35:59,623 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:35:59,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-06 19:35:59,626 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-06 19:35:59,654 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true [2018-04-06 19:35:59,657 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true [2018-04-06 19:35:59,668 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-06 19:35:59,668 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:35:59,690 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_25| Int)) (or (= (store (store (store |c_#valid| |v_main_#t~malloc11.base_25| 1) |c_main_#t~malloc10.base| 0) |v_main_#t~malloc11.base_25| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_25|))))) is different from false [2018-04-06 19:35:59,693 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc10.base_23| Int) (|v_main_#t~malloc11.base_25| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_23| 1))) (or (not (= (select |c_#valid| |v_main_#t~malloc10.base_23|) 0)) (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc11.base_25| 1) |v_main_#t~malloc10.base_23| 0) |v_main_#t~malloc11.base_25| 0)) (not (= (select .cse0 |v_main_#t~malloc11.base_25|) 0))))) is different from false [2018-04-06 19:35:59,704 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-06 19:35:59,737 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:35:59,738 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-06 19:35:59,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-06 19:35:59,738 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-06 19:35:59,738 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-06 19:35:59,738 INFO L87 Difference]: Start difference. First operand 217 states and 238 transitions. Second operand 12 states. [2018-04-06 19:35:59,747 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_main_#t~malloc10.base_23| Int) (|v_main_#t~malloc11.base_25| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_23| 1))) (or (not (= (select |c_#valid| |v_main_#t~malloc10.base_23|) 0)) (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc11.base_25| 1) |v_main_#t~malloc10.base_23| 0) |v_main_#t~malloc11.base_25| 0)) (not (= (select .cse0 |v_main_#t~malloc11.base_25|) 0)))))) is different from false [2018-04-06 19:36:00,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:36:00,018 INFO L93 Difference]: Finished difference Result 336 states and 368 transitions. [2018-04-06 19:36:00,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-06 19:36:00,019 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2018-04-06 19:36:00,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:36:00,020 INFO L225 Difference]: With dead ends: 336 [2018-04-06 19:36:00,020 INFO L226 Difference]: Without dead ends: 308 [2018-04-06 19:36:00,020 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 97 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-04-06 19:36:00,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-04-06 19:36:00,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 219. [2018-04-06 19:36:00,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-04-06 19:36:00,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 241 transitions. [2018-04-06 19:36:00,029 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 241 transitions. Word has length 54 [2018-04-06 19:36:00,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:36:00,029 INFO L459 AbstractCegarLoop]: Abstraction has 219 states and 241 transitions. [2018-04-06 19:36:00,029 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-06 19:36:00,029 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 241 transitions. [2018-04-06 19:36:00,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-06 19:36:00,030 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:36:00,030 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:36:00,030 INFO L408 AbstractCegarLoop]: === Iteration 26 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:36:00,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1802000771, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:36:00,035 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:36:00,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:36:00,057 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:36:00,078 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:36:00,079 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-04-06 19:36:00,081 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:36:00,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-06 19:36:00,082 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:00,085 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:36:00,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-06 19:36:00,089 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-06 19:36:00,117 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true [2018-04-06 19:36:00,121 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true [2018-04-06 19:36:00,127 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-06 19:36:00,128 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:36:00,148 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc11.base_27| Int)) (or (= (store (store (store |c_#valid| |v_main_#t~malloc11.base_27| 1) |c_main_#t~malloc10.base| 0) |v_main_#t~malloc11.base_27| 0) |c_old(#valid)|) (not (= 0 (select |c_#valid| |v_main_#t~malloc11.base_27|))))) is different from false [2018-04-06 19:36:00,151 WARN L1011 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~malloc10.base_25| Int) (|v_main_#t~malloc11.base_27| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_25| 1))) (or (not (= (select |c_#valid| |v_main_#t~malloc10.base_25|) 0)) (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc11.base_27| 1) |v_main_#t~malloc10.base_25| 0) |v_main_#t~malloc11.base_27| 0)) (not (= (select .cse0 |v_main_#t~malloc11.base_27|) 0))))) is different from false [2018-04-06 19:36:00,168 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-06 19:36:00,189 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:36:00,190 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2018-04-06 19:36:00,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-06 19:36:00,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-06 19:36:00,191 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=45, Unknown=4, NotChecked=60, Total=132 [2018-04-06 19:36:00,191 INFO L87 Difference]: Start difference. First operand 219 states and 241 transitions. Second operand 12 states. [2018-04-06 19:36:00,199 WARN L1011 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (forall ((|v_main_#t~malloc10.base_25| Int) (|v_main_#t~malloc11.base_27| Int)) (let ((.cse0 (store |c_#valid| |v_main_#t~malloc10.base_25| 1))) (or (not (= (select |c_#valid| |v_main_#t~malloc10.base_25|) 0)) (= |c_old(#valid)| (store (store (store .cse0 |v_main_#t~malloc11.base_27| 1) |v_main_#t~malloc10.base_25| 0) |v_main_#t~malloc11.base_27| 0)) (not (= (select .cse0 |v_main_#t~malloc11.base_27|) 0)))))) is different from false [2018-04-06 19:36:00,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:36:00,492 INFO L93 Difference]: Finished difference Result 223 states and 241 transitions. [2018-04-06 19:36:00,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-06 19:36:00,492 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2018-04-06 19:36:00,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:36:00,493 INFO L225 Difference]: With dead ends: 223 [2018-04-06 19:36:00,493 INFO L226 Difference]: Without dead ends: 195 [2018-04-06 19:36:00,494 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=125, Unknown=6, NotChecked=130, Total=306 [2018-04-06 19:36:00,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-04-06 19:36:00,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 104. [2018-04-06 19:36:00,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-04-06 19:36:00,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2018-04-06 19:36:00,502 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 55 [2018-04-06 19:36:00,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:36:00,502 INFO L459 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2018-04-06 19:36:00,502 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-06 19:36:00,502 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2018-04-06 19:36:00,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-04-06 19:36:00,503 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:36:00,503 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 19:36:00,503 INFO L408 AbstractCegarLoop]: === Iteration 27 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:36:00,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1221350794, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:36:00,511 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:36:00,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:36:00,530 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:36:00,535 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-06 19:36:00,537 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 19:36:00,537 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:00,538 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:36:00,542 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-06 19:36:00,542 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2018-04-06 19:36:00,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-04-06 19:36:00,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-06 19:36:00,619 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-06 19:36:00,623 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:36:00,632 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-06 19:36:00,632 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:29 [2018-04-06 19:36:00,689 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:36:00,690 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:36:00,879 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2018-04-06 19:36:00,880 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:00,886 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 13 treesize of output 11 [2018-04-06 19:36:00,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-04-06 19:36:00,895 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:00,896 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:36:00,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:36:00,901 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-04-06 19:36:00,914 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:36:00,947 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:36:00,947 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-04-06 19:36:00,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-06 19:36:00,948 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-06 19:36:00,948 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2018-04-06 19:36:00,948 INFO L87 Difference]: Start difference. First operand 104 states and 111 transitions. Second operand 21 states. [2018-04-06 19:36:01,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:36:01,441 INFO L93 Difference]: Finished difference Result 111 states and 118 transitions. [2018-04-06 19:36:01,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-06 19:36:01,442 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 55 [2018-04-06 19:36:01,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:36:01,442 INFO L225 Difference]: With dead ends: 111 [2018-04-06 19:36:01,442 INFO L226 Difference]: Without dead ends: 110 [2018-04-06 19:36:01,443 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=138, Invalid=732, Unknown=0, NotChecked=0, Total=870 [2018-04-06 19:36:01,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-04-06 19:36:01,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 104. [2018-04-06 19:36:01,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-04-06 19:36:01,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2018-04-06 19:36:01,448 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 55 [2018-04-06 19:36:01,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:36:01,449 INFO L459 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2018-04-06 19:36:01,449 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-06 19:36:01,449 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2018-04-06 19:36:01,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-04-06 19:36:01,449 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:36:01,449 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:36:01,449 INFO L408 AbstractCegarLoop]: === Iteration 28 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:36:01,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1542585600, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:36:01,455 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:36:01,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:36:01,476 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:36:01,486 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-06 19:36:01,486 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:36:01,508 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-06 19:36:01,529 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-04-06 19:36:01,529 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 7 [2018-04-06 19:36:01,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-06 19:36:01,529 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-06 19:36:01,529 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-04-06 19:36:01,529 INFO L87 Difference]: Start difference. First operand 104 states and 111 transitions. Second operand 7 states. [2018-04-06 19:36:01,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:36:01,573 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2018-04-06 19:36:01,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-06 19:36:01,573 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 61 [2018-04-06 19:36:01,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:36:01,574 INFO L225 Difference]: With dead ends: 120 [2018-04-06 19:36:01,574 INFO L226 Difference]: Without dead ends: 95 [2018-04-06 19:36:01,574 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 115 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-04-06 19:36:01,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-04-06 19:36:01,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2018-04-06 19:36:01,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-04-06 19:36:01,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2018-04-06 19:36:01,580 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 61 [2018-04-06 19:36:01,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:36:01,580 INFO L459 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2018-04-06 19:36:01,580 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-06 19:36:01,580 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2018-04-06 19:36:01,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-04-06 19:36:01,580 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:36:01,580 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 19:36:01,580 INFO L408 AbstractCegarLoop]: === Iteration 29 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:36:01,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1162765393, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:36:01,586 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:36:01,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:36:01,608 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:36:01,610 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:36:01,610 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:01,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:36:01,612 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-06 19:36:01,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-06 19:36:01,627 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:01,633 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:36:01,633 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:36:01,634 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-06 19:36:01,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:01,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:36:01,637 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-06 19:36:01,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-04-06 19:36:01,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-06 19:36:01,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:01,653 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:36:01,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:36:01,655 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-06 19:36:01,797 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-06 19:36:01,799 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 19:36:01,799 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:01,802 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:36:01,807 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-06 19:36:01,807 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2018-04-06 19:36:01,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 23 treesize of output 24 [2018-04-06 19:36:01,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 19:36:01,832 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:01,836 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:36:01,841 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-06 19:36:01,841 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:26 [2018-04-06 19:36:01,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2018-04-06 19:36:01,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-06 19:36:01,921 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:01,930 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-06 19:36:01,930 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-06 19:36:01,933 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:36:01,939 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-06 19:36:01,939 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:40, output treesize:32 [2018-04-06 19:36:02,019 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:36:02,020 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:36:02,855 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2018-04-06 19:36:02,869 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-06 19:36:02,869 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:02,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-04-06 19:36:02,888 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 9 treesize of output 1 [2018-04-06 19:36:02,888 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:02,891 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:36:02,892 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-06 19:36:02,895 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2018-04-06 19:36:02,895 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:02,896 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:36:02,906 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-06 19:36:02,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-06 19:36:02,924 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:57, output treesize:84 [2018-04-06 19:36:03,101 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-06 19:36:03,121 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:36:03,121 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 43 [2018-04-06 19:36:03,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-04-06 19:36:03,122 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-04-06 19:36:03,122 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1756, Unknown=0, NotChecked=0, Total=1892 [2018-04-06 19:36:03,122 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand 44 states. [2018-04-06 19:36:04,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:36:04,804 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2018-04-06 19:36:04,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-06 19:36:04,804 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 62 [2018-04-06 19:36:04,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:36:04,805 INFO L225 Difference]: With dead ends: 101 [2018-04-06 19:36:04,805 INFO L226 Difference]: Without dead ends: 83 [2018-04-06 19:36:04,807 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 846 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=589, Invalid=4523, Unknown=0, NotChecked=0, Total=5112 [2018-04-06 19:36:04,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-04-06 19:36:04,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-04-06 19:36:04,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-04-06 19:36:04,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 85 transitions. [2018-04-06 19:36:04,816 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 85 transitions. Word has length 62 [2018-04-06 19:36:04,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:36:04,816 INFO L459 AbstractCegarLoop]: Abstraction has 83 states and 85 transitions. [2018-04-06 19:36:04,816 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-04-06 19:36:04,817 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2018-04-06 19:36:04,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-04-06 19:36:04,817 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:36:04,817 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:36:04,817 INFO L408 AbstractCegarLoop]: === Iteration 30 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:36:04,818 INFO L82 PathProgramCache]: Analyzing trace with hash -364139388, now seen corresponding path program 1 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:36:04,824 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:36:04,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:36:04,855 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:36:04,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:36:04,858 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:04,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:36:04,864 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:04,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:36:04,868 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-06 19:36:04,879 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:36:04,879 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:36:04,880 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-06 19:36:04,880 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:04,886 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-06 19:36:04,886 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:04,890 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-06 19:36:04,890 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-06 19:36:05,110 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:36:05,110 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:36:05,802 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:36:05,822 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:36:05,823 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 38 [2018-04-06 19:36:05,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-06 19:36:05,823 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-06 19:36:05,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1347, Unknown=0, NotChecked=0, Total=1482 [2018-04-06 19:36:05,824 INFO L87 Difference]: Start difference. First operand 83 states and 85 transitions. Second operand 39 states. [2018-04-06 19:36:07,243 WARN L151 SmtUtils]: Spent 152ms on a formula simplification. DAG size of input: 59 DAG size of output 52 [2018-04-06 19:36:07,693 WARN L151 SmtUtils]: Spent 163ms on a formula simplification. DAG size of input: 54 DAG size of output 52 [2018-04-06 19:36:07,855 WARN L151 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 61 DAG size of output 60 [2018-04-06 19:36:08,139 WARN L151 SmtUtils]: Spent 230ms on a formula simplification. DAG size of input: 69 DAG size of output 67 [2018-04-06 19:36:08,974 WARN L151 SmtUtils]: Spent 245ms on a formula simplification. DAG size of input: 67 DAG size of output 62 [2018-04-06 19:36:09,845 WARN L151 SmtUtils]: Spent 275ms on a formula simplification. DAG size of input: 73 DAG size of output 71 [2018-04-06 19:36:09,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:36:09,846 INFO L93 Difference]: Finished difference Result 143 states and 148 transitions. [2018-04-06 19:36:09,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-04-06 19:36:09,846 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 66 [2018-04-06 19:36:09,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:36:09,847 INFO L225 Difference]: With dead ends: 143 [2018-04-06 19:36:09,847 INFO L226 Difference]: Without dead ends: 142 [2018-04-06 19:36:09,849 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1227 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1038, Invalid=6102, Unknown=0, NotChecked=0, Total=7140 [2018-04-06 19:36:09,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-04-06 19:36:09,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 125. [2018-04-06 19:36:09,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-04-06 19:36:09,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 134 transitions. [2018-04-06 19:36:09,857 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 134 transitions. Word has length 66 [2018-04-06 19:36:09,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:36:09,857 INFO L459 AbstractCegarLoop]: Abstraction has 125 states and 134 transitions. [2018-04-06 19:36:09,857 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-06 19:36:09,857 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 134 transitions. [2018-04-06 19:36:09,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-04-06 19:36:09,858 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:36:09,858 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:36:09,858 INFO L408 AbstractCegarLoop]: === Iteration 31 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:36:09,858 INFO L82 PathProgramCache]: Analyzing trace with hash 675061224, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:36:09,863 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:36:09,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:36:09,887 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:36:09,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:36:09,890 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:09,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:36:09,891 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-06 19:36:09,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:36:09,906 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:09,911 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:36:09,912 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:36:09,912 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-06 19:36:09,912 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:09,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:36:09,916 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-06 19:36:09,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-04-06 19:36:09,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-06 19:36:09,932 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:09,933 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:36:09,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:36:09,936 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-06 19:36:10,058 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-06 19:36:10,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 8 treesize of output 7 [2018-04-06 19:36:10,060 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:10,065 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:36:10,071 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-06 19:36:10,071 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-04-06 19:36:10,137 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-06 19:36:10,144 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-06 19:36:10,144 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-06 19:36:10,147 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:36:10,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:36:10,154 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-04-06 19:36:10,235 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:36:10,235 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:36:10,909 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2018-04-06 19:36:10,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-06 19:36:10,929 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:10,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-04-06 19:36:10,945 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 9 treesize of output 1 [2018-04-06 19:36:10,945 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:10,948 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:36:10,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-06 19:36:10,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-04-06 19:36:10,951 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:10,953 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:36:10,962 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-06 19:36:10,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-06 19:36:10,979 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:55, output treesize:84 [2018-04-06 19:36:11,137 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:36:11,157 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:36:11,158 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 41 [2018-04-06 19:36:11,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-06 19:36:11,158 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-06 19:36:11,158 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1603, Unknown=0, NotChecked=0, Total=1722 [2018-04-06 19:36:11,159 INFO L87 Difference]: Start difference. First operand 125 states and 134 transitions. Second operand 42 states. [2018-04-06 19:36:12,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:36:12,421 INFO L93 Difference]: Finished difference Result 134 states and 141 transitions. [2018-04-06 19:36:12,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-06 19:36:12,421 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 68 [2018-04-06 19:36:12,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:36:12,422 INFO L225 Difference]: With dead ends: 134 [2018-04-06 19:36:12,422 INFO L226 Difference]: Without dead ends: 133 [2018-04-06 19:36:12,423 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=364, Invalid=3418, Unknown=0, NotChecked=0, Total=3782 [2018-04-06 19:36:12,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-04-06 19:36:12,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 125. [2018-04-06 19:36:12,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-04-06 19:36:12,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 133 transitions. [2018-04-06 19:36:12,431 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 133 transitions. Word has length 68 [2018-04-06 19:36:12,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:36:12,431 INFO L459 AbstractCegarLoop]: Abstraction has 125 states and 133 transitions. [2018-04-06 19:36:12,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-06 19:36:12,431 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 133 transitions. [2018-04-06 19:36:12,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-06 19:36:12,432 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:36:12,432 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:36:12,432 INFO L408 AbstractCegarLoop]: === Iteration 32 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:36:12,432 INFO L82 PathProgramCache]: Analyzing trace with hash -547938562, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:36:12,437 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:36:12,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:36:12,461 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:36:12,464 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:36:12,464 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:12,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:36:12,469 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:12,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:36:12,473 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-06 19:36:12,486 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:36:12,488 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-06 19:36:12,488 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:12,502 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:36:12,502 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:36:12,503 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-06 19:36:12,503 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:12,508 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-06 19:36:12,508 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-06 19:36:12,757 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:36:12,757 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:36:13,394 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:36:13,414 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:36:13,432 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19] total 38 [2018-04-06 19:36:13,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-06 19:36:13,432 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-06 19:36:13,433 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1367, Unknown=0, NotChecked=0, Total=1482 [2018-04-06 19:36:13,433 INFO L87 Difference]: Start difference. First operand 125 states and 133 transitions. Second operand 39 states. [2018-04-06 19:36:15,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:36:15,939 INFO L93 Difference]: Finished difference Result 140 states and 145 transitions. [2018-04-06 19:36:15,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-06 19:36:15,940 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 69 [2018-04-06 19:36:15,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:36:15,940 INFO L225 Difference]: With dead ends: 140 [2018-04-06 19:36:15,940 INFO L226 Difference]: Without dead ends: 139 [2018-04-06 19:36:15,941 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 719 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=698, Invalid=4414, Unknown=0, NotChecked=0, Total=5112 [2018-04-06 19:36:15,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-04-06 19:36:15,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 125. [2018-04-06 19:36:15,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-04-06 19:36:15,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 131 transitions. [2018-04-06 19:36:15,949 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 131 transitions. Word has length 69 [2018-04-06 19:36:15,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:36:15,950 INFO L459 AbstractCegarLoop]: Abstraction has 125 states and 131 transitions. [2018-04-06 19:36:15,950 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-06 19:36:15,950 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 131 transitions. [2018-04-06 19:36:15,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-04-06 19:36:15,950 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:36:15,950 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:36:15,950 INFO L408 AbstractCegarLoop]: === Iteration 33 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:36:15,950 INFO L82 PathProgramCache]: Analyzing trace with hash 1272812647, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:36:15,956 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:36:15,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:36:15,982 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:36:15,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:36:15,984 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:15,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:36:15,985 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-06 19:36:15,990 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:36:15,991 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:36:15,991 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-06 19:36:15,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:15,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:36:15,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:15,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:36:15,999 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-06 19:36:16,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-04-06 19:36:16,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-06 19:36:16,014 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:16,016 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:36:16,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:36:16,018 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-06 19:36:16,143 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-06 19:36:16,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 19:36:16,144 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:16,148 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:36:16,152 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-06 19:36:16,153 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-04-06 19:36:16,208 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-06 19:36:16,214 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-06 19:36:16,214 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-06 19:36:16,217 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:36:16,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:36:16,222 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-04-06 19:36:16,298 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:36:16,298 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:36:16,957 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2018-04-06 19:36:16,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-06 19:36:16,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:16,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2018-04-06 19:36:16,989 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 9 treesize of output 1 [2018-04-06 19:36:16,989 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:16,992 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:36:16,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-06 19:36:16,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-04-06 19:36:16,998 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:16,999 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:36:17,010 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-06 19:36:17,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-06 19:36:17,026 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:55, output treesize:84 [2018-04-06 19:36:17,183 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:36:17,204 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:36:17,204 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 41 [2018-04-06 19:36:17,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-06 19:36:17,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-06 19:36:17,205 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1603, Unknown=0, NotChecked=0, Total=1722 [2018-04-06 19:36:17,205 INFO L87 Difference]: Start difference. First operand 125 states and 131 transitions. Second operand 42 states. [2018-04-06 19:36:18,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:36:18,473 INFO L93 Difference]: Finished difference Result 134 states and 139 transitions. [2018-04-06 19:36:18,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-06 19:36:18,473 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 70 [2018-04-06 19:36:18,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:36:18,474 INFO L225 Difference]: With dead ends: 134 [2018-04-06 19:36:18,474 INFO L226 Difference]: Without dead ends: 125 [2018-04-06 19:36:18,475 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 558 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=360, Invalid=3422, Unknown=0, NotChecked=0, Total=3782 [2018-04-06 19:36:18,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-04-06 19:36:18,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-04-06 19:36:18,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-04-06 19:36:18,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 130 transitions. [2018-04-06 19:36:18,485 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 130 transitions. Word has length 70 [2018-04-06 19:36:18,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:36:18,485 INFO L459 AbstractCegarLoop]: Abstraction has 125 states and 130 transitions. [2018-04-06 19:36:18,485 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-06 19:36:18,485 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 130 transitions. [2018-04-06 19:36:18,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-04-06 19:36:18,486 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:36:18,486 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:36:18,486 INFO L408 AbstractCegarLoop]: === Iteration 34 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:36:18,487 INFO L82 PathProgramCache]: Analyzing trace with hash 471281195, now seen corresponding path program 3 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:36:18,495 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:36:18,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:36:18,531 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:36:18,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:36:18,533 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:18,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:36:18,535 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-06 19:36:18,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:36:18,540 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:18,545 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:36:18,545 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:36:18,546 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-06 19:36:18,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:18,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:36:18,550 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-06 19:36:18,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-04-06 19:36:18,565 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-06 19:36:18,565 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:18,566 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:36:18,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:36:18,569 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-06 19:36:18,709 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-06 19:36:18,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 19:36:18,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:18,715 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:36:18,720 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-06 19:36:18,720 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2018-04-06 19:36:18,797 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-06 19:36:18,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-06 19:36:18,799 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:18,802 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:36:18,807 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-06 19:36:18,807 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-04-06 19:36:18,868 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-06 19:36:18,874 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-06 19:36:18,874 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-06 19:36:18,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:36:18,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:36:18,882 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-04-06 19:36:18,969 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 7 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:36:18,970 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:36:20,224 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 31 [2018-04-06 19:36:20,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-06 19:36:20,235 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:20,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 22 treesize of output 18 [2018-04-06 19:36:20,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-04-06 19:36:20,246 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:20,249 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:36:20,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2018-04-06 19:36:20,257 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2018-04-06 19:36:20,257 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:20,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 [2018-04-06 19:36:20,279 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 4 [2018-04-06 19:36:20,280 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:20,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2018-04-06 19:36:20,285 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-04-06 19:36:20,294 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-06 19:36:20,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 52 [2018-04-06 19:36:20,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2018-04-06 19:36:20,395 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:20,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2018-04-06 19:36:20,397 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:20,455 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 2 case distinctions, treesize of input 24 treesize of output 32 [2018-04-06 19:36:20,456 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 3 xjuncts. [2018-04-06 19:36:20,472 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 24 treesize of output 32 [2018-04-06 19:36:20,473 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 3 xjuncts. [2018-04-06 19:36:20,529 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 30 treesize of output 26 [2018-04-06 19:36:20,529 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-04-06 19:36:20,551 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-06 19:36:20,570 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-06 19:36:20,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-04-06 19:36:20,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2018-04-06 19:36:20,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2018-04-06 19:36:20,604 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-04-06 19:36:20,605 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 22 treesize of output 16 [2018-04-06 19:36:20,605 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:20,611 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2018-04-06 19:36:20,611 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 2 xjuncts. [2018-04-06 19:36:20,646 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 23 treesize of output 19 [2018-04-06 19:36:20,647 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 2 xjuncts. [2018-04-06 19:36:20,657 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 2 case distinctions, treesize of input 24 treesize of output 32 [2018-04-06 19:36:20,658 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 3 xjuncts. [2018-04-06 19:36:20,682 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-06 19:36:20,700 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-06 19:36:20,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-04-06 19:36:20,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-06 19:36:20,753 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 6 variables, input treesize:58, output treesize:84 [2018-04-06 19:36:20,973 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:36:20,994 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:36:20,995 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 51 [2018-04-06 19:36:20,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-04-06 19:36:20,995 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-04-06 19:36:20,996 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=2473, Unknown=0, NotChecked=0, Total=2652 [2018-04-06 19:36:20,996 INFO L87 Difference]: Start difference. First operand 125 states and 130 transitions. Second operand 52 states. [2018-04-06 19:36:23,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:36:23,553 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2018-04-06 19:36:23,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-06 19:36:23,553 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 83 [2018-04-06 19:36:23,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:36:23,554 INFO L225 Difference]: With dead ends: 125 [2018-04-06 19:36:23,554 INFO L226 Difference]: Without dead ends: 124 [2018-04-06 19:36:23,555 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1381 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1170, Invalid=6486, Unknown=0, NotChecked=0, Total=7656 [2018-04-06 19:36:23,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-04-06 19:36:23,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-04-06 19:36:23,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-04-06 19:36:23,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 128 transitions. [2018-04-06 19:36:23,563 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 128 transitions. Word has length 83 [2018-04-06 19:36:23,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:36:23,563 INFO L459 AbstractCegarLoop]: Abstraction has 124 states and 128 transitions. [2018-04-06 19:36:23,563 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-04-06 19:36:23,563 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 128 transitions. [2018-04-06 19:36:23,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-04-06 19:36:23,564 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:36:23,564 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:36:23,564 INFO L408 AbstractCegarLoop]: === Iteration 35 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:36:23,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1286266902, now seen corresponding path program 3 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:36:23,570 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:36:23,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:36:23,597 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:36:23,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:36:23,599 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:23,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:36:23,600 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-06 19:36:23,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-06 19:36:23,605 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:23,610 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:36:23,611 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:36:23,611 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-06 19:36:23,611 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:23,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:36:23,614 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-06 19:36:23,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-04-06 19:36:23,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-06 19:36:23,629 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:23,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:36:23,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:36:23,638 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-06 19:36:23,778 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-06 19:36:23,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-06 19:36:23,780 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:23,784 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:36:23,789 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-06 19:36:23,789 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2018-04-06 19:36:23,865 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-06 19:36:23,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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-06 19:36:23,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:23,871 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:36:23,876 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-06 19:36:23,876 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-04-06 19:36:23,937 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-06 19:36:23,942 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-06 19:36:23,943 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-06 19:36:23,945 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:36:23,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-06 19:36:23,951 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-04-06 19:36:24,038 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 7 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:36:24,039 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:36:25,306 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 31 [2018-04-06 19:36:25,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-06 19:36:25,317 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:25,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2018-04-06 19:36:25,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2018-04-06 19:36:25,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2018-04-06 19:36:25,357 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-04-06 19:36:25,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2018-04-06 19:36:25,363 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-04-06 19:36:25,365 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 22 treesize of output 16 [2018-04-06 19:36:25,365 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:25,403 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 23 treesize of output 19 [2018-04-06 19:36:25,403 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-04-06 19:36:25,413 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 2 case distinctions, treesize of input 24 treesize of output 32 [2018-04-06 19:36:25,414 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 3 xjuncts. [2018-04-06 19:36:25,438 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-06 19:36:25,457 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-06 19:36:25,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2018-04-06 19:36:25,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2018-04-06 19:36:25,465 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:25,476 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 24 [2018-04-06 19:36:25,487 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 4 [2018-04-06 19:36:25,488 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:25,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2018-04-06 19:36:25,493 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-04-06 19:36:25,502 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-04-06 19:36:25,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 52 [2018-04-06 19:36:25,615 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 24 treesize of output 32 [2018-04-06 19:36:25,616 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 3 xjuncts. [2018-04-06 19:36:25,627 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 2 case distinctions, treesize of input 24 treesize of output 32 [2018-04-06 19:36:25,627 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 3 xjuncts. [2018-04-06 19:36:25,688 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 30 treesize of output 26 [2018-04-06 19:36:25,688 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-04-06 19:36:25,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2018-04-06 19:36:25,733 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-04-06 19:36:25,738 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2018-04-06 19:36:25,738 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 2 xjuncts. [2018-04-06 19:36:25,764 INFO L267 ElimStorePlain]: Start of recursive call 16: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-04-06 19:36:25,783 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-04-06 19:36:25,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 22 treesize of output 18 [2018-04-06 19:36:25,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2018-04-06 19:36:25,787 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:25,791 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:36:25,818 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-04-06 19:36:25,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-04-06 19:36:25,847 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 6 variables, input treesize:58, output treesize:84 [2018-04-06 19:36:26,057 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:36:26,077 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:36:26,077 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 51 [2018-04-06 19:36:26,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-04-06 19:36:26,078 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-04-06 19:36:26,078 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=2473, Unknown=0, NotChecked=0, Total=2652 [2018-04-06 19:36:26,078 INFO L87 Difference]: Start difference. First operand 124 states and 128 transitions. Second operand 52 states. [2018-04-06 19:36:28,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:36:28,414 INFO L93 Difference]: Finished difference Result 124 states and 128 transitions. [2018-04-06 19:36:28,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-06 19:36:28,415 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 85 [2018-04-06 19:36:28,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:36:28,415 INFO L225 Difference]: With dead ends: 124 [2018-04-06 19:36:28,415 INFO L226 Difference]: Without dead ends: 115 [2018-04-06 19:36:28,416 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1280 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=982, Invalid=6158, Unknown=0, NotChecked=0, Total=7140 [2018-04-06 19:36:28,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-04-06 19:36:28,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-04-06 19:36:28,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-04-06 19:36:28,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 117 transitions. [2018-04-06 19:36:28,424 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 117 transitions. Word has length 85 [2018-04-06 19:36:28,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:36:28,424 INFO L459 AbstractCegarLoop]: Abstraction has 115 states and 117 transitions. [2018-04-06 19:36:28,424 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-04-06 19:36:28,424 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2018-04-06 19:36:28,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-04-06 19:36:28,425 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:36:28,425 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-06 19:36:28,425 INFO L408 AbstractCegarLoop]: === Iteration 36 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:36:28,425 INFO L82 PathProgramCache]: Analyzing trace with hash 268321118, now seen corresponding path program 3 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:36:28,431 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:36:28,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:36:28,471 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:36:28,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:36:28,475 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:28,481 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:36:28,481 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:28,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:36:28,485 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-06 19:36:28,496 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:36:28,497 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:36:28,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-06 19:36:28,497 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:28,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-06 19:36:28,504 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:28,507 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-06 19:36:28,508 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-06 19:36:28,883 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:36:28,883 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:36:30,030 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:36:30,051 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:36:30,051 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 50 [2018-04-06 19:36:30,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-04-06 19:36:30,052 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-04-06 19:36:30,052 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=2381, Unknown=0, NotChecked=0, Total=2550 [2018-04-06 19:36:30,052 INFO L87 Difference]: Start difference. First operand 115 states and 117 transitions. Second operand 51 states. [2018-04-06 19:36:32,839 WARN L151 SmtUtils]: Spent 229ms on a formula simplification. DAG size of input: 94 DAG size of output 77 [2018-04-06 19:36:33,067 WARN L151 SmtUtils]: Spent 106ms on a formula simplification. DAG size of input: 95 DAG size of output 62 [2018-04-06 19:36:33,895 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 59 DAG size of output 47 [2018-04-06 19:36:34,323 WARN L151 SmtUtils]: Spent 233ms on a formula simplification. DAG size of input: 87 DAG size of output 64 [2018-04-06 19:36:34,589 WARN L151 SmtUtils]: Spent 147ms on a formula simplification. DAG size of input: 77 DAG size of output 61 [2018-04-06 19:36:36,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:36:36,348 INFO L93 Difference]: Finished difference Result 177 states and 184 transitions. [2018-04-06 19:36:36,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-04-06 19:36:36,348 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 99 [2018-04-06 19:36:36,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:36:36,349 INFO L225 Difference]: With dead ends: 177 [2018-04-06 19:36:36,349 INFO L226 Difference]: Without dead ends: 167 [2018-04-06 19:36:36,349 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1957 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=1447, Invalid=10109, Unknown=0, NotChecked=0, Total=11556 [2018-04-06 19:36:36,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-04-06 19:36:36,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-04-06 19:36:36,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-04-06 19:36:36,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 169 transitions. [2018-04-06 19:36:36,360 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 169 transitions. Word has length 99 [2018-04-06 19:36:36,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:36:36,360 INFO L459 AbstractCegarLoop]: Abstraction has 167 states and 169 transitions. [2018-04-06 19:36:36,360 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-04-06 19:36:36,360 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 169 transitions. [2018-04-06 19:36:36,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-04-06 19:36:36,361 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:36:36,361 INFO L355 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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-06 19:36:36,361 INFO L408 AbstractCegarLoop]: === Iteration 37 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:36:36,361 INFO L82 PathProgramCache]: Analyzing trace with hash 359190884, now seen corresponding path program 2 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:36:36,367 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:36:36,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:36:36,418 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:36:36,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:36:36,430 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:36,437 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:36:36,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:36,445 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:36:36,446 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-06 19:36:36,457 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:36:36,458 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-06 19:36:36,458 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:36,465 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:36:36,466 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:36:36,466 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-06 19:36:36,466 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:36:36,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:36:36,470 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-06 19:36:37,218 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 0 proven. 452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:36:37,218 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:36:39,890 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 0 proven. 452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:36:39,911 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:36:39,912 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37] total 74 [2018-04-06 19:36:39,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-04-06 19:36:39,912 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-04-06 19:36:39,912 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=5054, Unknown=0, NotChecked=0, Total=5550 [2018-04-06 19:36:39,913 INFO L87 Difference]: Start difference. First operand 167 states and 169 transitions. Second operand 75 states. [2018-04-06 19:36:46,686 WARN L151 SmtUtils]: Spent 696ms on a formula simplification. DAG size of input: 131 DAG size of output 114 [2018-04-06 19:36:48,252 WARN L151 SmtUtils]: Spent 1002ms on a formula simplification. DAG size of input: 126 DAG size of output 124 [2018-04-06 19:36:48,807 WARN L151 SmtUtils]: Spent 418ms on a formula simplification. DAG size of input: 127 DAG size of output 123 [2018-04-06 19:36:50,634 WARN L151 SmtUtils]: Spent 1655ms on a formula simplification. DAG size of input: 177 DAG size of output 175 [2018-04-06 19:36:51,314 WARN L148 SmtUtils]: Spent 346ms on a formula simplification that was a NOOP. DAG size: 160 [2018-04-06 19:36:51,833 WARN L148 SmtUtils]: Spent 328ms on a formula simplification that was a NOOP. DAG size: 160 [2018-04-06 19:36:52,241 WARN L148 SmtUtils]: Spent 173ms on a formula simplification that was a NOOP. DAG size: 108 [2018-04-06 19:36:52,607 WARN L148 SmtUtils]: Spent 192ms on a formula simplification that was a NOOP. DAG size: 112 [2018-04-06 19:36:52,987 WARN L148 SmtUtils]: Spent 159ms on a formula simplification that was a NOOP. DAG size: 107 [2018-04-06 19:36:53,254 WARN L151 SmtUtils]: Spent 153ms on a formula simplification. DAG size of input: 102 DAG size of output 87 [2018-04-06 19:36:53,602 WARN L148 SmtUtils]: Spent 141ms on a formula simplification that was a NOOP. DAG size: 100 [2018-04-06 19:36:55,214 WARN L151 SmtUtils]: Spent 1462ms on a formula simplification. DAG size of input: 175 DAG size of output 168 [2018-04-06 19:36:55,696 WARN L148 SmtUtils]: Spent 278ms on a formula simplification that was a NOOP. DAG size: 146 [2018-04-06 19:36:56,226 WARN L148 SmtUtils]: Spent 287ms on a formula simplification that was a NOOP. DAG size: 144 [2018-04-06 19:36:56,701 WARN L148 SmtUtils]: Spent 281ms on a formula simplification that was a NOOP. DAG size: 144 [2018-04-06 19:36:57,258 WARN L148 SmtUtils]: Spent 310ms on a formula simplification that was a NOOP. DAG size: 154 [2018-04-06 19:36:57,617 WARN L148 SmtUtils]: Spent 136ms on a formula simplification that was a NOOP. DAG size: 97 [2018-04-06 19:36:57,957 WARN L148 SmtUtils]: Spent 169ms on a formula simplification that was a NOOP. DAG size: 101 [2018-04-06 19:36:58,250 WARN L148 SmtUtils]: Spent 103ms on a formula simplification that was a NOOP. DAG size: 96 [2018-04-06 19:36:58,474 WARN L151 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 91 DAG size of output 78 [2018-04-06 19:36:58,774 WARN L148 SmtUtils]: Spent 122ms on a formula simplification that was a NOOP. DAG size: 89 [2018-04-06 19:36:59,171 WARN L148 SmtUtils]: Spent 208ms on a formula simplification that was a NOOP. DAG size: 129 [2018-04-06 19:36:59,624 WARN L148 SmtUtils]: Spent 219ms on a formula simplification that was a NOOP. DAG size: 127 [2018-04-06 19:37:00,023 WARN L148 SmtUtils]: Spent 208ms on a formula simplification that was a NOOP. DAG size: 127 [2018-04-06 19:37:00,517 WARN L148 SmtUtils]: Spent 242ms on a formula simplification that was a NOOP. DAG size: 139 [2018-04-06 19:37:00,836 WARN L148 SmtUtils]: Spent 102ms on a formula simplification that was a NOOP. DAG size: 86 [2018-04-06 19:37:01,151 WARN L148 SmtUtils]: Spent 129ms on a formula simplification that was a NOOP. DAG size: 90 [2018-04-06 19:37:01,606 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 80 DAG size of output 69 [2018-04-06 19:37:02,184 WARN L148 SmtUtils]: Spent 157ms on a formula simplification that was a NOOP. DAG size: 112 [2018-04-06 19:37:02,578 WARN L148 SmtUtils]: Spent 162ms on a formula simplification that was a NOOP. DAG size: 110 [2018-04-06 19:37:02,915 WARN L148 SmtUtils]: Spent 150ms on a formula simplification that was a NOOP. DAG size: 110 [2018-04-06 19:37:03,337 WARN L148 SmtUtils]: Spent 181ms on a formula simplification that was a NOOP. DAG size: 122 [2018-04-06 19:37:04,663 WARN L148 SmtUtils]: Spent 108ms on a formula simplification that was a NOOP. DAG size: 95 [2018-04-06 19:37:04,967 WARN L148 SmtUtils]: Spent 113ms on a formula simplification that was a NOOP. DAG size: 93 [2018-04-06 19:37:05,252 WARN L148 SmtUtils]: Spent 118ms on a formula simplification that was a NOOP. DAG size: 93 [2018-04-06 19:37:05,583 WARN L148 SmtUtils]: Spent 131ms on a formula simplification that was a NOOP. DAG size: 105 [2018-04-06 19:37:12,561 WARN L151 SmtUtils]: Spent 1779ms on a formula simplification. DAG size of input: 181 DAG size of output 179 [2018-04-06 19:37:12,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:37:12,562 INFO L93 Difference]: Finished difference Result 328 states and 338 transitions. [2018-04-06 19:37:12,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-04-06 19:37:12,562 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 156 [2018-04-06 19:37:12,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:37:12,563 INFO L225 Difference]: With dead ends: 328 [2018-04-06 19:37:12,563 INFO L226 Difference]: Without dead ends: 305 [2018-04-06 19:37:12,565 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11003 ImplicationChecksByTransitivity, 33.3s TimeCoverageRelationStatistics Valid=5623, Invalid=41249, Unknown=0, NotChecked=0, Total=46872 [2018-04-06 19:37:12,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-04-06 19:37:12,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 295. [2018-04-06 19:37:12,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-04-06 19:37:12,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 305 transitions. [2018-04-06 19:37:12,584 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 305 transitions. Word has length 156 [2018-04-06 19:37:12,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:37:12,584 INFO L459 AbstractCegarLoop]: Abstraction has 295 states and 305 transitions. [2018-04-06 19:37:12,584 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-04-06 19:37:12,584 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 305 transitions. [2018-04-06 19:37:12,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-04-06 19:37:12,585 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:37:12,586 INFO L355 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 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-06 19:37:12,586 INFO L408 AbstractCegarLoop]: === Iteration 38 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:37:12,586 INFO L82 PathProgramCache]: Analyzing trace with hash 333270558, now seen corresponding path program 4 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:37:12,597 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:37:12,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:37:12,676 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:37:12,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:37:12,679 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:37:12,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:37:12,687 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:37:12,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:37:12,692 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-06 19:37:12,718 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:37:12,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-06 19:37:12,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:37:12,728 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:37:12,729 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:37:12,729 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-06 19:37:12,729 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:37:12,734 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-06 19:37:12,735 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-06 19:37:13,535 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 0 proven. 508 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:37:13,536 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:37:16,029 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 0 proven. 508 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:37:16,050 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:37:16,050 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37] total 74 [2018-04-06 19:37:16,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-04-06 19:37:16,051 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-04-06 19:37:16,051 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=5197, Unknown=0, NotChecked=0, Total=5550 [2018-04-06 19:37:16,052 INFO L87 Difference]: Start difference. First operand 295 states and 305 transitions. Second operand 75 states. [2018-04-06 19:37:21,384 WARN L151 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 107 DAG size of output 93 [2018-04-06 19:37:21,708 WARN L151 SmtUtils]: Spent 157ms on a formula simplification. DAG size of input: 112 DAG size of output 95 [2018-04-06 19:37:21,984 WARN L151 SmtUtils]: Spent 148ms on a formula simplification. DAG size of input: 109 DAG size of output 92 [2018-04-06 19:37:22,843 WARN L151 SmtUtils]: Spent 465ms on a formula simplification. DAG size of input: 162 DAG size of output 129 [2018-04-06 19:37:23,294 WARN L151 SmtUtils]: Spent 206ms on a formula simplification. DAG size of input: 163 DAG size of output 98 [2018-04-06 19:37:23,668 WARN L151 SmtUtils]: Spent 180ms on a formula simplification. DAG size of input: 107 DAG size of output 90 [2018-04-06 19:37:24,006 WARN L151 SmtUtils]: Spent 171ms on a formula simplification. DAG size of input: 111 DAG size of output 94 [2018-04-06 19:37:24,336 WARN L151 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 106 DAG size of output 89 [2018-04-06 19:37:24,650 WARN L151 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 103 DAG size of output 83 [2018-04-06 19:37:25,322 WARN L151 SmtUtils]: Spent 373ms on a formula simplification. DAG size of input: 155 DAG size of output 116 [2018-04-06 19:37:26,024 WARN L151 SmtUtils]: Spent 457ms on a formula simplification. DAG size of input: 145 DAG size of output 113 [2018-04-06 19:37:26,362 WARN L151 SmtUtils]: Spent 105ms on a formula simplification. DAG size of input: 91 DAG size of output 78 [2018-04-06 19:37:26,615 WARN L151 SmtUtils]: Spent 125ms on a formula simplification. DAG size of input: 95 DAG size of output 84 [2018-04-06 19:37:26,830 WARN L151 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 90 DAG size of output 77 [2018-04-06 19:37:27,496 WARN L151 SmtUtils]: Spent 326ms on a formula simplification. DAG size of input: 129 DAG size of output 94 [2018-04-06 19:37:27,938 WARN L151 SmtUtils]: Spent 301ms on a formula simplification. DAG size of input: 123 DAG size of output 95 [2018-04-06 19:37:28,432 WARN L151 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 84 DAG size of output 75 [2018-04-06 19:37:28,847 WARN L151 SmtUtils]: Spent 115ms on a formula simplification. DAG size of input: 76 DAG size of output 60 [2018-04-06 19:37:29,216 WARN L151 SmtUtils]: Spent 248ms on a formula simplification. DAG size of input: 112 DAG size of output 81 [2018-04-06 19:37:29,616 WARN L151 SmtUtils]: Spent 261ms on a formula simplification. DAG size of input: 106 DAG size of output 82 [2018-04-06 19:37:30,661 WARN L151 SmtUtils]: Spent 179ms on a formula simplification. DAG size of input: 95 DAG size of output 68 [2018-04-06 19:37:30,974 WARN L151 SmtUtils]: Spent 195ms on a formula simplification. DAG size of input: 89 DAG size of output 69 [2018-04-06 19:37:31,850 WARN L151 SmtUtils]: Spent 132ms on a formula simplification. DAG size of input: 78 DAG size of output 55 [2018-04-06 19:37:32,082 WARN L151 SmtUtils]: Spent 129ms on a formula simplification. DAG size of input: 72 DAG size of output 56 [2018-04-06 19:37:34,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:37:34,252 INFO L93 Difference]: Finished difference Result 296 states and 305 transitions. [2018-04-06 19:37:34,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-04-06 19:37:34,252 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 159 [2018-04-06 19:37:34,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:37:34,254 INFO L225 Difference]: With dead ends: 296 [2018-04-06 19:37:34,254 INFO L226 Difference]: Without dead ends: 295 [2018-04-06 19:37:34,256 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6153 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=3651, Invalid=27855, Unknown=0, NotChecked=0, Total=31506 [2018-04-06 19:37:34,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-04-06 19:37:34,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2018-04-06 19:37:34,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-04-06 19:37:34,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 297 transitions. [2018-04-06 19:37:34,283 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 297 transitions. Word has length 159 [2018-04-06 19:37:34,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:37:34,284 INFO L459 AbstractCegarLoop]: Abstraction has 295 states and 297 transitions. [2018-04-06 19:37:34,284 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-04-06 19:37:34,284 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 297 transitions. [2018-04-06 19:37:34,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-04-06 19:37:34,285 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:37:34,285 INFO L355 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 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-06 19:37:34,285 INFO L408 AbstractCegarLoop]: === Iteration 39 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:37:34,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1736013922, now seen corresponding path program 5 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:37:34,290 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:37:34,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:37:34,422 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:37:34,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:37:34,439 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:37:34,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:37:34,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:37:34,463 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:37:34,464 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-06 19:37:34,491 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:37:34,493 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-06 19:37:34,493 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:37:34,501 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:37:34,502 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:37:34,502 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-06 19:37:34,502 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:37:34,507 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-06 19:37:34,507 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-06 19:37:37,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1976 backedges. 0 proven. 1976 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:37:37,094 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-04-06 19:37:44,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1976 backedges. 0 proven. 1976 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:37:44,781 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-06 19:37:44,781 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 61] total 129 [2018-04-06 19:37:44,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-04-06 19:37:44,782 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-04-06 19:37:44,783 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1109, Invalid=15661, Unknown=0, NotChecked=0, Total=16770 [2018-04-06 19:37:44,783 INFO L87 Difference]: Start difference. First operand 295 states and 297 transitions. Second operand 130 states. [2018-04-06 19:37:47,979 WARN L151 SmtUtils]: Spent 366ms on a formula simplification. DAG size of input: 220 DAG size of output 187 [2018-04-06 19:37:48,892 WARN L151 SmtUtils]: Spent 377ms on a formula simplification. DAG size of input: 220 DAG size of output 183 [2018-04-06 19:37:50,917 WARN L151 SmtUtils]: Spent 381ms on a formula simplification. DAG size of input: 219 DAG size of output 182 [2018-04-06 19:37:53,159 WARN L151 SmtUtils]: Spent 372ms on a formula simplification. DAG size of input: 219 DAG size of output 182 [2018-04-06 19:37:55,422 WARN L151 SmtUtils]: Spent 364ms on a formula simplification. DAG size of input: 219 DAG size of output 182 [2018-04-06 19:37:57,438 WARN L151 SmtUtils]: Spent 341ms on a formula simplification. DAG size of input: 213 DAG size of output 176 [2018-04-06 19:38:09,339 WARN L151 SmtUtils]: Spent 299ms on a formula simplification. DAG size of input: 203 DAG size of output 173 [2018-04-06 19:38:10,138 WARN L151 SmtUtils]: Spent 382ms on a formula simplification. DAG size of input: 208 DAG size of output 175 [2018-04-06 19:38:10,887 WARN L151 SmtUtils]: Spent 388ms on a formula simplification. DAG size of input: 205 DAG size of output 172 [2018-04-06 19:38:13,093 WARN L151 SmtUtils]: Spent 1243ms on a formula simplification. DAG size of input: 306 DAG size of output 241 [2018-04-06 19:38:14,177 WARN L151 SmtUtils]: Spent 517ms on a formula simplification. DAG size of input: 307 DAG size of output 182 [2018-04-06 19:38:15,106 WARN L151 SmtUtils]: Spent 338ms on a formula simplification. DAG size of input: 203 DAG size of output 170 [2018-04-06 19:38:16,000 WARN L151 SmtUtils]: Spent 384ms on a formula simplification. DAG size of input: 207 DAG size of output 178 [2018-04-06 19:38:16,808 WARN L151 SmtUtils]: Spent 357ms on a formula simplification. DAG size of input: 202 DAG size of output 169 [2018-04-06 19:38:17,755 WARN L151 SmtUtils]: Spent 499ms on a formula simplification. DAG size of input: 199 DAG size of output 163 [2018-04-06 19:38:20,409 WARN L151 SmtUtils]: Spent 1635ms on a formula simplification. DAG size of input: 299 DAG size of output 228 [2018-04-06 19:38:22,007 WARN L151 SmtUtils]: Spent 960ms on a formula simplification. DAG size of input: 289 DAG size of output 225 [2018-04-06 19:38:23,148 WARN L151 SmtUtils]: Spent 323ms on a formula simplification. DAG size of input: 187 DAG size of output 158 [2018-04-06 19:38:23,853 WARN L151 SmtUtils]: Spent 301ms on a formula simplification. DAG size of input: 191 DAG size of output 164 [2018-04-06 19:38:24,518 WARN L151 SmtUtils]: Spent 263ms on a formula simplification. DAG size of input: 186 DAG size of output 157 [2018-04-06 19:38:25,249 WARN L151 SmtUtils]: Spent 264ms on a formula simplification. DAG size of input: 183 DAG size of output 149 [2018-04-06 19:38:25,924 WARN L151 SmtUtils]: Spent 239ms on a formula simplification. DAG size of input: 178 DAG size of output 152 [2018-04-06 19:38:26,638 WARN L151 SmtUtils]: Spent 441ms on a formula simplification. DAG size of input: 195 DAG size of output 98 [2018-04-06 19:38:27,889 WARN L151 SmtUtils]: Spent 752ms on a formula simplification. DAG size of input: 273 DAG size of output 206 [2018-04-06 19:38:29,228 WARN L151 SmtUtils]: Spent 756ms on a formula simplification. DAG size of input: 267 DAG size of output 207 [2018-04-06 19:38:30,166 WARN L151 SmtUtils]: Spent 280ms on a formula simplification. DAG size of input: 176 DAG size of output 149 [2018-04-06 19:38:30,851 WARN L151 SmtUtils]: Spent 295ms on a formula simplification. DAG size of input: 180 DAG size of output 155 [2018-04-06 19:38:31,440 WARN L151 SmtUtils]: Spent 238ms on a formula simplification. DAG size of input: 175 DAG size of output 148 [2018-04-06 19:38:32,029 WARN L151 SmtUtils]: Spent 235ms on a formula simplification. DAG size of input: 172 DAG size of output 140 [2018-04-06 19:38:32,629 WARN L151 SmtUtils]: Spent 235ms on a formula simplification. DAG size of input: 167 DAG size of output 143 [2018-04-06 19:38:33,249 WARN L151 SmtUtils]: Spent 388ms on a formula simplification. DAG size of input: 183 DAG size of output 93 [2018-04-06 19:38:34,322 WARN L151 SmtUtils]: Spent 639ms on a formula simplification. DAG size of input: 256 DAG size of output 193 [2018-04-06 19:38:35,489 WARN L151 SmtUtils]: Spent 649ms on a formula simplification. DAG size of input: 250 DAG size of output 194 [2018-04-06 19:38:36,370 WARN L151 SmtUtils]: Spent 259ms on a formula simplification. DAG size of input: 165 DAG size of output 140 [2018-04-06 19:38:37,030 WARN L151 SmtUtils]: Spent 289ms on a formula simplification. DAG size of input: 169 DAG size of output 146 [2018-04-06 19:38:37,626 WARN L151 SmtUtils]: Spent 239ms on a formula simplification. DAG size of input: 164 DAG size of output 139 [2018-04-06 19:38:38,186 WARN L151 SmtUtils]: Spent 224ms on a formula simplification. DAG size of input: 161 DAG size of output 131 [2018-04-06 19:38:38,754 WARN L151 SmtUtils]: Spent 199ms on a formula simplification. DAG size of input: 156 DAG size of output 134 [2018-04-06 19:38:39,324 WARN L151 SmtUtils]: Spent 343ms on a formula simplification. DAG size of input: 171 DAG size of output 88 [2018-04-06 19:38:40,335 WARN L151 SmtUtils]: Spent 567ms on a formula simplification. DAG size of input: 239 DAG size of output 180 [2018-04-06 19:38:41,403 WARN L151 SmtUtils]: Spent 564ms on a formula simplification. DAG size of input: 233 DAG size of output 181 [2018-04-06 19:38:42,231 WARN L151 SmtUtils]: Spent 237ms on a formula simplification. DAG size of input: 154 DAG size of output 131 [2018-04-06 19:38:43,041 WARN L151 SmtUtils]: Spent 277ms on a formula simplification. DAG size of input: 158 DAG size of output 137 [2018-04-06 19:38:43,577 WARN L151 SmtUtils]: Spent 209ms on a formula simplification. DAG size of input: 153 DAG size of output 130 [2018-04-06 19:38:44,136 WARN L151 SmtUtils]: Spent 207ms on a formula simplification. DAG size of input: 150 DAG size of output 122 [2018-04-06 19:38:44,685 WARN L151 SmtUtils]: Spent 180ms on a formula simplification. DAG size of input: 145 DAG size of output 125 [2018-04-06 19:38:45,188 WARN L151 SmtUtils]: Spent 279ms on a formula simplification. DAG size of input: 159 DAG size of output 83 [2018-04-06 19:38:46,116 WARN L151 SmtUtils]: Spent 515ms on a formula simplification. DAG size of input: 222 DAG size of output 167 [2018-04-06 19:38:47,110 WARN L151 SmtUtils]: Spent 512ms on a formula simplification. DAG size of input: 216 DAG size of output 168 [2018-04-06 19:38:47,903 WARN L151 SmtUtils]: Spent 209ms on a formula simplification. DAG size of input: 143 DAG size of output 122 [2018-04-06 19:38:48,455 WARN L151 SmtUtils]: Spent 219ms on a formula simplification. DAG size of input: 147 DAG size of output 128 [2018-04-06 19:38:48,973 WARN L151 SmtUtils]: Spent 177ms on a formula simplification. DAG size of input: 142 DAG size of output 121 [2018-04-06 19:38:49,486 WARN L151 SmtUtils]: Spent 193ms on a formula simplification. DAG size of input: 139 DAG size of output 113 [2018-04-06 19:38:49,977 WARN L151 SmtUtils]: Spent 176ms on a formula simplification. DAG size of input: 134 DAG size of output 116 [2018-04-06 19:38:50,434 WARN L151 SmtUtils]: Spent 243ms on a formula simplification. DAG size of input: 147 DAG size of output 78 [2018-04-06 19:38:51,289 WARN L151 SmtUtils]: Spent 463ms on a formula simplification. DAG size of input: 205 DAG size of output 154 [2018-04-06 19:38:52,239 WARN L151 SmtUtils]: Spent 446ms on a formula simplification. DAG size of input: 199 DAG size of output 155 [2018-04-06 19:38:52,952 WARN L151 SmtUtils]: Spent 168ms on a formula simplification. DAG size of input: 132 DAG size of output 113 [2018-04-06 19:38:53,500 WARN L151 SmtUtils]: Spent 196ms on a formula simplification. DAG size of input: 136 DAG size of output 119 [2018-04-06 19:38:53,994 WARN L151 SmtUtils]: Spent 166ms on a formula simplification. DAG size of input: 131 DAG size of output 112 [2018-04-06 19:38:54,490 WARN L151 SmtUtils]: Spent 186ms on a formula simplification. DAG size of input: 128 DAG size of output 104 [2018-04-06 19:38:54,966 WARN L151 SmtUtils]: Spent 158ms on a formula simplification. DAG size of input: 123 DAG size of output 107 [2018-04-06 19:38:55,406 WARN L151 SmtUtils]: Spent 223ms on a formula simplification. DAG size of input: 135 DAG size of output 73 [2018-04-06 19:38:56,181 WARN L151 SmtUtils]: Spent 399ms on a formula simplification. DAG size of input: 188 DAG size of output 141 [2018-04-06 19:38:57,000 WARN L151 SmtUtils]: Spent 378ms on a formula simplification. DAG size of input: 182 DAG size of output 142 [2018-04-06 19:38:57,669 WARN L151 SmtUtils]: Spent 173ms on a formula simplification. DAG size of input: 121 DAG size of output 104 [2018-04-06 19:38:58,215 WARN L151 SmtUtils]: Spent 211ms on a formula simplification. DAG size of input: 125 DAG size of output 110 [2018-04-06 19:38:58,657 WARN L151 SmtUtils]: Spent 154ms on a formula simplification. DAG size of input: 120 DAG size of output 103 [2018-04-06 19:38:59,081 WARN L151 SmtUtils]: Spent 141ms on a formula simplification. DAG size of input: 117 DAG size of output 95 [2018-04-06 19:38:59,516 WARN L151 SmtUtils]: Spent 130ms on a formula simplification. DAG size of input: 112 DAG size of output 98 [2018-04-06 19:38:59,913 WARN L151 SmtUtils]: Spent 193ms on a formula simplification. DAG size of input: 123 DAG size of output 68 [2018-04-06 19:39:00,691 WARN L151 SmtUtils]: Spent 351ms on a formula simplification. DAG size of input: 171 DAG size of output 128 [2018-04-06 19:39:01,464 WARN L151 SmtUtils]: Spent 344ms on a formula simplification. DAG size of input: 165 DAG size of output 129 [2018-04-06 19:39:02,080 WARN L151 SmtUtils]: Spent 163ms on a formula simplification. DAG size of input: 110 DAG size of output 95 [2018-04-06 19:39:02,542 WARN L151 SmtUtils]: Spent 172ms on a formula simplification. DAG size of input: 114 DAG size of output 101 [2018-04-06 19:39:02,985 WARN L151 SmtUtils]: Spent 137ms on a formula simplification. DAG size of input: 109 DAG size of output 94 [2018-04-06 19:39:03,388 WARN L151 SmtUtils]: Spent 132ms on a formula simplification. DAG size of input: 106 DAG size of output 86 [2018-04-06 19:39:03,787 WARN L151 SmtUtils]: Spent 124ms on a formula simplification. DAG size of input: 101 DAG size of output 89 [2018-04-06 19:39:04,174 WARN L151 SmtUtils]: Spent 193ms on a formula simplification. DAG size of input: 111 DAG size of output 63 [2018-04-06 19:39:04,785 WARN L151 SmtUtils]: Spent 285ms on a formula simplification. DAG size of input: 154 DAG size of output 115 [2018-04-06 19:39:05,457 WARN L151 SmtUtils]: Spent 288ms on a formula simplification. DAG size of input: 148 DAG size of output 116 [2018-04-06 19:39:06,008 WARN L151 SmtUtils]: Spent 121ms on a formula simplification. DAG size of input: 99 DAG size of output 86 [2018-04-06 19:39:06,432 WARN L151 SmtUtils]: Spent 144ms on a formula simplification. DAG size of input: 103 DAG size of output 92 [2018-04-06 19:39:06,802 WARN L151 SmtUtils]: Spent 114ms on a formula simplification. DAG size of input: 98 DAG size of output 85 [2018-04-06 19:39:07,153 WARN L151 SmtUtils]: Spent 107ms on a formula simplification. DAG size of input: 95 DAG size of output 77 [2018-04-06 19:39:07,853 WARN L151 SmtUtils]: Spent 154ms on a formula simplification. DAG size of input: 99 DAG size of output 58 [2018-04-06 19:39:08,524 WARN L151 SmtUtils]: Spent 363ms on a formula simplification. DAG size of input: 137 DAG size of output 102 [2018-04-06 19:39:09,212 WARN L151 SmtUtils]: Spent 340ms on a formula simplification. DAG size of input: 131 DAG size of output 103 [2018-04-06 19:39:10,062 WARN L151 SmtUtils]: Spent 122ms on a formula simplification. DAG size of input: 92 DAG size of output 83 [2018-04-06 19:39:11,337 WARN L151 SmtUtils]: Spent 128ms on a formula simplification. DAG size of input: 87 DAG size of output 53 [2018-04-06 19:39:11,901 WARN L151 SmtUtils]: Spent 286ms on a formula simplification. DAG size of input: 120 DAG size of output 89 [2018-04-06 19:39:12,494 WARN L151 SmtUtils]: Spent 279ms on a formula simplification. DAG size of input: 114 DAG size of output 90 [2018-04-06 19:39:13,269 WARN L151 SmtUtils]: Spent 104ms on a formula simplification. DAG size of input: 81 DAG size of output 74 [2018-04-06 19:39:14,378 WARN L151 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 75 DAG size of output 48 [2018-04-06 19:39:14,840 WARN L151 SmtUtils]: Spent 214ms on a formula simplification. DAG size of input: 103 DAG size of output 76 [2018-04-06 19:39:15,332 WARN L151 SmtUtils]: Spent 214ms on a formula simplification. DAG size of input: 97 DAG size of output 77 [2018-04-06 19:39:17,357 WARN L151 SmtUtils]: Spent 156ms on a formula simplification. DAG size of input: 86 DAG size of output 63 [2018-04-06 19:39:17,743 WARN L151 SmtUtils]: Spent 146ms on a formula simplification. DAG size of input: 80 DAG size of output 64 [2018-04-06 19:39:22,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-06 19:39:22,430 INFO L93 Difference]: Finished difference Result 585 states and 616 transitions. [2018-04-06 19:39:22,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 244 states. [2018-04-06 19:39:22,430 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 279 [2018-04-06 19:39:22,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-06 19:39:22,432 INFO L225 Difference]: With dead ends: 585 [2018-04-06 19:39:22,432 INFO L226 Difference]: Without dead ends: 527 [2018-04-06 19:39:22,440 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 797 GetRequests, 429 SyntacticMatches, 0 SemanticMatches, 368 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31975 ImplicationChecksByTransitivity, 99.6s TimeCoverageRelationStatistics Valid=14377, Invalid=122153, Unknown=0, NotChecked=0, Total=136530 [2018-04-06 19:39:22,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2018-04-06 19:39:22,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2018-04-06 19:39:22,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2018-04-06 19:39:22,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 529 transitions. [2018-04-06 19:39:22,495 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 529 transitions. Word has length 279 [2018-04-06 19:39:22,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-06 19:39:22,496 INFO L459 AbstractCegarLoop]: Abstraction has 527 states and 529 transitions. [2018-04-06 19:39:22,496 INFO L460 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-04-06 19:39:22,496 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 529 transitions. [2018-04-06 19:39:22,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2018-04-06 19:39:22,499 INFO L347 BasicCegarLoop]: Found error trace [2018-04-06 19:39:22,500 INFO L355 BasicCegarLoop]: trace histogram [33, 33, 33, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 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-06 19:39:22,500 INFO L408 AbstractCegarLoop]: === Iteration 40 === [__U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr5RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr7RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr2RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr4RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr6RequiresViolation, __U_MULTI_fopenbsd_cstrlcpy_alloca_true_valid_memsafety_true_termination_i__cstrlcpyErr0RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr4EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-06 19:39:22,500 INFO L82 PathProgramCache]: Analyzing trace with hash -524028700, now seen corresponding path program 3 times No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-04-06 19:39:22,510 INFO L68 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-04-06 19:39:22,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-06 19:39:22,754 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-06 19:39:22,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:39:22,757 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:39:22,764 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-06 19:39:22,765 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:39:22,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-06 19:39:22,770 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-06 19:39:22,792 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:39:22,793 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-06 19:39:22,794 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-06 19:39:22,808 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:39:22,808 INFO L700 Elim1Store]: detected not equals via solver [2018-04-06 19:39:22,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-06 19:39:22,809 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-06 19:39:22,813 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-06 19:39:22,814 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:13 [2018-04-06 19:39:28,798 INFO L134 CoverageAnalysis]: Checked inductivity of 7568 backedges. 0 proven. 7568 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-06 19:39:28,799 INFO L314 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2018-04-06 19:39:45,601 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-06 19:39:45,601 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-06 19:39:45,604 WARN L197 ceAbstractionStarter]: Timeout [2018-04-06 19:39:45,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.04 07:39:45 BoogieIcfgContainer [2018-04-06 19:39:45,605 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-06 19:39:45,605 INFO L168 Benchmark]: Toolchain (without parser) took 253899.28 ms. Allocated memory was 310.4 MB in the beginning and 450.9 MB in the end (delta: 140.5 MB). Free memory was 247.9 MB in the beginning and 357.5 MB in the end (delta: -109.5 MB). Peak memory consumption was 132.1 MB. Max. memory is 5.3 GB. [2018-04-06 19:39:45,606 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 310.4 MB. Free memory is still 272.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-06 19:39:45,607 INFO L168 Benchmark]: CACSL2BoogieTranslator took 327.03 ms. Allocated memory is still 310.4 MB. Free memory was 247.9 MB in the beginning and 223.9 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 5.3 GB. [2018-04-06 19:39:45,607 INFO L168 Benchmark]: Boogie Preprocessor took 60.05 ms. Allocated memory is still 310.4 MB. Free memory was 223.9 MB in the beginning and 220.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. [2018-04-06 19:39:45,607 INFO L168 Benchmark]: RCFGBuilder took 582.01 ms. Allocated memory was 310.4 MB in the beginning and 454.6 MB in the end (delta: 144.2 MB). Free memory was 220.9 MB in the beginning and 388.0 MB in the end (delta: -167.0 MB). Peak memory consumption was 21.1 MB. Max. memory is 5.3 GB. [2018-04-06 19:39:45,607 INFO L168 Benchmark]: TraceAbstraction took 252926.24 ms. Allocated memory was 454.6 MB in the beginning and 450.9 MB in the end (delta: -3.7 MB). Free memory was 386.9 MB in the beginning and 357.5 MB in the end (delta: 29.4 MB). Peak memory consumption was 126.9 MB. Max. memory is 5.3 GB. [2018-04-06 19:39:45,609 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.17 ms. Allocated memory is still 310.4 MB. Free memory is still 272.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 327.03 ms. Allocated memory is still 310.4 MB. Free memory was 247.9 MB in the beginning and 223.9 MB in the end (delta: 24.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 60.05 ms. Allocated memory is still 310.4 MB. Free memory was 223.9 MB in the beginning and 220.9 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 582.01 ms. Allocated memory was 310.4 MB in the beginning and 454.6 MB in the end (delta: 144.2 MB). Free memory was 220.9 MB in the beginning and 388.0 MB in the end (delta: -167.0 MB). Peak memory consumption was 21.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 252926.24 ms. Allocated memory was 454.6 MB in the beginning and 450.9 MB in the end (delta: -3.7 MB). Free memory was 386.9 MB in the beginning and 357.5 MB in the end (delta: 29.4 MB). Peak memory consumption was 126.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 554]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was analyzing trace of length 517 with TraceHistMax 33, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 193 known predicates. - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 517 with TraceHistMax 33, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 193 known predicates. - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 517 with TraceHistMax 33, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 193 known predicates. - TimeoutResultAtElement [Line: 555]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was analyzing trace of length 517 with TraceHistMax 33, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 193 known predicates. - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 517 with TraceHistMax 33, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 193 known predicates. - TimeoutResultAtElement [Line: 554]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 554). Cancelled while BasicCegarLoop was analyzing trace of length 517 with TraceHistMax 33, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 193 known predicates. - TimeoutResultAtElement [Line: 555]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 555). Cancelled while BasicCegarLoop was analyzing trace of length 517 with TraceHistMax 33, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 193 known predicates. - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 517 with TraceHistMax 33, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 193 known predicates. - TimeoutResultAtElement [Line: 572]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 572). Cancelled while BasicCegarLoop was analyzing trace of length 517 with TraceHistMax 33, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 193 known predicates. - TimeoutResultAtElement [Line: 571]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 571). Cancelled while BasicCegarLoop was analyzing trace of length 517 with TraceHistMax 33, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 193 known predicates. - TimeoutResultAtElement [Line: 572]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 572). Cancelled while BasicCegarLoop was analyzing trace of length 517 with TraceHistMax 33, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 193 known predicates. - TimeoutResultAtElement [Line: 560]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 560). Cancelled while BasicCegarLoop was analyzing trace of length 517 with TraceHistMax 33, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 193 known predicates. - TimeoutResultAtElement [Line: 571]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 571). Cancelled while BasicCegarLoop was analyzing trace of length 517 with TraceHistMax 33, while TraceCheckSpWp was constructing backward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 193 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 97 locations, 13 error locations. TIMEOUT Result, 252.8s OverallTime, 40 OverallIterations, 33 TraceHistogramMax, 189.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2899 SDtfs, 20072 SDslu, 36244 SDs, 0 SdLazy, 30811 SolverSat, 3140 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 23.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5658 GetRequests, 3690 SyntacticMatches, 29 SemanticMatches, 1939 ConstructedPredicates, 20 IntricatePredicates, 0 DeprecatedPredicates, 61239 ImplicationChecksByTransitivity, 194.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=527occurred in iteration=39, 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.4s AutomataMinimizationTime, 39 MinimizatonAttempts, 740 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 37.1s InterpolantComputationTime, 2344 NumberOfCodeBlocks, 2344 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 4610 ConstructedInterpolants, 433 QuantifiedInterpolants, 7146041 SizeOfPredicates, 713 NumberOfNonLiveVariables, 7025 ConjunctsInSsa, 1497 ConjunctsInUnsatCore, 78 InterpolantComputations, 46 PerfectInterpolantSequences, 46/6768 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-06_19-39-45-616.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Fixed_noBitfields+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-06_19-39-45-616.csv Completed graceful shutdown