java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/array-memsafety/openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 15:12:44,420 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 15:12:44,421 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 15:12:44,432 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 15:12:44,432 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 15:12:44,433 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 15:12:44,434 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 15:12:44,435 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 15:12:44,436 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 15:12:44,437 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 15:12:44,438 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 15:12:44,438 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 15:12:44,439 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 15:12:44,440 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 15:12:44,440 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 15:12:44,442 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 15:12:44,444 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 15:12:44,445 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 15:12:44,446 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 15:12:44,447 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 15:12:44,448 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 15:12:44,449 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 15:12:44,449 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 15:12:44,450 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 15:12:44,450 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 15:12:44,451 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 15:12:44,451 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 15:12:44,452 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 15:12:44,452 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 15:12:44,453 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 15:12:44,453 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 15:12:44,453 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-04-11 15:12:44,474 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 15:12:44,475 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 15:12:44,476 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 15:12:44,476 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 15:12:44,476 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 15:12:44,476 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 15:12:44,476 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 15:12:44,476 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 15:12:44,476 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 15:12:44,477 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 15:12:44,477 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 15:12:44,477 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 15:12:44,477 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 15:12:44,477 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 15:12:44,477 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 15:12:44,478 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 15:12:44,478 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 15:12:44,478 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 15:12:44,478 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 15:12:44,478 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 15:12:44,478 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 15:12:44,478 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 15:12:44,479 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 15:12:44,479 INFO L133 SettingsManager]: * Trace refinement strategy=SMTINTERPOL Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-04-11 15:12:44,506 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 15:12:44,517 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 15:12:44,520 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 15:12:44,521 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 15:12:44,522 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 15:12:44,522 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,809 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGd63bb253c [2018-04-11 15:12:44,954 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 15:12:44,956 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 15:12:44,956 INFO L168 CDTParser]: Scanning openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,965 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 15:12:44,966 INFO L215 ultiparseSymbolTable]: [2018-04-11 15:12:44,966 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 15:12:44,966 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpy ('cstpcpy') in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,966 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____bswap_64 ('__bswap_64') in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,966 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,966 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____bswap_32 ('__bswap_32') in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,966 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 15:12:44,966 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____u_char in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,966 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__pthread_key_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,967 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____off64_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,967 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____blksize_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,967 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__blksize_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,967 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____qaddr_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,967 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__u_quad_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,967 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__int16_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,967 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____dev_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,967 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____fsblkcnt_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,967 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__uid_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,967 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__lldiv_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,968 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____caddr_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,968 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__fd_set in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,968 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____u_long in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,968 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__div_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,968 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__u_char in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,968 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__time_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,968 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__ulong in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,968 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__caddr_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,968 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____pthread_list_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,968 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__pthread_barrierattr_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,968 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__blkcnt_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,969 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__pthread_rwlock_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,969 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__sigset_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,969 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____uint32_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,969 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____int16_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,969 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____intptr_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,969 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____u_quad_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,969 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____gid_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,969 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__size_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,969 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____ssize_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,969 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__pthread_mutexattr_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,970 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____quad_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,970 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____pid_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,970 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____ino64_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,970 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__key_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,970 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____socklen_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,970 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__int32_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,970 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____rlim_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,970 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__pthread_rwlockattr_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,970 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____blkcnt64_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,970 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____off_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,970 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__pthread_barrier_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,970 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__fd_mask in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,970 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__fsfilcnt_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,970 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____int32_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,970 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____nlink_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,970 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____suseconds_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,971 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__timer_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,971 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__u_int32_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,971 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__clockid_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,971 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__u_int8_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,971 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__u_int in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,971 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__pthread_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,971 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____id_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,971 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____syscall_ulong_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,971 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____timer_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,971 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__fsblkcnt_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,971 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____sig_atomic_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,971 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____int64_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,971 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__pthread_attr_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,971 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____uid_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,971 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____fd_mask in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,971 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__nlink_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,971 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____fsblkcnt64_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,971 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__uint in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,971 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__wchar_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,971 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____useconds_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,972 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__loff_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,972 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__ssize_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,972 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____uint64_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,972 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____fsword_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,972 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__pthread_spinlock_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,972 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__u_int16_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,972 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__register_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,972 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__quad_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,972 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__off_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,972 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____u_int in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,972 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__u_short in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,972 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____clockid_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,972 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____sigset_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,973 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__pthread_cond_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,973 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____blkcnt_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,973 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__id_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,973 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__pthread_once_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,973 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__dev_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,973 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__u_long in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,973 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____mode_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,973 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____fsid_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,973 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____syscall_slong_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,973 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____ino_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,973 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____time_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,973 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__int8_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,974 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____u_short in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,974 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__u_int64_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,974 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__pthread_mutex_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,974 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____fsfilcnt64_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,974 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__clock_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,974 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__suseconds_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,974 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__ushort in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,974 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__gid_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,974 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__ldiv_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,974 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__ino_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,974 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__pid_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,974 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____clock_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____uint8_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____daddr_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____key_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__mode_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__fsid_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____int8_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__int64_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____loff_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__daddr_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____rlim64_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,975 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____fsfilcnt_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____uint16_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____WAIT_STATUS in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,976 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__pthread_condattr_t in openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:44,989 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGd63bb253c [2018-04-11 15:12:44,993 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 15:12:44,994 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 15:12:44,994 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 15:12:44,995 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 15:12:44,999 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 15:12:44,999 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 03:12:44" (1/1) ... [2018-04-11 15:12:45,001 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e63f6d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:12:45, skipping insertion in model container [2018-04-11 15:12:45,001 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 03:12:44" (1/1) ... [2018-04-11 15:12:45,011 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 15:12:45,028 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 15:12:45,132 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 15:12:45,165 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 15:12:45,170 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-11 15:12:45,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:12:45 WrapperNode [2018-04-11 15:12:45,198 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 15:12:45,198 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 15:12:45,199 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 15:12:45,199 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 15:12:45,206 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:12:45" (1/1) ... [2018-04-11 15:12:45,206 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:12:45" (1/1) ... [2018-04-11 15:12:45,216 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:12:45" (1/1) ... [2018-04-11 15:12:45,216 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:12:45" (1/1) ... [2018-04-11 15:12:45,222 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:12:45" (1/1) ... [2018-04-11 15:12:45,226 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:12:45" (1/1) ... [2018-04-11 15:12:45,228 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:12:45" (1/1) ... [2018-04-11 15:12:45,231 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 15:12:45,231 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 15:12:45,231 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 15:12:45,231 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 15:12:45,232 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:12:45" (1/1) ... No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 15:12:45,325 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 15:12:45,325 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 15:12:45,325 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-11 15:12:45,325 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-11 15:12:45,325 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpy [2018-04-11 15:12:45,325 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 15:12:45,325 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-11 15:12:45,326 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-11 15:12:45,326 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 15:12:45,326 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 15:12:45,326 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 15:12:45,326 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 15:12:45,326 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 15:12:45,326 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 15:12:45,326 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 15:12:45,326 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 15:12:45,326 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 15:12:45,326 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 15:12:45,326 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 15:12:45,327 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 15:12:45,327 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 15:12:45,327 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 15:12:45,327 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 15:12:45,327 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 15:12:45,327 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 15:12:45,327 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 15:12:45,327 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 15:12:45,327 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 15:12:45,327 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 15:12:45,327 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 15:12:45,328 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 15:12:45,328 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 15:12:45,328 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 15:12:45,328 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 15:12:45,328 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 15:12:45,328 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 15:12:45,328 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 15:12:45,328 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 15:12:45,328 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 15:12:45,329 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 15:12:45,329 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 15:12:45,329 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 15:12:45,329 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 15:12:45,329 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 15:12:45,329 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 15:12:45,329 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 15:12:45,329 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 15:12:45,329 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 15:12:45,329 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 15:12:45,330 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 15:12:45,330 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 15:12:45,330 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 15:12:45,330 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 15:12:45,330 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 15:12:45,330 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 15:12:45,330 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 15:12:45,330 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 15:12:45,330 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 15:12:45,331 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 15:12:45,331 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 15:12:45,331 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 15:12:45,331 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 15:12:45,331 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 15:12:45,331 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 15:12:45,331 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 15:12:45,331 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 15:12:45,331 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 15:12:45,331 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 15:12:45,332 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 15:12:45,332 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 15:12:45,332 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 15:12:45,332 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 15:12:45,332 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 15:12:45,332 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 15:12:45,332 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 15:12:45,332 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 15:12:45,332 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 15:12:45,332 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 15:12:45,332 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 15:12:45,332 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 15:12:45,332 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 15:12:45,332 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 15:12:45,332 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 15:12:45,333 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 15:12:45,333 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 15:12:45,333 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 15:12:45,333 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 15:12:45,333 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 15:12:45,333 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 15:12:45,333 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 15:12:45,333 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 15:12:45,333 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 15:12:45,333 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 15:12:45,333 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 15:12:45,333 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 15:12:45,333 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 15:12:45,333 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 15:12:45,333 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 15:12:45,334 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 15:12:45,334 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 15:12:45,334 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 15:12:45,334 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 15:12:45,334 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 15:12:45,334 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 15:12:45,334 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 15:12:45,334 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 15:12:45,334 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 15:12:45,334 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 15:12:45,335 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 15:12:45,335 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpy [2018-04-11 15:12:45,335 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 15:12:45,335 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 15:12:45,335 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 15:12:45,335 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 15:12:45,335 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 15:12:45,335 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 15:12:45,335 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 15:12:45,336 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 15:12:45,580 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 15:12:45,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 03:12:45 BoogieIcfgContainer [2018-04-11 15:12:45,581 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 15:12:45,581 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 15:12:45,581 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 15:12:45,583 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 15:12:45,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 03:12:44" (1/3) ... [2018-04-11 15:12:45,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71e417b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 03:12:45, skipping insertion in model container [2018-04-11 15:12:45,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:12:45" (2/3) ... [2018-04-11 15:12:45,584 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71e417b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 03:12:45, skipping insertion in model container [2018-04-11 15:12:45,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 03:12:45" (3/3) ... [2018-04-11 15:12:45,585 INFO L107 eAbstractionObserver]: Analyzing ICFG openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:12:45,590 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 15:12:45,594 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-04-11 15:12:45,620 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 15:12:45,620 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 15:12:45,620 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 15:12:45,620 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 15:12:45,621 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 15:12:45,621 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 15:12:45,621 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 15:12:45,621 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 15:12:45,621 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 15:12:45,621 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 15:12:45,629 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-04-11 15:12:45,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-04-11 15:12:45,634 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:12:45,634 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:12:45,635 INFO L408 AbstractCegarLoop]: === Iteration 1 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:12:45,637 INFO L82 PathProgramCache]: Analyzing trace with hash -449322580, now seen corresponding path program 1 times [2018-04-11 15:12:45,638 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:12:45,638 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:12:45,665 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:45,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:12:45,665 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:45,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:12:45,693 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:12:45,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:12:45,733 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:12:45,733 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 15:12:45,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 15:12:45,742 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 15:12:45,742 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:12:45,743 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 4 states. [2018-04-11 15:12:45,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:12:45,788 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-04-11 15:12:45,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 15:12:45,789 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2018-04-11 15:12:45,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:12:45,795 INFO L225 Difference]: With dead ends: 44 [2018-04-11 15:12:45,795 INFO L226 Difference]: Without dead ends: 40 [2018-04-11 15:12:45,796 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:12:45,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-04-11 15:12:45,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-04-11 15:12:45,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-04-11 15:12:45,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-04-11 15:12:45,816 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 10 [2018-04-11 15:12:45,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:12:45,816 INFO L459 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-04-11 15:12:45,816 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 15:12:45,816 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-04-11 15:12:45,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-04-11 15:12:45,817 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:12:45,817 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:12:45,817 INFO L408 AbstractCegarLoop]: === Iteration 2 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:12:45,817 INFO L82 PathProgramCache]: Analyzing trace with hash -449320658, now seen corresponding path program 1 times [2018-04-11 15:12:45,817 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:12:45,817 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:12:45,818 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:45,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:12:45,818 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:45,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:12:45,825 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:12:45,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:12:45,839 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:12:45,839 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-04-11 15:12:45,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-04-11 15:12:45,841 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-04-11 15:12:45,841 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 15:12:45,841 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 3 states. [2018-04-11 15:12:45,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:12:45,870 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-04-11 15:12:45,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-04-11 15:12:45,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-04-11 15:12:45,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:12:45,871 INFO L225 Difference]: With dead ends: 39 [2018-04-11 15:12:45,871 INFO L226 Difference]: Without dead ends: 38 [2018-04-11 15:12:45,871 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-04-11 15:12:45,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-04-11 15:12:45,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-04-11 15:12:45,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-04-11 15:12:45,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-04-11 15:12:45,874 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 10 [2018-04-11 15:12:45,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:12:45,874 INFO L459 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-04-11 15:12:45,874 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-04-11 15:12:45,874 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-04-11 15:12:45,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-11 15:12:45,874 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:12:45,874 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:12:45,874 INFO L408 AbstractCegarLoop]: === Iteration 3 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:12:45,875 INFO L82 PathProgramCache]: Analyzing trace with hash -556014976, now seen corresponding path program 1 times [2018-04-11 15:12:45,875 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:12:45,875 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:12:45,875 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:45,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:12:45,875 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:45,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:12:45,886 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:12:45,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:12:45,911 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:12:45,912 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:12:45,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 15:12:45,912 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 15:12:45,912 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:12:45,912 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 4 states. [2018-04-11 15:12:45,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:12:45,961 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-04-11 15:12:45,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 15:12:45,962 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-04-11 15:12:45,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:12:45,962 INFO L225 Difference]: With dead ends: 36 [2018-04-11 15:12:45,962 INFO L226 Difference]: Without dead ends: 36 [2018-04-11 15:12:45,963 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:12:45,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-04-11 15:12:45,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-04-11 15:12:45,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-04-11 15:12:45,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-04-11 15:12:45,966 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 14 [2018-04-11 15:12:45,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:12:45,966 INFO L459 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-04-11 15:12:45,966 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 15:12:45,966 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-04-11 15:12:45,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-04-11 15:12:45,966 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:12:45,966 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:12:45,966 INFO L408 AbstractCegarLoop]: === Iteration 4 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:12:45,967 INFO L82 PathProgramCache]: Analyzing trace with hash -556014975, now seen corresponding path program 1 times [2018-04-11 15:12:45,967 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:12:45,967 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:12:45,967 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:45,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:12:45,968 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:45,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:12:45,978 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:12:46,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:12:46,016 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:12:46,016 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 15:12:46,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:12:46,016 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:12:46,016 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:12:46,016 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 5 states. [2018-04-11 15:12:46,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:12:46,045 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-04-11 15:12:46,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:12:46,045 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-04-11 15:12:46,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:12:46,046 INFO L225 Difference]: With dead ends: 35 [2018-04-11 15:12:46,046 INFO L226 Difference]: Without dead ends: 35 [2018-04-11 15:12:46,046 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:12:46,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-04-11 15:12:46,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-04-11 15:12:46,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-04-11 15:12:46,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-04-11 15:12:46,048 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 14 [2018-04-11 15:12:46,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:12:46,048 INFO L459 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-04-11 15:12:46,048 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:12:46,048 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-04-11 15:12:46,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-11 15:12:46,048 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:12:46,048 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:12:46,048 INFO L408 AbstractCegarLoop]: === Iteration 5 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:12:46,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1899342595, now seen corresponding path program 1 times [2018-04-11 15:12:46,049 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:12:46,049 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:12:46,049 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:46,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:12:46,049 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:46,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:12:46,057 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:12:46,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:12:46,096 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:12:46,096 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 15:12:46,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:12:46,097 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:12:46,097 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:12:46,097 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 5 states. [2018-04-11 15:12:46,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:12:46,125 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-04-11 15:12:46,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 15:12:46,125 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-04-11 15:12:46,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:12:46,126 INFO L225 Difference]: With dead ends: 34 [2018-04-11 15:12:46,126 INFO L226 Difference]: Without dead ends: 34 [2018-04-11 15:12:46,126 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:12:46,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-04-11 15:12:46,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-04-11 15:12:46,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-04-11 15:12:46,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-04-11 15:12:46,128 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 18 [2018-04-11 15:12:46,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:12:46,128 INFO L459 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-04-11 15:12:46,128 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:12:46,128 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-04-11 15:12:46,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-11 15:12:46,128 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:12:46,129 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:12:46,129 INFO L408 AbstractCegarLoop]: === Iteration 6 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:12:46,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1899342596, now seen corresponding path program 1 times [2018-04-11 15:12:46,129 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:12:46,129 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:12:46,129 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:46,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:12:46,130 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:46,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:12:46,140 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:12:46,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:12:46,206 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:12:46,206 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 15:12:46,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 15:12:46,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 15:12:46,207 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-04-11 15:12:46,207 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 8 states. [2018-04-11 15:12:46,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:12:46,291 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-04-11 15:12:46,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 15:12:46,291 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-04-11 15:12:46,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:12:46,293 INFO L225 Difference]: With dead ends: 44 [2018-04-11 15:12:46,293 INFO L226 Difference]: Without dead ends: 44 [2018-04-11 15:12:46,293 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-04-11 15:12:46,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-04-11 15:12:46,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2018-04-11 15:12:46,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-04-11 15:12:46,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-04-11 15:12:46,296 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 18 [2018-04-11 15:12:46,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:12:46,296 INFO L459 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-04-11 15:12:46,296 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 15:12:46,296 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-04-11 15:12:46,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-11 15:12:46,297 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:12:46,297 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:12:46,297 INFO L408 AbstractCegarLoop]: === Iteration 7 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:12:46,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1249921719, now seen corresponding path program 1 times [2018-04-11 15:12:46,297 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:12:46,297 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:12:46,298 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:46,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:12:46,298 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:46,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:12:46,310 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:12:46,315 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:12:46,315 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:12:46,316 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:12:46,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:12:46,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:12:46,345 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:12:46,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:12:46,368 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:46,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:46,369 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 15:12:46,378 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 15:12:46,378 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:46,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:12:46,382 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-11 15:12:46,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:12:46,399 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:12:46,399 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 15:12:46,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 15:12:46,399 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 15:12:46,399 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:12:46,399 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 6 states. [2018-04-11 15:12:46,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:12:46,458 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-04-11 15:12:46,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:12:46,458 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-04-11 15:12:46,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:12:46,459 INFO L225 Difference]: With dead ends: 35 [2018-04-11 15:12:46,459 INFO L226 Difference]: Without dead ends: 35 [2018-04-11 15:12:46,459 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-04-11 15:12:46,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-04-11 15:12:46,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-04-11 15:12:46,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-04-11 15:12:46,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-04-11 15:12:46,461 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 19 [2018-04-11 15:12:46,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:12:46,461 INFO L459 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-04-11 15:12:46,461 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 15:12:46,461 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-04-11 15:12:46,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-11 15:12:46,461 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:12:46,461 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:12:46,461 INFO L408 AbstractCegarLoop]: === Iteration 8 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:12:46,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1249921718, now seen corresponding path program 1 times [2018-04-11 15:12:46,462 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:12:46,462 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:12:46,463 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:46,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:12:46,463 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:46,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:12:46,469 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:12:46,472 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:12:46,472 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:12:46,472 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:12:46,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:12:46,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:12:46,503 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:12:46,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:12:46,520 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:46,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:12:46,527 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:46,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:46,536 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:17 [2018-04-11 15:12:46,566 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:46,567 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:46,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:12:46,568 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:46,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:12:46,578 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:46,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:46,585 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2018-04-11 15:12:46,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:12:46,692 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:12:46,692 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-11 15:12:46,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 15:12:46,692 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 15:12:46,692 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-04-11 15:12:46,692 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 12 states. [2018-04-11 15:12:47,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:12:47,003 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2018-04-11 15:12:47,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 15:12:47,004 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-04-11 15:12:47,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:12:47,004 INFO L225 Difference]: With dead ends: 68 [2018-04-11 15:12:47,004 INFO L226 Difference]: Without dead ends: 68 [2018-04-11 15:12:47,005 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2018-04-11 15:12:47,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-04-11 15:12:47,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 54. [2018-04-11 15:12:47,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-04-11 15:12:47,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-04-11 15:12:47,009 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 19 [2018-04-11 15:12:47,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:12:47,009 INFO L459 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-04-11 15:12:47,009 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 15:12:47,009 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-04-11 15:12:47,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-11 15:12:47,010 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:12:47,010 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:12:47,010 INFO L408 AbstractCegarLoop]: === Iteration 9 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:12:47,010 INFO L82 PathProgramCache]: Analyzing trace with hash -991756280, now seen corresponding path program 1 times [2018-04-11 15:12:47,010 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:12:47,010 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:12:47,011 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:47,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:12:47,011 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:47,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:12:47,020 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:12:47,024 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:12:47,024 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:12:47,024 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:12:47,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:12:47,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:12:47,048 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:12:47,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:12:47,063 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:47,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:12:47,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:47,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:47,076 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:12:47,089 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:47,090 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:47,090 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:12:47,090 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:47,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:12:47,096 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:47,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:47,101 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:12:47,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:12:47,120 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:12:47,120 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 15:12:47,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 15:12:47,121 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 15:12:47,121 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-04-11 15:12:47,121 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand 8 states. [2018-04-11 15:12:47,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:12:47,195 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2018-04-11 15:12:47,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 15:12:47,196 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-04-11 15:12:47,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:12:47,196 INFO L225 Difference]: With dead ends: 65 [2018-04-11 15:12:47,196 INFO L226 Difference]: Without dead ends: 65 [2018-04-11 15:12:47,196 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-04-11 15:12:47,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-04-11 15:12:47,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 36. [2018-04-11 15:12:47,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-04-11 15:12:47,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-04-11 15:12:47,198 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 19 [2018-04-11 15:12:47,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:12:47,199 INFO L459 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-04-11 15:12:47,199 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 15:12:47,199 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-04-11 15:12:47,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-11 15:12:47,199 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:12:47,199 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:12:47,199 INFO L408 AbstractCegarLoop]: === Iteration 10 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:12:47,200 INFO L82 PathProgramCache]: Analyzing trace with hash -660876371, now seen corresponding path program 1 times [2018-04-11 15:12:47,200 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:12:47,200 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:12:47,200 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:47,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:12:47,200 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:47,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:12:47,210 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:12:47,303 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:12:47,303 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:12:47,303 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-11 15:12:47,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 15:12:47,304 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 15:12:47,304 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-04-11 15:12:47,304 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 10 states. [2018-04-11 15:12:47,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:12:47,371 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2018-04-11 15:12:47,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-04-11 15:12:47,371 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-04-11 15:12:47,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:12:47,371 INFO L225 Difference]: With dead ends: 58 [2018-04-11 15:12:47,372 INFO L226 Difference]: Without dead ends: 58 [2018-04-11 15:12:47,372 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-04-11 15:12:47,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-04-11 15:12:47,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2018-04-11 15:12:47,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-04-11 15:12:47,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2018-04-11 15:12:47,374 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 23 [2018-04-11 15:12:47,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:12:47,374 INFO L459 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2018-04-11 15:12:47,374 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 15:12:47,374 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2018-04-11 15:12:47,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-11 15:12:47,374 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:12:47,374 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:12:47,374 INFO L408 AbstractCegarLoop]: === Iteration 11 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:12:47,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1681944725, now seen corresponding path program 1 times [2018-04-11 15:12:47,375 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:12:47,375 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:12:47,375 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:47,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:12:47,375 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:47,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:12:47,381 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:12:47,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:12:47,470 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:12:47,470 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:12:47,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:12:47,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:12:47,493 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:12:47,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:12:47,497 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:47,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:47,508 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 15:12:47,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 16 treesize of output 13 [2018-04-11 15:12:47,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 13 treesize of output 12 [2018-04-11 15:12:47,537 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:47,539 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:47,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:47,544 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-04-11 15:12:47,616 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-11 15:12:47,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 15:12:47,623 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:12:47,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:12:47,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:12:47,635 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:54 [2018-04-11 15:12:47,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:12:47,680 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:12:47,680 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2018-04-11 15:12:47,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 15:12:47,681 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 15:12:47,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-04-11 15:12:47,681 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 19 states. [2018-04-11 15:12:47,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:12:47,977 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-04-11 15:12:47,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 15:12:47,977 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23 [2018-04-11 15:12:47,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:12:47,978 INFO L225 Difference]: With dead ends: 65 [2018-04-11 15:12:47,978 INFO L226 Difference]: Without dead ends: 65 [2018-04-11 15:12:47,978 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=596, Unknown=0, NotChecked=0, Total=702 [2018-04-11 15:12:47,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-04-11 15:12:47,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 55. [2018-04-11 15:12:47,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-04-11 15:12:47,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-04-11 15:12:47,980 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 23 [2018-04-11 15:12:47,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:12:47,981 INFO L459 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-04-11 15:12:47,981 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 15:12:47,981 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-04-11 15:12:47,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-11 15:12:47,981 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:12:47,981 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:12:47,981 INFO L408 AbstractCegarLoop]: === Iteration 12 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:12:47,981 INFO L82 PathProgramCache]: Analyzing trace with hash -600678973, now seen corresponding path program 1 times [2018-04-11 15:12:47,981 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:12:47,981 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:12:47,982 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:47,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:12:47,982 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:47,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:12:47,987 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:12:47,991 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:12:47,991 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:12:47,991 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:12:47,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:12:48,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:12:48,010 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:12:48,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:12:48,028 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:48,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:12:48,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:48,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:48,039 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:17 [2018-04-11 15:12:48,059 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:48,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:12:48,060 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:48,068 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:48,068 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:48,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:12:48,069 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:48,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:48,073 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:20 [2018-04-11 15:12:48,168 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:12:48,169 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:12:48,169 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-11 15:12:48,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 15:12:48,169 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 15:12:48,169 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-04-11 15:12:48,169 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 15 states. [2018-04-11 15:12:48,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:12:48,422 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2018-04-11 15:12:48,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 15:12:48,422 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2018-04-11 15:12:48,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:12:48,423 INFO L225 Difference]: With dead ends: 64 [2018-04-11 15:12:48,423 INFO L226 Difference]: Without dead ends: 64 [2018-04-11 15:12:48,423 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=537, Unknown=0, NotChecked=0, Total=650 [2018-04-11 15:12:48,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-04-11 15:12:48,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 56. [2018-04-11 15:12:48,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-04-11 15:12:48,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2018-04-11 15:12:48,425 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 24 [2018-04-11 15:12:48,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:12:48,425 INFO L459 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2018-04-11 15:12:48,425 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 15:12:48,426 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2018-04-11 15:12:48,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 15:12:48,426 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:12:48,426 INFO L355 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:12:48,426 INFO L408 AbstractCegarLoop]: === Iteration 13 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:12:48,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1671194714, now seen corresponding path program 2 times [2018-04-11 15:12:48,426 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:12:48,426 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:12:48,427 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:48,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:12:48,427 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:48,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:12:48,436 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:12:48,450 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:12:48,450 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:12:48,450 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:12:48,451 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:12:48,478 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:12:48,478 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:12:48,482 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:12:48,496 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:12:48,496 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:48,497 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:48,497 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 15:12:48,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:12:48,507 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:48,513 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:48,514 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:48,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:12:48,515 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:48,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:48,518 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-11 15:12:48,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 15:12:48,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:12:48,547 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:48,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:48,552 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:48,552 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-04-11 15:12:48,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-04-11 15:12:48,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 8 treesize of output 7 [2018-04-11 15:12:48,611 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:48,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:48,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:48,630 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:18 [2018-04-11 15:12:48,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-11 15:12:48,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-11 15:12:48,683 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:12:48,686 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:12:48,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:12:48,694 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:40 [2018-04-11 15:12:48,758 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:12:48,759 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:12:48,759 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-11 15:12:48,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 15:12:48,759 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 15:12:48,759 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2018-04-11 15:12:48,759 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand 15 states. [2018-04-11 15:12:49,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:12:49,020 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2018-04-11 15:12:49,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 15:12:49,021 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-04-11 15:12:49,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:12:49,021 INFO L225 Difference]: With dead ends: 70 [2018-04-11 15:12:49,021 INFO L226 Difference]: Without dead ends: 70 [2018-04-11 15:12:49,021 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2018-04-11 15:12:49,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-04-11 15:12:49,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 60. [2018-04-11 15:12:49,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-04-11 15:12:49,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-04-11 15:12:49,024 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 28 [2018-04-11 15:12:49,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:12:49,024 INFO L459 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-04-11 15:12:49,025 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 15:12:49,025 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-04-11 15:12:49,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 15:12:49,025 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:12:49,025 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:12:49,025 INFO L408 AbstractCegarLoop]: === Iteration 14 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:12:49,025 INFO L82 PathProgramCache]: Analyzing trace with hash -549923555, now seen corresponding path program 1 times [2018-04-11 15:12:49,025 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:12:49,025 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:12:49,026 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:49,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:12:49,026 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:49,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:12:49,031 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:12:49,033 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:12:49,033 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:12:49,034 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:12:49,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:12:49,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:12:49,047 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:12:49,086 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:49,087 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 27 [2018-04-11 15:12:49,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2018-04-11 15:12:49,090 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:49,093 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:49,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 15:12:49,098 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-11 15:12:49,121 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc7.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc7.base| 1))) (and (= (select |c_old(#valid)| |main_#t~malloc7.base|) 0) (= (store (store .cse0 |c_main_#t~malloc8.base| 1) |main_#t~malloc7.base| 0) |c_#valid|) (= (select .cse0 |c_main_#t~malloc8.base|) 0)))) is different from true [2018-04-11 15:12:49,126 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc7.base| Int) (|main_#t~malloc8.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc7.base| 1))) (and (= (select |c_old(#valid)| |main_#t~malloc7.base|) 0) (= |c_#valid| (store (store (store .cse0 |main_#t~malloc8.base| 1) |main_#t~malloc7.base| 0) |main_#t~malloc8.base| 0)) (= (select .cse0 |main_#t~malloc8.base|) 0)))) is different from true [2018-04-11 15:12:49,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:12:49,129 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:12:49,129 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 15:12:49,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 15:12:49,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 15:12:49,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=22, Unknown=2, NotChecked=18, Total=56 [2018-04-11 15:12:49,130 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 8 states. [2018-04-11 15:12:49,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:12:49,160 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-04-11 15:12:49,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 15:12:49,160 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-04-11 15:12:49,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:12:49,160 INFO L225 Difference]: With dead ends: 59 [2018-04-11 15:12:49,161 INFO L226 Difference]: Without dead ends: 35 [2018-04-11 15:12:49,161 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=30, Unknown=2, NotChecked=22, Total=72 [2018-04-11 15:12:49,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-04-11 15:12:49,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-04-11 15:12:49,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-04-11 15:12:49,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-04-11 15:12:49,162 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 29 [2018-04-11 15:12:49,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:12:49,162 INFO L459 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-04-11 15:12:49,162 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 15:12:49,162 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-04-11 15:12:49,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 15:12:49,163 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:12:49,163 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:12:49,163 INFO L408 AbstractCegarLoop]: === Iteration 15 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:12:49,163 INFO L82 PathProgramCache]: Analyzing trace with hash -267428632, now seen corresponding path program 2 times [2018-04-11 15:12:49,163 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:12:49,163 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:12:49,164 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:49,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:12:49,164 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:49,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:12:49,171 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:12:49,177 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:12:49,177 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:12:49,177 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:12:49,177 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:12:49,206 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:12:49,206 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:12:49,208 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:12:49,225 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:12:49,225 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:49,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:12:49,230 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:49,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:49,233 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:12:49,246 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:49,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:12:49,248 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:49,260 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:49,260 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:49,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:12:49,261 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:49,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-11 15:12:49,266 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-11 15:12:49,377 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:12:49,377 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:12:49,377 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-11 15:12:49,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 15:12:49,377 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 15:12:49,378 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-04-11 15:12:49,378 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 13 states. [2018-04-11 15:12:49,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:12:49,586 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2018-04-11 15:12:49,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 15:12:49,586 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2018-04-11 15:12:49,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:12:49,587 INFO L225 Difference]: With dead ends: 38 [2018-04-11 15:12:49,587 INFO L226 Difference]: Without dead ends: 38 [2018-04-11 15:12:49,587 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2018-04-11 15:12:49,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-04-11 15:12:49,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2018-04-11 15:12:49,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-04-11 15:12:49,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-04-11 15:12:49,588 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 29 [2018-04-11 15:12:49,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:12:49,588 INFO L459 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-04-11 15:12:49,588 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 15:12:49,589 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-04-11 15:12:49,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 15:12:49,589 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:12:49,589 INFO L355 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:12:49,589 INFO L408 AbstractCegarLoop]: === Iteration 16 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:12:49,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1840413771, now seen corresponding path program 3 times [2018-04-11 15:12:49,589 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:12:49,589 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:12:49,590 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:49,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:12:49,590 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:49,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:12:49,595 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:12:49,610 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:12:49,610 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:12:49,610 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:12:49,611 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:12:49,643 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-11 15:12:49,644 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:12:49,647 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:12:49,649 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:12:49,649 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:49,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:49,652 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 15:12:49,661 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:12:49,661 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:49,667 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:49,667 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:49,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:12:49,668 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:49,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:49,671 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2018-04-11 15:12:49,688 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 15:12:49,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:12:49,689 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:49,690 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:49,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:49,694 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-04-11 15:12:49,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-04-11 15:12:49,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:12:49,725 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:49,728 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:49,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:49,733 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:19 [2018-04-11 15:12:49,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 23 treesize of output 35 [2018-04-11 15:12:49,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2018-04-11 15:12:49,787 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:49,805 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 30 [2018-04-11 15:12:49,805 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 15:12:49,815 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:12:49,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:12:49,824 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:29, output treesize:33 [2018-04-11 15:12:49,856 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-04-11 15:12:49,857 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:49,863 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-11 15:12:49,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-11 15:12:49,869 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-04-11 15:12:49,872 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:12:49,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:12:49,876 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:59, output treesize:34 [2018-04-11 15:12:49,921 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:12:49,922 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:12:49,922 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-11 15:12:49,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 15:12:49,922 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 15:12:49,922 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2018-04-11 15:12:49,922 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 16 states. [2018-04-11 15:12:50,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:12:50,145 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2018-04-11 15:12:50,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 15:12:50,163 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 33 [2018-04-11 15:12:50,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:12:50,163 INFO L225 Difference]: With dead ends: 44 [2018-04-11 15:12:50,163 INFO L226 Difference]: Without dead ends: 44 [2018-04-11 15:12:50,171 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2018-04-11 15:12:50,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-04-11 15:12:50,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2018-04-11 15:12:50,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-04-11 15:12:50,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-04-11 15:12:50,172 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 33 [2018-04-11 15:12:50,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:12:50,173 INFO L459 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-04-11 15:12:50,173 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 15:12:50,173 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-04-11 15:12:50,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-11 15:12:50,173 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:12:50,173 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:12:50,173 INFO L408 AbstractCegarLoop]: === Iteration 17 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:12:50,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1218252003, now seen corresponding path program 3 times [2018-04-11 15:12:50,174 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:12:50,174 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:12:50,174 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:50,174 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:12:50,174 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:50,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:12:50,182 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:12:50,203 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:12:50,203 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:12:50,203 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:12:50,204 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:12:50,242 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-11 15:12:50,242 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:12:50,246 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:12:50,253 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:12:50,253 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:50,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:50,257 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-11 15:12:50,313 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 12 treesize of output 18 [2018-04-11 15:12:50,314 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:12:50,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:50,322 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-04-11 15:12:50,469 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:12:50,469 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:12:50,469 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-11 15:12:50,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 15:12:50,469 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 15:12:50,470 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2018-04-11 15:12:50,470 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 15 states. [2018-04-11 15:12:50,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:12:50,665 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-04-11 15:12:50,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 15:12:50,665 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2018-04-11 15:12:50,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:12:50,666 INFO L225 Difference]: With dead ends: 43 [2018-04-11 15:12:50,666 INFO L226 Difference]: Without dead ends: 43 [2018-04-11 15:12:50,666 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=559, Unknown=0, NotChecked=0, Total=650 [2018-04-11 15:12:50,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-04-11 15:12:50,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2018-04-11 15:12:50,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-04-11 15:12:50,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-04-11 15:12:50,667 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 34 [2018-04-11 15:12:50,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:12:50,668 INFO L459 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-04-11 15:12:50,668 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 15:12:50,668 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-04-11 15:12:50,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-04-11 15:12:50,668 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:12:50,668 INFO L355 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:12:50,668 INFO L408 AbstractCegarLoop]: === Iteration 18 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:12:50,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1738651334, now seen corresponding path program 4 times [2018-04-11 15:12:50,669 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:12:50,669 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:12:50,669 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:50,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:12:50,669 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:50,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:12:50,678 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:12:50,696 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:12:50,696 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:12:50,696 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:12:50,696 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:12:50,727 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:12:50,727 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:12:50,732 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:12:50,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:12:50,746 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:50,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:50,750 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 15:12:50,761 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:50,761 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:50,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:12:50,762 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:50,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:12:50,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:50,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:50,774 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2018-04-11 15:12:50,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-04-11 15:12:50,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 13 treesize of output 12 [2018-04-11 15:12:50,798 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:50,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:50,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:50,803 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-04-11 15:12:50,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-04-11 15:12:50,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:12:50,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:50,862 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:50,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:50,868 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:23 [2018-04-11 15:12:50,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-04-11 15:12:50,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:12:50,886 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:50,889 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:50,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:50,894 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:22 [2018-04-11 15:12:50,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-04-11 15:12:50,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:12:50,917 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:50,921 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:50,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:50,926 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:18 [2018-04-11 15:12:50,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-11 15:12:50,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-11 15:12:50,956 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:12:50,959 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:12:50,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:12:50,964 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-04-11 15:12:51,014 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:12:51,015 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:12:51,015 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-11 15:12:51,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 15:12:51,015 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 15:12:51,015 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2018-04-11 15:12:51,015 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 16 states. [2018-04-11 15:12:51,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:12:51,231 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-04-11 15:12:51,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 15:12:51,231 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 38 [2018-04-11 15:12:51,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:12:51,232 INFO L225 Difference]: With dead ends: 49 [2018-04-11 15:12:51,232 INFO L226 Difference]: Without dead ends: 49 [2018-04-11 15:12:51,232 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2018-04-11 15:12:51,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-04-11 15:12:51,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2018-04-11 15:12:51,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-04-11 15:12:51,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-04-11 15:12:51,233 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 38 [2018-04-11 15:12:51,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:12:51,233 INFO L459 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-04-11 15:12:51,233 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 15:12:51,233 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-04-11 15:12:51,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-11 15:12:51,234 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:12:51,234 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:12:51,234 INFO L408 AbstractCegarLoop]: === Iteration 19 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:12:51,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1936383544, now seen corresponding path program 4 times [2018-04-11 15:12:51,234 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:12:51,234 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:12:51,234 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:51,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:12:51,234 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:51,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:12:51,242 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:12:51,248 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:12:51,248 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:12:51,248 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:12:51,248 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:12:51,273 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:12:51,273 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:12:51,277 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:12:51,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:12:51,287 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:51,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:12:51,294 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:51,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:51,300 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:12:51,317 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:51,318 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:12:51,318 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:51,333 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:51,334 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:51,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:12:51,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:51,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:51,341 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-11 15:12:51,518 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:12:51,518 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:12:51,518 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-11 15:12:51,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 15:12:51,519 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 15:12:51,519 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2018-04-11 15:12:51,519 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 16 states. [2018-04-11 15:12:51,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:12:51,805 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2018-04-11 15:12:51,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 15:12:51,805 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2018-04-11 15:12:51,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:12:51,805 INFO L225 Difference]: With dead ends: 48 [2018-04-11 15:12:51,805 INFO L226 Difference]: Without dead ends: 48 [2018-04-11 15:12:51,806 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2018-04-11 15:12:51,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-04-11 15:12:51,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-04-11 15:12:51,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-04-11 15:12:51,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-04-11 15:12:51,807 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 39 [2018-04-11 15:12:51,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:12:51,807 INFO L459 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-04-11 15:12:51,807 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 15:12:51,807 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-04-11 15:12:51,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-04-11 15:12:51,807 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:12:51,807 INFO L355 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:12:51,807 INFO L408 AbstractCegarLoop]: === Iteration 20 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:12:51,808 INFO L82 PathProgramCache]: Analyzing trace with hash 369807659, now seen corresponding path program 5 times [2018-04-11 15:12:51,808 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:12:51,808 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:12:51,808 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:51,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:12:51,808 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:51,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:12:51,819 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:12:51,830 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:12:51,831 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:12:51,831 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:12:51,831 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:12:51,881 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-04-11 15:12:51,881 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:12:51,885 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:12:51,888 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:12:51,889 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:51,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:51,890 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 15:12:51,898 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:51,900 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:51,900 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2018-04-11 15:12:51,901 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:51,915 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:12:51,915 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:51,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:51,920 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-11 15:12:51,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-04-11 15:12:51,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-04-11 15:12:51,938 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:51,939 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:51,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:51,943 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-11 15:12:51,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-04-11 15:12:51,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:12:51,985 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:51,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:51,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:51,994 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-04-11 15:12:51,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 15:12:51,997 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:52,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:52,001 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:19 [2018-04-11 15:12:52,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-04-11 15:12:52,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:12:52,022 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:52,026 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:52,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:52,032 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2018-04-11 15:12:52,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-04-11 15:12:52,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:12:52,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:52,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:52,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:52,086 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:19 [2018-04-11 15:12:52,109 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-04-11 15:12:52,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:12:52,111 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:52,116 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:52,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:52,124 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-04-11 15:12:52,149 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-04-11 15:12:52,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 12 [2018-04-11 15:12:52,155 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:12:52,158 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:12:52,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:12:52,163 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:34 [2018-04-11 15:12:52,220 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 22 proven. 36 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-11 15:12:52,220 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:12:52,220 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 15:12:52,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 15:12:52,221 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 15:12:52,221 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2018-04-11 15:12:52,221 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 17 states. [2018-04-11 15:12:52,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:12:52,579 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-04-11 15:12:52,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-11 15:12:52,579 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 43 [2018-04-11 15:12:52,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:12:52,579 INFO L225 Difference]: With dead ends: 45 [2018-04-11 15:12:52,579 INFO L226 Difference]: Without dead ends: 45 [2018-04-11 15:12:52,580 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=147, Invalid=665, Unknown=0, NotChecked=0, Total=812 [2018-04-11 15:12:52,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-04-11 15:12:52,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-04-11 15:12:52,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-04-11 15:12:52,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-04-11 15:12:52,582 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 43 [2018-04-11 15:12:52,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:12:52,582 INFO L459 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-04-11 15:12:52,582 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 15:12:52,582 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-04-11 15:12:52,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-11 15:12:52,583 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:12:52,583 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:12:52,583 INFO L408 AbstractCegarLoop]: === Iteration 21 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:12:52,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1420864509, now seen corresponding path program 5 times [2018-04-11 15:12:52,583 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:12:52,583 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:12:52,584 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:52,584 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:12:52,584 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:52,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:12:52,594 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:12:52,623 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:12:52,623 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:12:52,623 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:12:52,624 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:12:52,658 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-04-11 15:12:52,658 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:12:52,662 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:12:52,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:12:52,669 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:52,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:52,674 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-11 15:12:52,695 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 12 treesize of output 18 [2018-04-11 15:12:52,696 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:12:52,708 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 15:12:52,708 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:52,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:52,714 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:14 [2018-04-11 15:12:52,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 15:12:52,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:52,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:52,778 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:14 [2018-04-11 15:12:52,897 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:12:52,897 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:12:52,897 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-11 15:12:52,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 15:12:52,898 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 15:12:52,898 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-04-11 15:12:52,898 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 16 states. [2018-04-11 15:12:53,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:12:53,242 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2018-04-11 15:12:53,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 15:12:53,242 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 44 [2018-04-11 15:12:53,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:12:53,243 INFO L225 Difference]: With dead ends: 52 [2018-04-11 15:12:53,243 INFO L226 Difference]: Without dead ends: 52 [2018-04-11 15:12:53,243 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=662, Unknown=0, NotChecked=0, Total=756 [2018-04-11 15:12:53,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-04-11 15:12:53,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2018-04-11 15:12:53,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-04-11 15:12:53,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2018-04-11 15:12:53,244 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 44 [2018-04-11 15:12:53,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:12:53,244 INFO L459 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2018-04-11 15:12:53,244 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 15:12:53,244 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2018-04-11 15:12:53,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-11 15:12:53,244 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:12:53,245 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:12:53,245 INFO L408 AbstractCegarLoop]: === Iteration 22 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:12:53,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1741835944, now seen corresponding path program 6 times [2018-04-11 15:12:53,245 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:12:53,245 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:12:53,245 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:53,245 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:12:53,245 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:53,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:12:53,251 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:12:53,264 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:12:53,264 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:12:53,265 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:12:53,265 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:12:53,306 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-04-11 15:12:53,306 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:12:53,310 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:12:53,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:12:53,315 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:53,320 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:12:53,320 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:53,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:53,324 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:12:53,336 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:53,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:12:53,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:53,345 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:53,346 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:53,346 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:12:53,346 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:53,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:53,351 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-11 15:12:53,581 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:12:53,581 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:12:53,581 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 15:12:53,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 15:12:53,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 15:12:53,582 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-04-11 15:12:53,582 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 17 states. [2018-04-11 15:12:53,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:12:53,959 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2018-04-11 15:12:53,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 15:12:53,960 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 49 [2018-04-11 15:12:53,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:12:53,960 INFO L225 Difference]: With dead ends: 57 [2018-04-11 15:12:53,960 INFO L226 Difference]: Without dead ends: 57 [2018-04-11 15:12:53,960 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=770, Unknown=0, NotChecked=0, Total=870 [2018-04-11 15:12:53,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-04-11 15:12:53,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-04-11 15:12:53,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-04-11 15:12:53,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-04-11 15:12:53,961 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 49 [2018-04-11 15:12:53,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:12:53,961 INFO L459 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-04-11 15:12:53,962 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 15:12:53,962 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-04-11 15:12:53,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-11 15:12:53,962 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:12:53,962 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:12:53,962 INFO L408 AbstractCegarLoop]: === Iteration 23 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:12:53,962 INFO L82 PathProgramCache]: Analyzing trace with hash -508873949, now seen corresponding path program 7 times [2018-04-11 15:12:53,962 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:12:53,962 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:12:53,963 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:53,963 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:12:53,963 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:53,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:12:53,972 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:12:54,004 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:12:54,004 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:12:54,004 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:12:54,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:12:54,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:12:54,030 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:12:54,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:12:54,035 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:54,040 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:12:54,040 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:54,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:54,044 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:12:54,056 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:54,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:12:54,057 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:54,065 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:54,065 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:54,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:12:54,066 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:54,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:54,075 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-11 15:12:54,306 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:12:54,307 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:12:54,307 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-11 15:12:54,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 15:12:54,307 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 15:12:54,307 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2018-04-11 15:12:54,307 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 19 states. [2018-04-11 15:12:54,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:12:54,758 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2018-04-11 15:12:54,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-11 15:12:54,758 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 54 [2018-04-11 15:12:54,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:12:54,758 INFO L225 Difference]: With dead ends: 62 [2018-04-11 15:12:54,758 INFO L226 Difference]: Without dead ends: 62 [2018-04-11 15:12:54,759 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=1004, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 15:12:54,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-04-11 15:12:54,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2018-04-11 15:12:54,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-04-11 15:12:54,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-04-11 15:12:54,760 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 54 [2018-04-11 15:12:54,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:12:54,760 INFO L459 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-04-11 15:12:54,760 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 15:12:54,760 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-04-11 15:12:54,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-11 15:12:54,761 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:12:54,761 INFO L355 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:12:54,761 INFO L408 AbstractCegarLoop]: === Iteration 24 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:12:54,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1314593912, now seen corresponding path program 8 times [2018-04-11 15:12:54,761 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:12:54,761 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:12:54,761 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:54,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:12:54,762 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:54,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:12:54,769 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:12:54,775 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:12:54,775 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:12:54,775 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:12:54,775 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:12:54,804 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:12:54,804 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:12:54,808 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:12:54,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:12:54,819 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:54,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:12:54,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:54,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:54,830 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:12:54,863 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:54,863 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:54,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:12:54,864 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:54,872 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:12:54,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:54,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:54,878 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-11 15:12:55,119 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:12:55,120 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:12:55,120 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-11 15:12:55,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 15:12:55,120 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 15:12:55,120 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=340, Unknown=0, NotChecked=0, Total=380 [2018-04-11 15:12:55,121 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 20 states. [2018-04-11 15:12:55,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:12:55,559 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2018-04-11 15:12:55,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 15:12:55,559 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 59 [2018-04-11 15:12:55,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:12:55,559 INFO L225 Difference]: With dead ends: 67 [2018-04-11 15:12:55,559 INFO L226 Difference]: Without dead ends: 67 [2018-04-11 15:12:55,560 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=124, Invalid=1136, Unknown=0, NotChecked=0, Total=1260 [2018-04-11 15:12:55,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-04-11 15:12:55,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2018-04-11 15:12:55,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-04-11 15:12:55,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2018-04-11 15:12:55,561 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 59 [2018-04-11 15:12:55,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:12:55,561 INFO L459 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2018-04-11 15:12:55,561 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 15:12:55,561 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2018-04-11 15:12:55,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-11 15:12:55,561 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:12:55,562 INFO L355 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:12:55,562 INFO L408 AbstractCegarLoop]: === Iteration 25 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:12:55,562 INFO L82 PathProgramCache]: Analyzing trace with hash -158160317, now seen corresponding path program 9 times [2018-04-11 15:12:55,562 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:12:55,562 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:12:55,562 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:55,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:12:55,562 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:55,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:12:55,570 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:12:55,589 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:12:55,589 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:12:55,589 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:12:55,589 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:12:55,667 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-04-11 15:12:55,667 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:12:55,673 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:12:55,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:12:55,677 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:55,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:55,681 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-11 15:12:55,698 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 12 treesize of output 18 [2018-04-11 15:12:55,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:12:55,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:55,706 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-04-11 15:12:56,006 INFO L134 CoverageAnalysis]: Checked inductivity of 207 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:12:56,006 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:12:56,006 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-11 15:12:56,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 15:12:56,007 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 15:12:56,007 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2018-04-11 15:12:56,008 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 21 states. [2018-04-11 15:12:56,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:12:56,434 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2018-04-11 15:12:56,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 15:12:56,435 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2018-04-11 15:12:56,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:12:56,435 INFO L225 Difference]: With dead ends: 72 [2018-04-11 15:12:56,435 INFO L226 Difference]: Without dead ends: 72 [2018-04-11 15:12:56,436 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=1279, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 15:12:56,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-04-11 15:12:56,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2018-04-11 15:12:56,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-04-11 15:12:56,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2018-04-11 15:12:56,437 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 64 [2018-04-11 15:12:56,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:12:56,438 INFO L459 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2018-04-11 15:12:56,438 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 15:12:56,438 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2018-04-11 15:12:56,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-11 15:12:56,438 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:12:56,438 INFO L355 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:12:56,439 INFO L408 AbstractCegarLoop]: === Iteration 26 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:12:56,439 INFO L82 PathProgramCache]: Analyzing trace with hash -596975512, now seen corresponding path program 10 times [2018-04-11 15:12:56,439 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:12:56,439 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:12:56,439 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:56,440 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:12:56,440 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:56,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:12:56,452 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:12:56,469 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:12:56,470 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:12:56,470 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:12:56,470 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:12:56,508 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:12:56,509 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:12:56,513 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:12:56,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:12:56,523 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:56,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:12:56,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:56,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:56,535 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:12:56,551 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:56,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:12:56,552 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:56,561 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:56,561 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:56,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:12:56,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:56,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:56,566 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-11 15:12:56,935 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:12:56,935 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:12:56,935 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-11 15:12:56,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 15:12:56,936 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 15:12:56,936 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=419, Unknown=0, NotChecked=0, Total=462 [2018-04-11 15:12:56,936 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 22 states. [2018-04-11 15:12:57,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:12:57,609 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2018-04-11 15:12:57,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 15:12:57,610 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 69 [2018-04-11 15:12:57,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:12:57,610 INFO L225 Difference]: With dead ends: 77 [2018-04-11 15:12:57,610 INFO L226 Difference]: Without dead ends: 77 [2018-04-11 15:12:57,611 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=133, Invalid=1427, Unknown=0, NotChecked=0, Total=1560 [2018-04-11 15:12:57,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-04-11 15:12:57,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2018-04-11 15:12:57,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-04-11 15:12:57,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-04-11 15:12:57,612 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 69 [2018-04-11 15:12:57,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:12:57,613 INFO L459 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-04-11 15:12:57,613 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 15:12:57,613 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-04-11 15:12:57,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-11 15:12:57,613 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:12:57,614 INFO L355 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:12:57,614 INFO L408 AbstractCegarLoop]: === Iteration 27 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:12:57,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1114093923, now seen corresponding path program 11 times [2018-04-11 15:12:57,614 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:12:57,614 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:12:57,615 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:57,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:12:57,615 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:57,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:12:57,629 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:12:57,649 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:12:57,649 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:12:57,649 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:12:57,650 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:12:57,739 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-04-11 15:12:57,739 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:12:57,777 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:12:57,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:12:57,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:57,803 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:12:57,803 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:57,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:57,808 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:12:57,823 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:57,824 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:12:57,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:57,836 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:57,837 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:57,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 15:12:57,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:57,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:57,846 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:28 [2018-04-11 15:12:57,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-04-11 15:12:57,951 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:57,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:57,956 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:18 [2018-04-11 15:12:58,252 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:12:58,252 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:12:58,253 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-11 15:12:58,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 15:12:58,253 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 15:12:58,253 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2018-04-11 15:12:58,253 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 22 states. [2018-04-11 15:12:59,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:12:59,009 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2018-04-11 15:12:59,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 15:12:59,009 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 74 [2018-04-11 15:12:59,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:12:59,009 INFO L225 Difference]: With dead ends: 82 [2018-04-11 15:12:59,010 INFO L226 Difference]: Without dead ends: 82 [2018-04-11 15:12:59,010 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=125, Invalid=1357, Unknown=0, NotChecked=0, Total=1482 [2018-04-11 15:12:59,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-04-11 15:12:59,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2018-04-11 15:12:59,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-04-11 15:12:59,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2018-04-11 15:12:59,012 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 74 [2018-04-11 15:12:59,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:12:59,012 INFO L459 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2018-04-11 15:12:59,012 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 15:12:59,012 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2018-04-11 15:12:59,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-04-11 15:12:59,013 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:12:59,013 INFO L355 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:12:59,013 INFO L408 AbstractCegarLoop]: === Iteration 28 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:12:59,013 INFO L82 PathProgramCache]: Analyzing trace with hash 2097300808, now seen corresponding path program 12 times [2018-04-11 15:12:59,013 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:12:59,013 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:12:59,013 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:59,013 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:12:59,013 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:59,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:12:59,026 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:12:59,038 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:12:59,038 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:12:59,038 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:12:59,039 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:12:59,112 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-04-11 15:12:59,112 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:12:59,116 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:12:59,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:12:59,120 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:59,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:59,123 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-11 15:12:59,150 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 12 treesize of output 18 [2018-04-11 15:12:59,150 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:12:59,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:59,159 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-11 15:12:59,557 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 0 proven. 366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:12:59,557 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:12:59,557 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-11 15:12:59,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 15:12:59,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 15:12:59,558 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=504, Unknown=0, NotChecked=0, Total=552 [2018-04-11 15:12:59,558 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 24 states. [2018-04-11 15:13:00,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:00,196 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2018-04-11 15:13:00,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 15:13:00,196 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 79 [2018-04-11 15:13:00,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:00,196 INFO L225 Difference]: With dead ends: 87 [2018-04-11 15:13:00,197 INFO L226 Difference]: Without dead ends: 87 [2018-04-11 15:13:00,197 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=148, Invalid=1744, Unknown=0, NotChecked=0, Total=1892 [2018-04-11 15:13:00,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-04-11 15:13:00,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2018-04-11 15:13:00,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-04-11 15:13:00,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2018-04-11 15:13:00,198 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 79 [2018-04-11 15:13:00,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:00,198 INFO L459 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-04-11 15:13:00,199 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 15:13:00,199 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2018-04-11 15:13:00,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-04-11 15:13:00,199 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:00,199 INFO L355 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:13:00,199 INFO L408 AbstractCegarLoop]: === Iteration 29 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:13:00,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1962123133, now seen corresponding path program 13 times [2018-04-11 15:13:00,199 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:00,199 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:00,200 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:00,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:13:00,200 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:00,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:00,213 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:00,225 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:13:00,225 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:13:00,226 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:13:00,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:13:00,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:00,311 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:13:00,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:13:00,324 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:00,327 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:00,327 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-11 15:13:00,341 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 12 treesize of output 18 [2018-04-11 15:13:00,341 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:13:00,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:00,346 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-04-11 15:13:00,648 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:13:00,648 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:13:00,648 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-11 15:13:00,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 15:13:00,649 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 15:13:00,649 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2018-04-11 15:13:00,649 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 25 states. [2018-04-11 15:13:01,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:01,316 INFO L93 Difference]: Finished difference Result 92 states and 93 transitions. [2018-04-11 15:13:01,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 15:13:01,317 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 84 [2018-04-11 15:13:01,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:01,317 INFO L225 Difference]: With dead ends: 92 [2018-04-11 15:13:01,317 INFO L226 Difference]: Without dead ends: 92 [2018-04-11 15:13:01,318 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=151, Invalid=1919, Unknown=0, NotChecked=0, Total=2070 [2018-04-11 15:13:01,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-04-11 15:13:01,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2018-04-11 15:13:01,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-04-11 15:13:01,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2018-04-11 15:13:01,319 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 84 [2018-04-11 15:13:01,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:01,320 INFO L459 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2018-04-11 15:13:01,320 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 15:13:01,320 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2018-04-11 15:13:01,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-04-11 15:13:01,320 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:01,320 INFO L355 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:13:01,320 INFO L408 AbstractCegarLoop]: === Iteration 30 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:13:01,320 INFO L82 PathProgramCache]: Analyzing trace with hash 717820456, now seen corresponding path program 14 times [2018-04-11 15:13:01,320 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:01,321 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:01,321 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:01,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:13:01,321 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:01,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:01,332 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:01,390 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:13:01,390 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:13:01,390 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:13:01,392 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:13:01,479 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:13:01,479 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:13:01,486 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:13:01,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:13:01,522 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:01,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:13:01,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:01,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:01,538 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:13:01,562 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:01,567 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:01,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:13:01,568 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:01,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:13:01,575 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:01,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:01,599 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-11 15:13:02,046 INFO L134 CoverageAnalysis]: Checked inductivity of 497 backedges. 0 proven. 497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:13:02,046 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:13:02,046 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-11 15:13:02,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-11 15:13:02,047 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-11 15:13:02,047 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2018-04-11 15:13:02,047 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand 26 states. [2018-04-11 15:13:02,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:02,971 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2018-04-11 15:13:02,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 15:13:02,971 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 89 [2018-04-11 15:13:02,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:02,972 INFO L225 Difference]: With dead ends: 97 [2018-04-11 15:13:02,972 INFO L226 Difference]: Without dead ends: 97 [2018-04-11 15:13:02,972 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=157, Invalid=2099, Unknown=0, NotChecked=0, Total=2256 [2018-04-11 15:13:02,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-04-11 15:13:02,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2018-04-11 15:13:02,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-04-11 15:13:02,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2018-04-11 15:13:02,974 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 89 [2018-04-11 15:13:02,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:02,974 INFO L459 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2018-04-11 15:13:02,974 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-11 15:13:02,974 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2018-04-11 15:13:02,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-04-11 15:13:02,974 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:02,974 INFO L355 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:13:02,975 INFO L408 AbstractCegarLoop]: === Iteration 31 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:13:02,975 INFO L82 PathProgramCache]: Analyzing trace with hash 602054563, now seen corresponding path program 15 times [2018-04-11 15:13:02,975 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:02,975 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:02,975 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:02,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:13:02,976 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:02,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:02,991 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:03,002 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:13:03,003 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:13:03,003 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:13:03,003 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:13:03,091 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-04-11 15:13:03,091 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:13:03,097 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:13:03,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:13:03,100 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:03,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:03,103 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-11 15:13:03,117 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 12 treesize of output 18 [2018-04-11 15:13:03,117 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:13:03,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:03,123 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-04-11 15:13:03,452 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 0 proven. 570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:13:03,452 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:13:03,452 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-11 15:13:03,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-11 15:13:03,453 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-11 15:13:03,453 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=649, Unknown=0, NotChecked=0, Total=702 [2018-04-11 15:13:03,453 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 27 states. [2018-04-11 15:13:04,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:04,285 INFO L93 Difference]: Finished difference Result 102 states and 103 transitions. [2018-04-11 15:13:04,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-11 15:13:04,285 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 94 [2018-04-11 15:13:04,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:04,286 INFO L225 Difference]: With dead ends: 102 [2018-04-11 15:13:04,286 INFO L226 Difference]: Without dead ends: 102 [2018-04-11 15:13:04,286 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=163, Invalid=2287, Unknown=0, NotChecked=0, Total=2450 [2018-04-11 15:13:04,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-04-11 15:13:04,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-04-11 15:13:04,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-04-11 15:13:04,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2018-04-11 15:13:04,288 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 94 [2018-04-11 15:13:04,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:04,288 INFO L459 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2018-04-11 15:13:04,288 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-11 15:13:04,288 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2018-04-11 15:13:04,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-04-11 15:13:04,288 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:04,288 INFO L355 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:13:04,288 INFO L408 AbstractCegarLoop]: === Iteration 32 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:13:04,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1604142856, now seen corresponding path program 16 times [2018-04-11 15:13:04,288 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:04,289 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:04,289 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:04,289 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:13:04,289 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:04,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:04,299 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:04,305 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:13:04,305 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:13:04,305 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:13:04,305 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:13:04,368 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:13:04,368 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:13:04,376 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:13:04,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:13:04,379 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:04,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:13:04,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:04,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:04,396 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:13:04,407 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:04,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:13:04,409 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:04,417 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:04,417 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:04,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:13:04,418 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:04,421 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:04,421 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-11 15:13:04,785 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:13:04,785 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:13:04,785 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-11 15:13:04,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-11 15:13:04,785 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-11 15:13:04,785 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=650, Unknown=0, NotChecked=0, Total=702 [2018-04-11 15:13:04,786 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 27 states. [2018-04-11 15:13:05,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:05,878 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2018-04-11 15:13:05,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-11 15:13:05,878 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 99 [2018-04-11 15:13:05,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:05,879 INFO L225 Difference]: With dead ends: 107 [2018-04-11 15:13:05,879 INFO L226 Difference]: Without dead ends: 107 [2018-04-11 15:13:05,880 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=160, Invalid=2290, Unknown=0, NotChecked=0, Total=2450 [2018-04-11 15:13:05,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-04-11 15:13:05,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2018-04-11 15:13:05,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-04-11 15:13:05,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2018-04-11 15:13:05,882 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 99 [2018-04-11 15:13:05,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:05,882 INFO L459 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2018-04-11 15:13:05,882 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-11 15:13:05,882 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2018-04-11 15:13:05,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-04-11 15:13:05,882 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:05,887 INFO L355 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:13:05,887 INFO L408 AbstractCegarLoop]: === Iteration 33 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:13:05,887 INFO L82 PathProgramCache]: Analyzing trace with hash 231503555, now seen corresponding path program 17 times [2018-04-11 15:13:05,887 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:05,887 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:05,887 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:05,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:13:05,887 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:05,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:05,899 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:05,949 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:13:05,949 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:13:05,949 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:13:05,949 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:13:06,086 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-04-11 15:13:06,087 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:13:06,094 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:13:06,100 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:13:06,100 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:06,106 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:13:06,106 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:06,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:06,111 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:13:06,125 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:06,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:13:06,126 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:06,134 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:06,135 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:06,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:13:06,135 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:06,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:06,141 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-11 15:13:06,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 15:13:06,213 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:06,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:06,217 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:18 [2018-04-11 15:13:06,590 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 0 proven. 731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:13:06,590 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:13:06,590 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-11 15:13:06,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-11 15:13:06,591 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-11 15:13:06,591 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2018-04-11 15:13:06,591 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 28 states. [2018-04-11 15:13:07,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:07,792 INFO L93 Difference]: Finished difference Result 112 states and 113 transitions. [2018-04-11 15:13:07,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-11 15:13:07,792 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 104 [2018-04-11 15:13:07,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:07,793 INFO L225 Difference]: With dead ends: 112 [2018-04-11 15:13:07,793 INFO L226 Difference]: Without dead ends: 112 [2018-04-11 15:13:07,794 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=166, Invalid=2486, Unknown=0, NotChecked=0, Total=2652 [2018-04-11 15:13:07,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-04-11 15:13:07,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2018-04-11 15:13:07,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-04-11 15:13:07,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 111 transitions. [2018-04-11 15:13:07,795 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 111 transitions. Word has length 104 [2018-04-11 15:13:07,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:07,795 INFO L459 AbstractCegarLoop]: Abstraction has 110 states and 111 transitions. [2018-04-11 15:13:07,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-11 15:13:07,795 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2018-04-11 15:13:07,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-04-11 15:13:07,796 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:07,796 INFO L355 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:13:07,796 INFO L408 AbstractCegarLoop]: === Iteration 34 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:13:07,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1474094056, now seen corresponding path program 18 times [2018-04-11 15:13:07,796 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:07,796 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:07,797 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:07,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:13:07,797 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:07,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:07,810 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:07,861 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:13:07,861 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:13:07,861 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:13:07,862 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:13:07,996 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-04-11 15:13:07,996 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:13:08,005 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:13:08,018 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:13:08,018 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:08,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:13:08,023 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:08,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:08,027 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:13:08,046 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:08,046 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:08,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:13:08,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:08,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:13:08,053 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:08,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:08,058 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-11 15:13:08,620 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 0 proven. 819 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:13:08,620 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:13:08,620 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-04-11 15:13:08,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-11 15:13:08,621 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-11 15:13:08,621 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=756, Unknown=0, NotChecked=0, Total=812 [2018-04-11 15:13:08,621 INFO L87 Difference]: Start difference. First operand 110 states and 111 transitions. Second operand 29 states. [2018-04-11 15:13:09,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:09,941 INFO L93 Difference]: Finished difference Result 117 states and 118 transitions. [2018-04-11 15:13:09,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 15:13:09,942 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 109 [2018-04-11 15:13:09,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:09,942 INFO L225 Difference]: With dead ends: 117 [2018-04-11 15:13:09,942 INFO L226 Difference]: Without dead ends: 117 [2018-04-11 15:13:09,943 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=172, Invalid=2690, Unknown=0, NotChecked=0, Total=2862 [2018-04-11 15:13:09,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-04-11 15:13:09,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-04-11 15:13:09,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-04-11 15:13:09,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2018-04-11 15:13:09,944 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 109 [2018-04-11 15:13:09,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:09,945 INFO L459 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2018-04-11 15:13:09,945 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-11 15:13:09,945 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2018-04-11 15:13:09,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-04-11 15:13:09,945 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:09,946 INFO L355 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:13:09,946 INFO L408 AbstractCegarLoop]: === Iteration 35 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:13:09,946 INFO L82 PathProgramCache]: Analyzing trace with hash 388752867, now seen corresponding path program 19 times [2018-04-11 15:13:09,946 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:09,946 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:09,947 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:09,947 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:13:09,947 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:09,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:09,962 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:10,075 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:13:10,075 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:13:10,076 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:13:10,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:13:10,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:10,264 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:13:10,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:13:10,280 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:10,287 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:13:10,287 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:10,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:10,292 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:13:10,307 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:10,307 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:10,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:13:10,308 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:10,312 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:13:10,312 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:10,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:10,316 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-11 15:13:10,772 INFO L134 CoverageAnalysis]: Checked inductivity of 912 backedges. 0 proven. 912 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:13:10,773 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:13:10,773 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-04-11 15:13:10,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-11 15:13:10,773 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-11 15:13:10,773 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=869, Unknown=0, NotChecked=0, Total=930 [2018-04-11 15:13:10,773 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 31 states. [2018-04-11 15:13:12,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:12,049 INFO L93 Difference]: Finished difference Result 122 states and 123 transitions. [2018-04-11 15:13:12,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-11 15:13:12,049 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 114 [2018-04-11 15:13:12,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:12,049 INFO L225 Difference]: With dead ends: 122 [2018-04-11 15:13:12,050 INFO L226 Difference]: Without dead ends: 122 [2018-04-11 15:13:12,050 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=187, Invalid=3119, Unknown=0, NotChecked=0, Total=3306 [2018-04-11 15:13:12,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-04-11 15:13:12,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2018-04-11 15:13:12,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-04-11 15:13:12,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 121 transitions. [2018-04-11 15:13:12,052 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 121 transitions. Word has length 114 [2018-04-11 15:13:12,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:12,052 INFO L459 AbstractCegarLoop]: Abstraction has 120 states and 121 transitions. [2018-04-11 15:13:12,053 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-11 15:13:12,053 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2018-04-11 15:13:12,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-04-11 15:13:12,053 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:12,053 INFO L355 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:13:12,053 INFO L408 AbstractCegarLoop]: === Iteration 36 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:13:12,054 INFO L82 PathProgramCache]: Analyzing trace with hash -228202296, now seen corresponding path program 20 times [2018-04-11 15:13:12,054 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:12,054 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:12,054 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:12,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:13:12,055 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:12,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:12,070 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:12,165 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:13:12,165 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:13:12,165 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:13:12,165 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:13:12,298 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:13:12,298 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:13:12,324 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:13:12,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:13:12,377 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:12,382 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:13:12,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:12,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:12,387 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:13:12,399 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:12,399 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:12,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:13:12,400 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:12,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:13:12,406 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:12,410 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:12,410 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-11 15:13:12,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1010 backedges. 0 proven. 1010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:13:12,915 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:13:12,915 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-04-11 15:13:12,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-11 15:13:12,915 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-11 15:13:12,916 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=929, Unknown=0, NotChecked=0, Total=992 [2018-04-11 15:13:12,916 INFO L87 Difference]: Start difference. First operand 120 states and 121 transitions. Second operand 32 states. [2018-04-11 15:13:14,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:14,293 INFO L93 Difference]: Finished difference Result 127 states and 128 transitions. [2018-04-11 15:13:14,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-11 15:13:14,294 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 119 [2018-04-11 15:13:14,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:14,294 INFO L225 Difference]: With dead ends: 127 [2018-04-11 15:13:14,294 INFO L226 Difference]: Without dead ends: 127 [2018-04-11 15:13:14,295 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=193, Invalid=3347, Unknown=0, NotChecked=0, Total=3540 [2018-04-11 15:13:14,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-04-11 15:13:14,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2018-04-11 15:13:14,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-04-11 15:13:14,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2018-04-11 15:13:14,297 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 119 [2018-04-11 15:13:14,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:14,297 INFO L459 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2018-04-11 15:13:14,297 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-11 15:13:14,297 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2018-04-11 15:13:14,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-04-11 15:13:14,297 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:14,298 INFO L355 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:13:14,298 INFO L408 AbstractCegarLoop]: === Iteration 37 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:13:14,298 INFO L82 PathProgramCache]: Analyzing trace with hash -69014269, now seen corresponding path program 21 times [2018-04-11 15:13:14,298 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:14,298 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:14,298 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:14,298 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:13:14,298 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:14,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:14,312 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:14,471 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:13:14,472 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:13:14,472 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:13:14,472 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:13:14,658 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-04-11 15:13:14,658 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:13:14,676 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:13:14,681 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:13:14,682 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:14,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:14,686 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-11 15:13:14,703 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 12 treesize of output 18 [2018-04-11 15:13:14,704 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:13:14,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:14,711 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-04-11 15:13:15,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1113 backedges. 0 proven. 1113 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:13:15,241 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:13:15,241 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-04-11 15:13:15,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-11 15:13:15,241 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-11 15:13:15,242 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=991, Unknown=0, NotChecked=0, Total=1056 [2018-04-11 15:13:15,242 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand 33 states. [2018-04-11 15:13:16,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:16,611 INFO L93 Difference]: Finished difference Result 132 states and 133 transitions. [2018-04-11 15:13:16,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-11 15:13:16,612 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 124 [2018-04-11 15:13:16,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:16,612 INFO L225 Difference]: With dead ends: 132 [2018-04-11 15:13:16,612 INFO L226 Difference]: Without dead ends: 132 [2018-04-11 15:13:16,613 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=199, Invalid=3583, Unknown=0, NotChecked=0, Total=3782 [2018-04-11 15:13:16,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-04-11 15:13:16,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2018-04-11 15:13:16,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-04-11 15:13:16,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 131 transitions. [2018-04-11 15:13:16,614 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 131 transitions. Word has length 124 [2018-04-11 15:13:16,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:16,615 INFO L459 AbstractCegarLoop]: Abstraction has 130 states and 131 transitions. [2018-04-11 15:13:16,615 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-11 15:13:16,615 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 131 transitions. [2018-04-11 15:13:16,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-04-11 15:13:16,615 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:16,615 INFO L355 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:13:16,615 INFO L408 AbstractCegarLoop]: === Iteration 38 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:13:16,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1869195864, now seen corresponding path program 22 times [2018-04-11 15:13:16,616 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:16,616 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:16,616 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:16,616 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:13:16,617 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:16,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:16,632 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:16,793 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:13:16,794 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:13:16,794 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:13:16,794 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:13:16,871 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:13:16,871 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:13:16,880 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:13:16,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:13:16,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:16,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:13:16,933 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:16,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:16,939 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:13:16,954 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:16,954 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:16,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:13:16,959 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:16,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:13:16,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:16,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:16,977 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-11 15:13:17,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 1221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:13:17,543 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:13:17,543 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-04-11 15:13:17,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-11 15:13:17,543 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-11 15:13:17,544 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1055, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 15:13:17,544 INFO L87 Difference]: Start difference. First operand 130 states and 131 transitions. Second operand 34 states. [2018-04-11 15:13:19,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:19,113 INFO L93 Difference]: Finished difference Result 137 states and 138 transitions. [2018-04-11 15:13:19,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-11 15:13:19,113 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 129 [2018-04-11 15:13:19,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:19,114 INFO L225 Difference]: With dead ends: 137 [2018-04-11 15:13:19,114 INFO L226 Difference]: Without dead ends: 137 [2018-04-11 15:13:19,115 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=205, Invalid=3827, Unknown=0, NotChecked=0, Total=4032 [2018-04-11 15:13:19,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-04-11 15:13:19,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2018-04-11 15:13:19,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-04-11 15:13:19,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2018-04-11 15:13:19,117 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 129 [2018-04-11 15:13:19,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:19,117 INFO L459 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2018-04-11 15:13:19,117 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-11 15:13:19,117 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2018-04-11 15:13:19,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-04-11 15:13:19,118 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:19,118 INFO L355 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:13:19,118 INFO L408 AbstractCegarLoop]: === Iteration 39 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:13:19,118 INFO L82 PathProgramCache]: Analyzing trace with hash -2058122205, now seen corresponding path program 23 times [2018-04-11 15:13:19,119 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:19,119 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:19,119 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:19,119 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:13:19,119 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:19,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:19,136 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:19,297 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:13:19,297 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:13:19,297 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:13:19,298 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:13:19,590 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-04-11 15:13:19,590 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:13:19,599 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:13:19,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:13:19,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:19,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:13:19,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:19,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:19,636 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:13:19,653 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:19,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:13:19,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:19,663 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:19,663 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:19,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 15:13:19,664 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:19,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:19,671 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:28 [2018-04-11 15:13:19,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:13:19,864 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:19,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:19,868 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:18 [2018-04-11 15:13:20,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1334 backedges. 0 proven. 1334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:13:20,339 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:13:20,339 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-04-11 15:13:20,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-11 15:13:20,340 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-11 15:13:20,340 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 15:13:20,340 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 34 states. [2018-04-11 15:13:22,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:22,166 INFO L93 Difference]: Finished difference Result 142 states and 143 transitions. [2018-04-11 15:13:22,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-11 15:13:22,166 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 134 [2018-04-11 15:13:22,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:22,167 INFO L225 Difference]: With dead ends: 142 [2018-04-11 15:13:22,167 INFO L226 Difference]: Without dead ends: 142 [2018-04-11 15:13:22,167 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=197, Invalid=3709, Unknown=0, NotChecked=0, Total=3906 [2018-04-11 15:13:22,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-04-11 15:13:22,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2018-04-11 15:13:22,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-04-11 15:13:22,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 141 transitions. [2018-04-11 15:13:22,170 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 141 transitions. Word has length 134 [2018-04-11 15:13:22,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:22,170 INFO L459 AbstractCegarLoop]: Abstraction has 140 states and 141 transitions. [2018-04-11 15:13:22,170 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-11 15:13:22,170 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 141 transitions. [2018-04-11 15:13:22,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-04-11 15:13:22,171 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:22,171 INFO L355 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:13:22,171 INFO L408 AbstractCegarLoop]: === Iteration 40 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:13:22,171 INFO L82 PathProgramCache]: Analyzing trace with hash -162780536, now seen corresponding path program 24 times [2018-04-11 15:13:22,171 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:22,171 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:22,171 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:22,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:13:22,172 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:22,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:22,187 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:22,335 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:13:22,335 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:13:22,335 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:13:22,335 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:13:22,569 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-04-11 15:13:22,569 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:13:22,579 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:13:22,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:13:22,583 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:22,588 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:13:22,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:22,592 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:22,592 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:13:22,606 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:22,606 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:22,607 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:13:22,607 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:22,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:13:22,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:22,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:22,629 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-11 15:13:23,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 0 proven. 1452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:13:23,240 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:13:23,240 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-04-11 15:13:23,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-11 15:13:23,240 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-11 15:13:23,240 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=1122, Unknown=0, NotChecked=0, Total=1190 [2018-04-11 15:13:23,240 INFO L87 Difference]: Start difference. First operand 140 states and 141 transitions. Second operand 35 states. [2018-04-11 15:13:25,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:25,074 INFO L93 Difference]: Finished difference Result 147 states and 148 transitions. [2018-04-11 15:13:25,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-11 15:13:25,074 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 139 [2018-04-11 15:13:25,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:25,074 INFO L225 Difference]: With dead ends: 147 [2018-04-11 15:13:25,074 INFO L226 Difference]: Without dead ends: 147 [2018-04-11 15:13:25,075 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=208, Invalid=4082, Unknown=0, NotChecked=0, Total=4290 [2018-04-11 15:13:25,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-04-11 15:13:25,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2018-04-11 15:13:25,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-04-11 15:13:25,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2018-04-11 15:13:25,076 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 139 [2018-04-11 15:13:25,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:25,077 INFO L459 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2018-04-11 15:13:25,077 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-11 15:13:25,077 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2018-04-11 15:13:25,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-04-11 15:13:25,077 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:25,077 INFO L355 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:13:25,077 INFO L408 AbstractCegarLoop]: === Iteration 41 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:13:25,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1436564669, now seen corresponding path program 25 times [2018-04-11 15:13:25,077 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:25,077 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:25,078 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:25,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:13:25,078 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:25,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:25,094 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:25,280 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:13:25,280 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:13:25,280 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:13:25,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:13:25,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:25,533 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:13:25,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 6 treesize of output 5 [2018-04-11 15:13:25,537 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:25,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:13:25,542 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:25,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:25,546 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:13:25,557 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:25,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:13:25,558 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:25,565 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:25,565 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:25,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 15:13:25,566 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:25,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:25,577 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:25 [2018-04-11 15:13:25,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:13:25,961 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:25,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:25,965 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:18 [2018-04-11 15:13:26,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1575 backedges. 0 proven. 1575 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:13:26,423 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:13:26,423 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-04-11 15:13:26,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-11 15:13:26,423 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-11 15:13:26,423 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=1330, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 15:13:26,423 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 38 states. [2018-04-11 15:13:28,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:28,560 INFO L93 Difference]: Finished difference Result 152 states and 153 transitions. [2018-04-11 15:13:28,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-11 15:13:28,560 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 144 [2018-04-11 15:13:28,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:28,560 INFO L225 Difference]: With dead ends: 152 [2018-04-11 15:13:28,560 INFO L226 Difference]: Without dead ends: 152 [2018-04-11 15:13:28,561 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 624 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=227, Invalid=4743, Unknown=0, NotChecked=0, Total=4970 [2018-04-11 15:13:28,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-04-11 15:13:28,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2018-04-11 15:13:28,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-04-11 15:13:28,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 151 transitions. [2018-04-11 15:13:28,562 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 151 transitions. Word has length 144 [2018-04-11 15:13:28,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:28,562 INFO L459 AbstractCegarLoop]: Abstraction has 150 states and 151 transitions. [2018-04-11 15:13:28,563 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-11 15:13:28,563 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2018-04-11 15:13:28,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-04-11 15:13:28,563 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:28,563 INFO L355 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:13:28,563 INFO L408 AbstractCegarLoop]: === Iteration 42 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:13:28,563 INFO L82 PathProgramCache]: Analyzing trace with hash 702900072, now seen corresponding path program 26 times [2018-04-11 15:13:28,563 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:28,563 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:28,564 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:28,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:13:28,564 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:28,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:28,580 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:28,679 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:13:28,679 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:13:28,679 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:13:28,679 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:13:28,933 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:13:28,933 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:13:28,946 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:13:28,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:13:28,954 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:28,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:13:28,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:28,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:28,963 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:13:28,979 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:28,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:13:28,980 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:28,986 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:28,987 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:28,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:13:28,987 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:28,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:28,990 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-11 15:13:29,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1703 backedges. 0 proven. 1703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:13:29,665 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:13:29,665 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-04-11 15:13:29,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-11 15:13:29,665 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-11 15:13:29,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1331, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 15:13:29,665 INFO L87 Difference]: Start difference. First operand 150 states and 151 transitions. Second operand 38 states. [2018-04-11 15:13:31,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:31,750 INFO L93 Difference]: Finished difference Result 157 states and 158 transitions. [2018-04-11 15:13:31,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-04-11 15:13:31,750 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 149 [2018-04-11 15:13:31,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:31,751 INFO L225 Difference]: With dead ends: 157 [2018-04-11 15:13:31,751 INFO L226 Difference]: Without dead ends: 157 [2018-04-11 15:13:31,752 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=229, Invalid=4883, Unknown=0, NotChecked=0, Total=5112 [2018-04-11 15:13:31,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-04-11 15:13:31,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2018-04-11 15:13:31,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-04-11 15:13:31,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2018-04-11 15:13:31,754 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 149 [2018-04-11 15:13:31,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:31,754 INFO L459 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2018-04-11 15:13:31,755 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-11 15:13:31,755 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2018-04-11 15:13:31,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-04-11 15:13:31,755 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:31,755 INFO L355 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:13:31,756 INFO L408 AbstractCegarLoop]: === Iteration 43 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:13:31,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1352035741, now seen corresponding path program 27 times [2018-04-11 15:13:31,756 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:31,756 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:31,756 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:31,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:13:31,757 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:31,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:31,788 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:32,032 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:13:32,032 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:13:32,032 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:13:32,033 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:13:32,293 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-04-11 15:13:32,293 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:13:32,311 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:13:32,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:13:32,326 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:32,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:32,329 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-11 15:13:32,339 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 12 treesize of output 18 [2018-04-11 15:13:32,340 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:13:32,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:32,344 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-04-11 15:13:32,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1836 backedges. 0 proven. 1836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:13:32,992 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:13:32,992 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-04-11 15:13:32,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-11 15:13:32,992 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-11 15:13:32,993 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1405, Unknown=0, NotChecked=0, Total=1482 [2018-04-11 15:13:32,993 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand 39 states. [2018-04-11 15:13:34,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:35,117 INFO L93 Difference]: Finished difference Result 162 states and 163 transitions. [2018-04-11 15:13:35,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-11 15:13:35,117 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 154 [2018-04-11 15:13:35,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:35,118 INFO L225 Difference]: With dead ends: 162 [2018-04-11 15:13:35,118 INFO L226 Difference]: Without dead ends: 162 [2018-04-11 15:13:35,118 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 683 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=235, Invalid=5167, Unknown=0, NotChecked=0, Total=5402 [2018-04-11 15:13:35,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-04-11 15:13:35,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2018-04-11 15:13:35,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-04-11 15:13:35,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 161 transitions. [2018-04-11 15:13:35,122 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 161 transitions. Word has length 154 [2018-04-11 15:13:35,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:35,122 INFO L459 AbstractCegarLoop]: Abstraction has 160 states and 161 transitions. [2018-04-11 15:13:35,122 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-11 15:13:35,122 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2018-04-11 15:13:35,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-04-11 15:13:35,123 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:35,123 INFO L355 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:13:35,123 INFO L408 AbstractCegarLoop]: === Iteration 44 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:13:35,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1413483592, now seen corresponding path program 28 times [2018-04-11 15:13:35,123 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:35,123 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:35,124 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:35,124 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:13:35,124 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:35,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:35,160 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:35,242 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:13:35,242 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:13:35,242 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:13:35,242 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:13:35,408 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:13:35,408 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:13:35,430 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:13:35,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:13:35,433 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:35,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:13:35,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:35,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:35,449 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:13:35,458 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:35,459 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:35,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:13:35,459 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:35,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:13:35,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:35,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:35,469 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-11 15:13:36,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1974 backedges. 0 proven. 1974 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:13:36,236 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:13:36,236 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-04-11 15:13:36,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-11 15:13:36,236 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-11 15:13:36,236 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=1406, Unknown=0, NotChecked=0, Total=1482 [2018-04-11 15:13:36,236 INFO L87 Difference]: Start difference. First operand 160 states and 161 transitions. Second operand 39 states. [2018-04-11 15:13:38,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:38,441 INFO L93 Difference]: Finished difference Result 167 states and 168 transitions. [2018-04-11 15:13:38,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-11 15:13:38,441 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 159 [2018-04-11 15:13:38,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:38,442 INFO L225 Difference]: With dead ends: 167 [2018-04-11 15:13:38,442 INFO L226 Difference]: Without dead ends: 167 [2018-04-11 15:13:38,443 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=232, Invalid=5170, Unknown=0, NotChecked=0, Total=5402 [2018-04-11 15:13:38,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-04-11 15:13:38,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2018-04-11 15:13:38,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-04-11 15:13:38,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2018-04-11 15:13:38,444 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 159 [2018-04-11 15:13:38,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:38,445 INFO L459 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2018-04-11 15:13:38,445 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-11 15:13:38,445 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2018-04-11 15:13:38,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-04-11 15:13:38,445 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:38,445 INFO L355 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:13:38,445 INFO L408 AbstractCegarLoop]: === Iteration 45 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:13:38,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1179842947, now seen corresponding path program 29 times [2018-04-11 15:13:38,445 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:38,445 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:38,446 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:38,446 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:13:38,446 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:38,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:38,469 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:38,596 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:13:38,596 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:13:38,596 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:13:38,597 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:13:38,858 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-04-11 15:13:38,858 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:13:38,884 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:13:38,887 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:13:38,888 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:38,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:13:38,892 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:38,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:38,895 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:13:38,905 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:38,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:13:38,906 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:38,913 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:38,914 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:38,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 15:13:38,914 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:38,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:38,924 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:28 [2018-04-11 15:13:39,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-04-11 15:13:39,032 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:39,035 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:39,036 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:18 [2018-04-11 15:13:39,757 INFO L134 CoverageAnalysis]: Checked inductivity of 2117 backedges. 0 proven. 2117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:13:39,757 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:13:39,757 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-04-11 15:13:39,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-04-11 15:13:39,757 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-04-11 15:13:39,757 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1482, Unknown=0, NotChecked=0, Total=1560 [2018-04-11 15:13:39,757 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand 40 states. [2018-04-11 15:13:42,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:42,273 INFO L93 Difference]: Finished difference Result 172 states and 173 transitions. [2018-04-11 15:13:42,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-11 15:13:42,273 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 164 [2018-04-11 15:13:42,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:42,274 INFO L225 Difference]: With dead ends: 172 [2018-04-11 15:13:42,274 INFO L226 Difference]: Without dead ends: 172 [2018-04-11 15:13:42,274 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 613 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=233, Invalid=5317, Unknown=0, NotChecked=0, Total=5550 [2018-04-11 15:13:42,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-04-11 15:13:42,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2018-04-11 15:13:42,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-04-11 15:13:42,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 171 transitions. [2018-04-11 15:13:42,276 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 171 transitions. Word has length 164 [2018-04-11 15:13:42,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:42,276 INFO L459 AbstractCegarLoop]: Abstraction has 170 states and 171 transitions. [2018-04-11 15:13:42,276 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-04-11 15:13:42,276 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 171 transitions. [2018-04-11 15:13:42,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-04-11 15:13:42,276 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:42,276 INFO L355 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:13:42,276 INFO L408 AbstractCegarLoop]: === Iteration 46 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:13:42,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1598416600, now seen corresponding path program 30 times [2018-04-11 15:13:42,277 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:42,277 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:42,277 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:42,277 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:13:42,277 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:42,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:42,301 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:42,321 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:13:42,321 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:13:42,322 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:13:42,322 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:13:42,686 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-04-11 15:13:42,687 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:13:42,709 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:13:42,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:13:42,712 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:42,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:42,716 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-11 15:13:42,728 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 12 treesize of output 18 [2018-04-11 15:13:42,728 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:13:42,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:42,735 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-11 15:13:43,506 INFO L134 CoverageAnalysis]: Checked inductivity of 2265 backedges. 0 proven. 2265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:13:43,506 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:13:43,506 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-04-11 15:13:43,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-04-11 15:13:43,506 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-04-11 15:13:43,506 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=1560, Unknown=0, NotChecked=0, Total=1640 [2018-04-11 15:13:43,507 INFO L87 Difference]: Start difference. First operand 170 states and 171 transitions. Second operand 41 states. [2018-04-11 15:13:45,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:45,817 INFO L93 Difference]: Finished difference Result 177 states and 178 transitions. [2018-04-11 15:13:45,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-04-11 15:13:45,817 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 169 [2018-04-11 15:13:45,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:45,818 INFO L225 Difference]: With dead ends: 177 [2018-04-11 15:13:45,818 INFO L226 Difference]: Without dead ends: 177 [2018-04-11 15:13:45,819 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=244, Invalid=5762, Unknown=0, NotChecked=0, Total=6006 [2018-04-11 15:13:45,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-04-11 15:13:45,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2018-04-11 15:13:45,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-04-11 15:13:45,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2018-04-11 15:13:45,821 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 169 [2018-04-11 15:13:45,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:45,821 INFO L459 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2018-04-11 15:13:45,821 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-04-11 15:13:45,821 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2018-04-11 15:13:45,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-04-11 15:13:45,821 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:45,821 INFO L355 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:13:45,822 INFO L408 AbstractCegarLoop]: === Iteration 47 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:13:45,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1367476061, now seen corresponding path program 31 times [2018-04-11 15:13:45,822 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:45,822 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:45,822 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:45,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:13:45,823 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:45,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:45,847 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:46,108 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:13:46,108 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:13:46,108 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:13:46,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:13:46,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:46,439 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:13:46,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:13:46,443 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:46,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:13:46,448 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:46,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:46,451 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:13:46,461 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:46,462 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:13:46,462 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:46,468 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:46,468 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:46,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:13:46,469 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:46,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:46,473 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-11 15:13:47,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2418 backedges. 0 proven. 2418 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:13:47,417 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:13:47,417 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-04-11 15:13:47,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-11 15:13:47,417 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-11 15:13:47,417 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=1640, Unknown=0, NotChecked=0, Total=1722 [2018-04-11 15:13:47,418 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 42 states. [2018-04-11 15:13:50,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:50,021 INFO L93 Difference]: Finished difference Result 182 states and 183 transitions. [2018-04-11 15:13:50,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-04-11 15:13:50,021 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 174 [2018-04-11 15:13:50,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:50,022 INFO L225 Difference]: With dead ends: 182 [2018-04-11 15:13:50,022 INFO L226 Difference]: Without dead ends: 182 [2018-04-11 15:13:50,023 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 733 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=250, Invalid=6070, Unknown=0, NotChecked=0, Total=6320 [2018-04-11 15:13:50,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-04-11 15:13:50,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2018-04-11 15:13:50,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-04-11 15:13:50,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 181 transitions. [2018-04-11 15:13:50,025 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 181 transitions. Word has length 174 [2018-04-11 15:13:50,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:50,025 INFO L459 AbstractCegarLoop]: Abstraction has 180 states and 181 transitions. [2018-04-11 15:13:50,025 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-11 15:13:50,025 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 181 transitions. [2018-04-11 15:13:50,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-04-11 15:13:50,025 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:50,025 INFO L355 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:13:50,026 INFO L408 AbstractCegarLoop]: === Iteration 48 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:13:50,026 INFO L82 PathProgramCache]: Analyzing trace with hash 489786888, now seen corresponding path program 32 times [2018-04-11 15:13:50,026 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:50,026 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:50,026 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:50,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:13:50,026 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:50,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:50,054 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:50,247 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:13:50,247 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:13:50,247 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:13:50,247 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:13:50,501 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:13:50,501 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:13:50,535 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:13:50,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:13:50,538 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:50,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:13:50,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:50,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:50,548 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:13:50,560 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:50,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:13:50,561 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:50,569 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:50,570 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:50,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:13:50,570 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:50,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:50,575 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-11 15:13:51,606 INFO L134 CoverageAnalysis]: Checked inductivity of 2576 backedges. 0 proven. 2576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:13:51,606 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:13:51,607 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-04-11 15:13:51,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-04-11 15:13:51,607 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-04-11 15:13:51,607 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1804, Unknown=0, NotChecked=0, Total=1892 [2018-04-11 15:13:51,607 INFO L87 Difference]: Start difference. First operand 180 states and 181 transitions. Second operand 44 states. [2018-04-11 15:13:54,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:54,403 INFO L93 Difference]: Finished difference Result 187 states and 188 transitions. [2018-04-11 15:13:54,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-11 15:13:54,403 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 179 [2018-04-11 15:13:54,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:54,404 INFO L225 Difference]: With dead ends: 187 [2018-04-11 15:13:54,404 INFO L226 Difference]: Without dead ends: 187 [2018-04-11 15:13:54,404 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 911 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=268, Invalid=6704, Unknown=0, NotChecked=0, Total=6972 [2018-04-11 15:13:54,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-04-11 15:13:54,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2018-04-11 15:13:54,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-04-11 15:13:54,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 186 transitions. [2018-04-11 15:13:54,407 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 186 transitions. Word has length 179 [2018-04-11 15:13:54,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:54,407 INFO L459 AbstractCegarLoop]: Abstraction has 185 states and 186 transitions. [2018-04-11 15:13:54,407 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-04-11 15:13:54,407 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 186 transitions. [2018-04-11 15:13:54,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-04-11 15:13:54,407 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:54,407 INFO L355 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:13:54,407 INFO L408 AbstractCegarLoop]: === Iteration 49 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:13:54,408 INFO L82 PathProgramCache]: Analyzing trace with hash -724791357, now seen corresponding path program 33 times [2018-04-11 15:13:54,408 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:54,408 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:54,408 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:54,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:13:54,408 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:54,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:54,432 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:54,801 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:13:54,801 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:13:54,802 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:13:54,802 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:13:55,172 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-04-11 15:13:55,172 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:13:55,195 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:13:55,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:13:55,211 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:55,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:55,214 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-11 15:13:55,230 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 12 treesize of output 18 [2018-04-11 15:13:55,230 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:13:55,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:55,236 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-04-11 15:13:56,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2739 backedges. 0 proven. 2739 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:13:56,262 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:13:56,262 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-04-11 15:13:56,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-04-11 15:13:56,263 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-04-11 15:13:56,264 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1891, Unknown=0, NotChecked=0, Total=1980 [2018-04-11 15:13:56,265 INFO L87 Difference]: Start difference. First operand 185 states and 186 transitions. Second operand 45 states. [2018-04-11 15:13:58,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:13:58,803 INFO L93 Difference]: Finished difference Result 192 states and 193 transitions. [2018-04-11 15:13:58,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-11 15:13:58,803 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 184 [2018-04-11 15:13:58,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:13:58,804 INFO L225 Difference]: With dead ends: 192 [2018-04-11 15:13:58,804 INFO L226 Difference]: Without dead ends: 192 [2018-04-11 15:13:58,805 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 926 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=271, Invalid=7039, Unknown=0, NotChecked=0, Total=7310 [2018-04-11 15:13:58,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-04-11 15:13:58,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 190. [2018-04-11 15:13:58,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-04-11 15:13:58,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 191 transitions. [2018-04-11 15:13:58,808 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 191 transitions. Word has length 184 [2018-04-11 15:13:58,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:13:58,808 INFO L459 AbstractCegarLoop]: Abstraction has 190 states and 191 transitions. [2018-04-11 15:13:58,808 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-04-11 15:13:58,808 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 191 transitions. [2018-04-11 15:13:58,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-04-11 15:13:58,809 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:13:58,809 INFO L355 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:13:58,810 INFO L408 AbstractCegarLoop]: === Iteration 50 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:13:58,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1710986520, now seen corresponding path program 34 times [2018-04-11 15:13:58,810 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:13:58,810 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:13:58,810 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:58,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:13:58,811 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:13:58,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:13:58,851 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:13:58,909 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:13:58,909 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:13:58,909 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:13:58,909 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:13:59,174 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:13:59,174 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:13:59,205 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:13:59,209 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:13:59,209 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:59,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:13:59,213 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:59,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:59,217 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:13:59,227 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:59,227 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:13:59,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:13:59,228 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:59,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:13:59,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:13:59,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:13:59,242 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-11 15:14:00,314 INFO L134 CoverageAnalysis]: Checked inductivity of 2907 backedges. 0 proven. 2907 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:14:00,314 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:14:00,349 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-04-11 15:14:00,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-04-11 15:14:00,349 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-04-11 15:14:00,350 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1892, Unknown=0, NotChecked=0, Total=1980 [2018-04-11 15:14:00,350 INFO L87 Difference]: Start difference. First operand 190 states and 191 transitions. Second operand 45 states. [2018-04-11 15:14:03,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:14:03,628 INFO L93 Difference]: Finished difference Result 197 states and 198 transitions. [2018-04-11 15:14:03,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-11 15:14:03,628 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 189 [2018-04-11 15:14:03,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:14:03,629 INFO L225 Difference]: With dead ends: 197 [2018-04-11 15:14:03,629 INFO L226 Difference]: Without dead ends: 197 [2018-04-11 15:14:03,630 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 854 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=268, Invalid=7042, Unknown=0, NotChecked=0, Total=7310 [2018-04-11 15:14:03,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-04-11 15:14:03,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2018-04-11 15:14:03,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-04-11 15:14:03,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 196 transitions. [2018-04-11 15:14:03,632 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 196 transitions. Word has length 189 [2018-04-11 15:14:03,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:14:03,634 INFO L459 AbstractCegarLoop]: Abstraction has 195 states and 196 transitions. [2018-04-11 15:14:03,634 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-04-11 15:14:03,634 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 196 transitions. [2018-04-11 15:14:03,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-04-11 15:14:03,635 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:14:03,635 INFO L355 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:14:03,635 INFO L408 AbstractCegarLoop]: === Iteration 51 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:14:03,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1939914467, now seen corresponding path program 35 times [2018-04-11 15:14:03,635 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:14:03,635 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:14:03,636 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:14:03,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:14:03,636 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:14:03,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:14:03,732 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:14:03,823 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:14:03,823 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:14:03,823 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:14:03,823 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:14:04,378 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-04-11 15:14:04,379 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:14:04,399 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:14:04,414 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:14:04,414 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:04,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:04,417 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-11 15:14:04,431 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 12 treesize of output 18 [2018-04-11 15:14:04,431 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:14:04,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:04,438 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-11 15:14:05,286 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:14:05,286 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:14:05,286 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-04-11 15:14:05,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-04-11 15:14:05,287 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-04-11 15:14:05,287 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-04-11 15:14:05,287 INFO L87 Difference]: Start difference. First operand 195 states and 196 transitions. Second operand 45 states. [2018-04-11 15:14:07,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:14:07,939 INFO L93 Difference]: Finished difference Result 202 states and 203 transitions. [2018-04-11 15:14:07,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-04-11 15:14:07,939 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 194 [2018-04-11 15:14:07,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:14:07,940 INFO L225 Difference]: With dead ends: 202 [2018-04-11 15:14:07,940 INFO L226 Difference]: Without dead ends: 202 [2018-04-11 15:14:07,940 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 813 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=265, Invalid=7045, Unknown=0, NotChecked=0, Total=7310 [2018-04-11 15:14:07,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-04-11 15:14:07,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 200. [2018-04-11 15:14:07,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-04-11 15:14:07,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 201 transitions. [2018-04-11 15:14:07,942 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 201 transitions. Word has length 194 [2018-04-11 15:14:07,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:14:07,942 INFO L459 AbstractCegarLoop]: Abstraction has 200 states and 201 transitions. [2018-04-11 15:14:07,942 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-04-11 15:14:07,942 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 201 transitions. [2018-04-11 15:14:07,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-04-11 15:14:07,943 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:14:07,943 INFO L355 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:14:07,943 INFO L408 AbstractCegarLoop]: === Iteration 52 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:14:07,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1978617912, now seen corresponding path program 36 times [2018-04-11 15:14:07,944 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:14:07,944 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:14:07,944 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:14:07,944 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:14:07,944 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:14:07,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:14:07,972 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:14:08,003 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:14:08,003 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:14:08,003 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:14:08,003 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:14:08,609 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-04-11 15:14:08,609 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:14:08,639 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:14:08,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:14:08,642 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:08,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:14:08,647 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:08,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:08,650 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:14:08,661 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:08,662 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:08,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:14:08,662 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:08,668 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:14:08,668 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:08,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:08,672 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-11 15:14:09,754 INFO L134 CoverageAnalysis]: Checked inductivity of 3258 backedges. 0 proven. 3258 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:14:09,754 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:14:09,754 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-04-11 15:14:09,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-04-11 15:14:09,755 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-04-11 15:14:09,755 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=2070, Unknown=0, NotChecked=0, Total=2162 [2018-04-11 15:14:09,755 INFO L87 Difference]: Start difference. First operand 200 states and 201 transitions. Second operand 47 states. [2018-04-11 15:14:13,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:14:13,104 INFO L93 Difference]: Finished difference Result 207 states and 208 transitions. [2018-04-11 15:14:13,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-04-11 15:14:13,104 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 199 [2018-04-11 15:14:13,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:14:13,104 INFO L225 Difference]: With dead ends: 207 [2018-04-11 15:14:13,104 INFO L226 Difference]: Without dead ends: 207 [2018-04-11 15:14:13,105 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 938 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=280, Invalid=7730, Unknown=0, NotChecked=0, Total=8010 [2018-04-11 15:14:13,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-04-11 15:14:13,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 205. [2018-04-11 15:14:13,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-04-11 15:14:13,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 206 transitions. [2018-04-11 15:14:13,106 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 206 transitions. Word has length 199 [2018-04-11 15:14:13,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:14:13,107 INFO L459 AbstractCegarLoop]: Abstraction has 205 states and 206 transitions. [2018-04-11 15:14:13,107 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-04-11 15:14:13,107 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 206 transitions. [2018-04-11 15:14:13,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-04-11 15:14:13,107 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:14:13,107 INFO L355 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:14:13,107 INFO L408 AbstractCegarLoop]: === Iteration 53 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:14:13,107 INFO L82 PathProgramCache]: Analyzing trace with hash 853313027, now seen corresponding path program 37 times [2018-04-11 15:14:13,108 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:14:13,108 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:14:13,108 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:14:13,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:14:13,108 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:14:13,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:14:13,140 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:14:13,153 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:14:13,153 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:14:13,153 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:14:13,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:14:13,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:14:13,591 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:14:13,594 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:14:13,594 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:13,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-11 15:14:13,599 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:13,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:13,603 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:14:13,613 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:13,614 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:13,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:14:13,614 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:13,620 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:14:13,620 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:13,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:13,624 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-11 15:14:14,762 INFO L134 CoverageAnalysis]: Checked inductivity of 3441 backedges. 0 proven. 3441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:14:14,763 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:14:14,763 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-04-11 15:14:14,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-04-11 15:14:14,763 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-04-11 15:14:14,764 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=2162, Unknown=0, NotChecked=0, Total=2256 [2018-04-11 15:14:14,764 INFO L87 Difference]: Start difference. First operand 205 states and 206 transitions. Second operand 48 states. [2018-04-11 15:14:18,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:14:18,043 INFO L93 Difference]: Finished difference Result 212 states and 213 transitions. [2018-04-11 15:14:18,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-04-11 15:14:18,043 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 204 [2018-04-11 15:14:18,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:14:18,044 INFO L225 Difference]: With dead ends: 212 [2018-04-11 15:14:18,044 INFO L226 Difference]: Without dead ends: 212 [2018-04-11 15:14:18,045 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 982 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=286, Invalid=8086, Unknown=0, NotChecked=0, Total=8372 [2018-04-11 15:14:18,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-04-11 15:14:18,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 210. [2018-04-11 15:14:18,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-04-11 15:14:18,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 211 transitions. [2018-04-11 15:14:18,046 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 211 transitions. Word has length 204 [2018-04-11 15:14:18,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:14:18,046 INFO L459 AbstractCegarLoop]: Abstraction has 210 states and 211 transitions. [2018-04-11 15:14:18,046 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-04-11 15:14:18,046 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 211 transitions. [2018-04-11 15:14:18,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-04-11 15:14:18,047 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:14:18,047 INFO L355 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:14:18,047 INFO L408 AbstractCegarLoop]: === Iteration 54 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:14:18,047 INFO L82 PathProgramCache]: Analyzing trace with hash -491496280, now seen corresponding path program 38 times [2018-04-11 15:14:18,047 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:14:18,047 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:14:18,048 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:14:18,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:14:18,048 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:14:18,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:14:18,082 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:14:18,603 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:14:18,603 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:14:18,603 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:14:18,604 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:14:19,149 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:14:19,149 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:14:19,168 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:14:19,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:14:19,172 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:19,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:19,182 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-11 15:14:19,194 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 12 treesize of output 18 [2018-04-11 15:14:19,194 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:14:19,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:19,200 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-04-11 15:14:20,381 INFO L134 CoverageAnalysis]: Checked inductivity of 3629 backedges. 0 proven. 3629 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:14:20,381 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:14:20,406 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-04-11 15:14:20,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-04-11 15:14:20,406 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-04-11 15:14:20,407 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2447, Unknown=0, NotChecked=0, Total=2550 [2018-04-11 15:14:20,407 INFO L87 Difference]: Start difference. First operand 210 states and 211 transitions. Second operand 51 states. [2018-04-11 15:14:23,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:14:23,715 INFO L93 Difference]: Finished difference Result 217 states and 218 transitions. [2018-04-11 15:14:23,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-04-11 15:14:23,715 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 209 [2018-04-11 15:14:23,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:14:23,716 INFO L225 Difference]: With dead ends: 217 [2018-04-11 15:14:23,716 INFO L226 Difference]: Without dead ends: 217 [2018-04-11 15:14:23,717 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1287 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=313, Invalid=9193, Unknown=0, NotChecked=0, Total=9506 [2018-04-11 15:14:23,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-04-11 15:14:23,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 215. [2018-04-11 15:14:23,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-04-11 15:14:23,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 216 transitions. [2018-04-11 15:14:23,719 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 216 transitions. Word has length 209 [2018-04-11 15:14:23,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:14:23,720 INFO L459 AbstractCegarLoop]: Abstraction has 215 states and 216 transitions. [2018-04-11 15:14:23,720 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-04-11 15:14:23,720 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 216 transitions. [2018-04-11 15:14:23,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-04-11 15:14:23,720 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:14:23,720 INFO L355 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:14:23,720 INFO L408 AbstractCegarLoop]: === Iteration 55 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:14:23,721 INFO L82 PathProgramCache]: Analyzing trace with hash -941497053, now seen corresponding path program 39 times [2018-04-11 15:14:23,721 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:14:23,721 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:14:23,721 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:14:23,721 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:14:23,721 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:14:23,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:14:23,753 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:14:23,831 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:14:23,831 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:14:23,832 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:14:23,832 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:14:24,665 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-04-11 15:14:24,666 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:14:24,694 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:14:24,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:14:24,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:24,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:14:24,702 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:24,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:24,705 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:14:24,714 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:24,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:14:24,715 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:24,722 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:24,723 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:24,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:14:24,723 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:24,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:24,733 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-11 15:14:25,938 INFO L134 CoverageAnalysis]: Checked inductivity of 3822 backedges. 0 proven. 3822 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:14:25,938 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:14:25,978 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-04-11 15:14:25,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-04-11 15:14:25,978 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-04-11 15:14:25,979 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=2352, Unknown=0, NotChecked=0, Total=2450 [2018-04-11 15:14:25,979 INFO L87 Difference]: Start difference. First operand 215 states and 216 transitions. Second operand 50 states. [2018-04-11 15:14:29,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:14:29,758 INFO L93 Difference]: Finished difference Result 222 states and 223 transitions. [2018-04-11 15:14:29,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-04-11 15:14:29,758 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 214 [2018-04-11 15:14:29,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:14:29,759 INFO L225 Difference]: With dead ends: 222 [2018-04-11 15:14:29,759 INFO L226 Difference]: Without dead ends: 222 [2018-04-11 15:14:29,760 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1073 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=298, Invalid=8822, Unknown=0, NotChecked=0, Total=9120 [2018-04-11 15:14:29,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-04-11 15:14:29,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2018-04-11 15:14:29,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-04-11 15:14:29,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 221 transitions. [2018-04-11 15:14:29,761 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 221 transitions. Word has length 214 [2018-04-11 15:14:29,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:14:29,761 INFO L459 AbstractCegarLoop]: Abstraction has 220 states and 221 transitions. [2018-04-11 15:14:29,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-04-11 15:14:29,761 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 221 transitions. [2018-04-11 15:14:29,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-04-11 15:14:29,762 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:14:29,762 INFO L355 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:14:29,762 INFO L408 AbstractCegarLoop]: === Iteration 56 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:14:29,762 INFO L82 PathProgramCache]: Analyzing trace with hash -70422136, now seen corresponding path program 40 times [2018-04-11 15:14:29,762 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:14:29,762 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:14:29,762 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:14:29,762 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:14:29,762 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:14:29,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:14:29,794 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:14:30,193 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:14:30,193 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:14:30,193 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:14:30,193 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:14:30,793 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:14:30,794 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:14:30,838 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:14:30,876 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:14:30,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:30,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:14:30,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:30,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:30,885 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:14:30,896 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:30,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:14:30,897 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:30,910 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:30,911 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:30,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:14:30,911 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:30,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:30,918 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-11 15:14:32,144 INFO L134 CoverageAnalysis]: Checked inductivity of 4020 backedges. 0 proven. 4020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:14:32,144 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:14:32,144 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-04-11 15:14:32,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-04-11 15:14:32,144 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-04-11 15:14:32,144 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=2450, Unknown=0, NotChecked=0, Total=2550 [2018-04-11 15:14:32,145 INFO L87 Difference]: Start difference. First operand 220 states and 221 transitions. Second operand 51 states. [2018-04-11 15:14:35,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:14:35,986 INFO L93 Difference]: Finished difference Result 227 states and 228 transitions. [2018-04-11 15:14:35,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-04-11 15:14:35,986 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 219 [2018-04-11 15:14:35,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:14:35,987 INFO L225 Difference]: With dead ends: 227 [2018-04-11 15:14:35,987 INFO L226 Difference]: Without dead ends: 227 [2018-04-11 15:14:35,987 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1127 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=304, Invalid=9202, Unknown=0, NotChecked=0, Total=9506 [2018-04-11 15:14:35,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-04-11 15:14:35,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 225. [2018-04-11 15:14:35,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-04-11 15:14:35,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 226 transitions. [2018-04-11 15:14:35,989 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 226 transitions. Word has length 219 [2018-04-11 15:14:35,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:14:35,989 INFO L459 AbstractCegarLoop]: Abstraction has 225 states and 226 transitions. [2018-04-11 15:14:35,989 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-04-11 15:14:35,989 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 226 transitions. [2018-04-11 15:14:35,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-04-11 15:14:35,990 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:14:35,990 INFO L355 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:14:35,990 INFO L408 AbstractCegarLoop]: === Iteration 57 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:14:35,991 INFO L82 PathProgramCache]: Analyzing trace with hash 361946179, now seen corresponding path program 41 times [2018-04-11 15:14:35,991 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:14:35,991 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:14:35,991 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:14:35,991 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:14:35,992 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:14:36,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:14:36,029 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:14:36,538 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:14:36,538 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:14:36,538 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:14:36,540 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:14:37,413 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-04-11 15:14:37,413 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:14:37,455 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:14:37,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-11 15:14:37,464 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:37,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:37,467 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-11 15:14:37,478 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 12 treesize of output 18 [2018-04-11 15:14:37,478 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:14:37,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:37,484 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:14 [2018-04-11 15:14:37,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-04-11 15:14:37,621 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:37,625 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:37,625 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:17 [2018-04-11 15:14:38,775 INFO L134 CoverageAnalysis]: Checked inductivity of 4223 backedges. 0 proven. 4223 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:14:38,775 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:14:38,775 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-04-11 15:14:38,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-04-11 15:14:38,776 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-04-11 15:14:38,776 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2651, Unknown=0, NotChecked=0, Total=2756 [2018-04-11 15:14:38,776 INFO L87 Difference]: Start difference. First operand 225 states and 226 transitions. Second operand 53 states. [2018-04-11 15:14:42,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:14:42,692 INFO L93 Difference]: Finished difference Result 232 states and 233 transitions. [2018-04-11 15:14:42,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-04-11 15:14:42,692 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 224 [2018-04-11 15:14:42,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:14:42,693 INFO L225 Difference]: With dead ends: 232 [2018-04-11 15:14:42,693 INFO L226 Difference]: Without dead ends: 232 [2018-04-11 15:14:42,694 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1306 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=319, Invalid=9983, Unknown=0, NotChecked=0, Total=10302 [2018-04-11 15:14:42,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-04-11 15:14:42,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 230. [2018-04-11 15:14:42,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-04-11 15:14:42,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 231 transitions. [2018-04-11 15:14:42,696 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 231 transitions. Word has length 224 [2018-04-11 15:14:42,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:14:42,697 INFO L459 AbstractCegarLoop]: Abstraction has 230 states and 231 transitions. [2018-04-11 15:14:42,697 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-04-11 15:14:42,697 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 231 transitions. [2018-04-11 15:14:42,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-04-11 15:14:42,698 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:14:42,698 INFO L355 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:14:42,698 INFO L408 AbstractCegarLoop]: === Iteration 58 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:14:42,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1874456168, now seen corresponding path program 42 times [2018-04-11 15:14:42,699 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:14:42,699 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:14:42,699 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:14:42,699 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:14:42,699 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:14:42,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:14:42,743 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:14:42,823 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:14:42,823 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:14:42,823 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:14:42,823 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:14:43,604 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-04-11 15:14:43,604 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:14:43,640 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:14:43,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:14:43,648 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:43,652 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:14:43,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:43,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:43,656 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:14:43,666 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:43,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:14:43,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:43,673 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:43,674 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:43,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:14:43,674 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:43,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:43,678 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-11 15:14:45,105 INFO L134 CoverageAnalysis]: Checked inductivity of 4431 backedges. 0 proven. 4431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:14:45,105 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:14:45,105 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-04-11 15:14:45,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-04-11 15:14:45,106 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-04-11 15:14:45,106 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=2652, Unknown=0, NotChecked=0, Total=2756 [2018-04-11 15:14:45,106 INFO L87 Difference]: Start difference. First operand 230 states and 231 transitions. Second operand 53 states. [2018-04-11 15:14:49,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:14:49,145 INFO L93 Difference]: Finished difference Result 237 states and 238 transitions. [2018-04-11 15:14:49,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-04-11 15:14:49,145 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 229 [2018-04-11 15:14:49,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:14:49,146 INFO L225 Difference]: With dead ends: 237 [2018-04-11 15:14:49,146 INFO L226 Difference]: Without dead ends: 237 [2018-04-11 15:14:49,147 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1217 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=316, Invalid=9986, Unknown=0, NotChecked=0, Total=10302 [2018-04-11 15:14:49,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-04-11 15:14:49,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 235. [2018-04-11 15:14:49,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-04-11 15:14:49,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 236 transitions. [2018-04-11 15:14:49,148 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 236 transitions. Word has length 229 [2018-04-11 15:14:49,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:14:49,148 INFO L459 AbstractCegarLoop]: Abstraction has 235 states and 236 transitions. [2018-04-11 15:14:49,148 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-04-11 15:14:49,148 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 236 transitions. [2018-04-11 15:14:49,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-04-11 15:14:49,149 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:14:49,149 INFO L355 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:14:49,149 INFO L408 AbstractCegarLoop]: === Iteration 59 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:14:49,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1280404323, now seen corresponding path program 43 times [2018-04-11 15:14:49,149 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:14:49,149 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:14:49,150 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:14:49,150 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:14:49,150 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:14:49,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:14:49,192 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:14:49,544 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:14:49,544 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:14:49,545 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:14:49,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:14:49,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:14:49,949 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:14:49,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:14:49,953 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:49,956 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:14:49,957 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:49,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:49,964 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:14:49,974 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:49,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:14:49,975 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:49,981 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:49,981 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:14:49,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:14:49,981 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:49,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:49,991 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-11 15:14:51,437 INFO L134 CoverageAnalysis]: Checked inductivity of 4644 backedges. 0 proven. 4644 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:14:51,437 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:14:51,438 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-04-11 15:14:51,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-04-11 15:14:51,438 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-04-11 15:14:51,438 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2861, Unknown=0, NotChecked=0, Total=2970 [2018-04-11 15:14:51,438 INFO L87 Difference]: Start difference. First operand 235 states and 236 transitions. Second operand 55 states. [2018-04-11 15:14:55,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:14:55,673 INFO L93 Difference]: Finished difference Result 242 states and 243 transitions. [2018-04-11 15:14:55,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-04-11 15:14:55,673 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 234 [2018-04-11 15:14:55,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:14:55,674 INFO L225 Difference]: With dead ends: 242 [2018-04-11 15:14:55,674 INFO L226 Difference]: Without dead ends: 242 [2018-04-11 15:14:55,674 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1411 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=331, Invalid=10799, Unknown=0, NotChecked=0, Total=11130 [2018-04-11 15:14:55,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-04-11 15:14:55,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 240. [2018-04-11 15:14:55,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-04-11 15:14:55,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 241 transitions. [2018-04-11 15:14:55,676 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 241 transitions. Word has length 234 [2018-04-11 15:14:55,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:14:55,676 INFO L459 AbstractCegarLoop]: Abstraction has 240 states and 241 transitions. [2018-04-11 15:14:55,676 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-04-11 15:14:55,676 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 241 transitions. [2018-04-11 15:14:55,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-04-11 15:14:55,677 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:14:55,677 INFO L355 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:14:55,677 INFO L408 AbstractCegarLoop]: === Iteration 60 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:14:55,677 INFO L82 PathProgramCache]: Analyzing trace with hash -78130360, now seen corresponding path program 44 times [2018-04-11 15:14:55,677 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:14:55,677 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:14:55,677 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:14:55,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:14:55,678 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:14:55,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:14:55,718 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:14:55,843 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:14:55,843 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:14:55,843 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:14:55,843 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:14:56,213 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:14:56,213 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:14:56,295 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:14:56,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:14:56,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:14:56,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:56,301 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-11 15:14:56,314 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 12 treesize of output 18 [2018-04-11 15:14:56,314 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:14:56,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:14:56,319 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-04-11 15:14:57,730 INFO L134 CoverageAnalysis]: Checked inductivity of 4862 backedges. 0 proven. 4862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:14:57,730 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:14:57,730 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-04-11 15:14:57,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-04-11 15:14:57,730 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-04-11 15:14:57,730 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=3188, Unknown=0, NotChecked=0, Total=3306 [2018-04-11 15:14:57,730 INFO L87 Difference]: Start difference. First operand 240 states and 241 transitions. Second operand 58 states. [2018-04-11 15:15:02,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:15:02,086 INFO L93 Difference]: Finished difference Result 247 states and 248 transitions. [2018-04-11 15:15:02,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-04-11 15:15:02,086 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 239 [2018-04-11 15:15:02,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:15:02,087 INFO L225 Difference]: With dead ends: 247 [2018-04-11 15:15:02,087 INFO L226 Difference]: Without dead ends: 247 [2018-04-11 15:15:02,087 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1728 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=358, Invalid=12074, Unknown=0, NotChecked=0, Total=12432 [2018-04-11 15:15:02,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-04-11 15:15:02,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 245. [2018-04-11 15:15:02,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-04-11 15:15:02,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 246 transitions. [2018-04-11 15:15:02,090 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 246 transitions. Word has length 239 [2018-04-11 15:15:02,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:15:02,090 INFO L459 AbstractCegarLoop]: Abstraction has 245 states and 246 transitions. [2018-04-11 15:15:02,090 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-04-11 15:15:02,090 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 246 transitions. [2018-04-11 15:15:02,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-04-11 15:15:02,091 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:15:02,091 INFO L355 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:15:02,091 INFO L408 AbstractCegarLoop]: === Iteration 61 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:15:02,091 INFO L82 PathProgramCache]: Analyzing trace with hash 167744131, now seen corresponding path program 45 times [2018-04-11 15:15:02,092 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:15:02,092 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:15:02,092 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:02,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:15:02,092 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:02,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:15:02,168 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:15:02,305 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:15:02,305 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:15:02,306 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:15:02,306 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:15:03,226 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-04-11 15:15:03,226 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:15:03,259 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:15:03,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:15:03,263 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:03,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:03,265 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-04-11 15:15:03,276 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 12 treesize of output 18 [2018-04-11 15:15:03,276 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:15:03,281 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:03,281 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-04-11 15:15:04,599 INFO L134 CoverageAnalysis]: Checked inductivity of 5085 backedges. 0 proven. 5085 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:15:04,599 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:15:04,599 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-04-11 15:15:04,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-04-11 15:15:04,599 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-04-11 15:15:04,599 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3079, Unknown=0, NotChecked=0, Total=3192 [2018-04-11 15:15:04,599 INFO L87 Difference]: Start difference. First operand 245 states and 246 transitions. Second operand 57 states. [2018-04-11 15:15:08,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:15:08,654 INFO L93 Difference]: Finished difference Result 252 states and 253 transitions. [2018-04-11 15:15:08,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-04-11 15:15:08,655 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 244 [2018-04-11 15:15:08,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:15:08,656 INFO L225 Difference]: With dead ends: 252 [2018-04-11 15:15:08,656 INFO L226 Difference]: Without dead ends: 252 [2018-04-11 15:15:08,656 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1520 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=343, Invalid=11647, Unknown=0, NotChecked=0, Total=11990 [2018-04-11 15:15:08,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-04-11 15:15:08,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 250. [2018-04-11 15:15:08,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-04-11 15:15:08,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 251 transitions. [2018-04-11 15:15:08,659 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 251 transitions. Word has length 244 [2018-04-11 15:15:08,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:15:08,659 INFO L459 AbstractCegarLoop]: Abstraction has 250 states and 251 transitions. [2018-04-11 15:15:08,659 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-04-11 15:15:08,659 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 251 transitions. [2018-04-11 15:15:08,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-04-11 15:15:08,660 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:15:08,660 INFO L355 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:15:08,660 INFO L408 AbstractCegarLoop]: === Iteration 62 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:15:08,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1577394216, now seen corresponding path program 46 times [2018-04-11 15:15:08,661 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:15:08,661 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:15:08,661 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:08,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:15:08,661 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:08,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:15:08,710 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:15:09,428 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:15:09,428 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:15:09,428 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:15:09,428 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:15:09,882 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:15:09,882 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:15:09,920 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:15:09,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:15:09,923 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:09,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:15:09,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:09,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:09,931 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:15:09,942 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:15:09,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:15:09,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:09,949 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:15:09,949 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:15:09,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:15:09,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:09,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:09,953 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-11 15:15:11,544 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 5313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:15:11,545 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:15:11,545 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-04-11 15:15:11,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-04-11 15:15:11,545 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-04-11 15:15:11,545 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3191, Unknown=0, NotChecked=0, Total=3306 [2018-04-11 15:15:11,545 INFO L87 Difference]: Start difference. First operand 250 states and 251 transitions. Second operand 58 states. [2018-04-11 15:15:16,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:15:16,191 INFO L93 Difference]: Finished difference Result 257 states and 258 transitions. [2018-04-11 15:15:16,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-04-11 15:15:16,192 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 249 [2018-04-11 15:15:16,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:15:16,192 INFO L225 Difference]: With dead ends: 257 [2018-04-11 15:15:16,192 INFO L226 Difference]: Without dead ends: 257 [2018-04-11 15:15:16,193 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1577 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=349, Invalid=12083, Unknown=0, NotChecked=0, Total=12432 [2018-04-11 15:15:16,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-04-11 15:15:16,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 255. [2018-04-11 15:15:16,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-04-11 15:15:16,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 256 transitions. [2018-04-11 15:15:16,195 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 256 transitions. Word has length 249 [2018-04-11 15:15:16,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:15:16,195 INFO L459 AbstractCegarLoop]: Abstraction has 255 states and 256 transitions. [2018-04-11 15:15:16,195 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-04-11 15:15:16,195 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 256 transitions. [2018-04-11 15:15:16,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-04-11 15:15:16,195 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:15:16,195 INFO L355 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:15:16,196 INFO L408 AbstractCegarLoop]: === Iteration 63 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:15:16,196 INFO L82 PathProgramCache]: Analyzing trace with hash 2046775715, now seen corresponding path program 47 times [2018-04-11 15:15:16,196 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:15:16,196 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:15:16,196 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:16,196 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:15:16,196 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:16,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:15:16,245 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:15:16,826 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:15:16,826 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:15:16,826 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:15:16,826 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:15:25,168 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-04-11 15:15:25,168 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:15:25,256 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:15:25,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:15:25,260 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:25,263 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:15:25,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:25,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:25,267 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:15:25,276 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:15:25,277 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:15:25,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:25,285 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:15:25,285 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:15:25,286 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-04-11 15:15:25,286 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:25,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:25,291 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:28 [2018-04-11 15:15:25,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-04-11 15:15:25,468 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:25,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:25,471 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:18 [2018-04-11 15:15:26,915 INFO L134 CoverageAnalysis]: Checked inductivity of 5546 backedges. 0 proven. 5546 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:15:26,915 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:15:26,915 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-04-11 15:15:26,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-04-11 15:15:26,916 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-04-11 15:15:26,916 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=3192, Unknown=0, NotChecked=0, Total=3306 [2018-04-11 15:15:26,916 INFO L87 Difference]: Start difference. First operand 255 states and 256 transitions. Second operand 58 states. [2018-04-11 15:15:31,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:15:31,917 INFO L93 Difference]: Finished difference Result 262 states and 263 transitions. [2018-04-11 15:15:31,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-04-11 15:15:31,918 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 254 [2018-04-11 15:15:31,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:15:31,918 INFO L225 Difference]: With dead ends: 262 [2018-04-11 15:15:31,918 INFO L226 Difference]: Without dead ends: 262 [2018-04-11 15:15:31,919 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1410 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=341, Invalid=11869, Unknown=0, NotChecked=0, Total=12210 [2018-04-11 15:15:31,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-04-11 15:15:31,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2018-04-11 15:15:31,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-04-11 15:15:31,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 261 transitions. [2018-04-11 15:15:31,920 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 261 transitions. Word has length 254 [2018-04-11 15:15:31,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:15:31,921 INFO L459 AbstractCegarLoop]: Abstraction has 260 states and 261 transitions. [2018-04-11 15:15:31,921 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-04-11 15:15:31,921 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 261 transitions. [2018-04-11 15:15:31,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-04-11 15:15:31,922 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:15:31,922 INFO L355 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:15:31,922 INFO L408 AbstractCegarLoop]: === Iteration 64 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:15:31,922 INFO L82 PathProgramCache]: Analyzing trace with hash 966776072, now seen corresponding path program 48 times [2018-04-11 15:15:31,922 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:15:31,922 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:15:31,923 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:31,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:15:31,923 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:32,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:15:32,002 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:15:32,041 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:15:32,041 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:15:32,041 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:15:32,042 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:15:32,963 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-04-11 15:15:32,963 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:15:32,999 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:15:33,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:15:33,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:33,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:15:33,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:33,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:33,014 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:15:33,030 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:15:33,030 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:15:33,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:15:33,031 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:33,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:15:33,036 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:33,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:33,039 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2018-04-11 15:15:34,651 INFO L134 CoverageAnalysis]: Checked inductivity of 5784 backedges. 0 proven. 5784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:15:34,651 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:15:34,651 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-04-11 15:15:34,651 INFO L442 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-04-11 15:15:34,651 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-04-11 15:15:34,651 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=3306, Unknown=0, NotChecked=0, Total=3422 [2018-04-11 15:15:34,652 INFO L87 Difference]: Start difference. First operand 260 states and 261 transitions. Second operand 59 states. [2018-04-11 15:15:39,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:15:39,891 INFO L93 Difference]: Finished difference Result 267 states and 268 transitions. [2018-04-11 15:15:39,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-04-11 15:15:39,891 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 259 [2018-04-11 15:15:39,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:15:39,892 INFO L225 Difference]: With dead ends: 267 [2018-04-11 15:15:39,892 INFO L226 Difference]: Without dead ends: 267 [2018-04-11 15:15:39,892 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1532 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=352, Invalid=12530, Unknown=0, NotChecked=0, Total=12882 [2018-04-11 15:15:39,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-04-11 15:15:39,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 265. [2018-04-11 15:15:39,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-04-11 15:15:39,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 266 transitions. [2018-04-11 15:15:39,895 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 266 transitions. Word has length 259 [2018-04-11 15:15:39,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:15:39,895 INFO L459 AbstractCegarLoop]: Abstraction has 265 states and 266 transitions. [2018-04-11 15:15:39,895 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-04-11 15:15:39,895 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 266 transitions. [2018-04-11 15:15:39,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-04-11 15:15:39,896 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:15:39,896 INFO L355 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:15:39,896 INFO L408 AbstractCegarLoop]: === Iteration 65 === [mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr3RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr1RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr0RequiresViolation, __U_MULTI_fopenbsd_cstpcpy_alloca_true_valid_memsafety_true_termination_i__cstpcpyErr2RequiresViolation]=== [2018-04-11 15:15:39,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1966254275, now seen corresponding path program 49 times [2018-04-11 15:15:39,897 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:15:39,897 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:15:39,897 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:39,897 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:15:39,897 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:15:39,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:15:39,955 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:15:40,549 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:15:40,549 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:15:40,549 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:15:40,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:15:40,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:15:41,003 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:15:41,008 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:15:41,009 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:41,015 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:15:41,015 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:41,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:41,019 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:15:41,028 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:15:41,029 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:15:41,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:15:41,029 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:41,034 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:15:41,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:15:41,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:15:41,038 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:15 [2018-04-11 15:15:42,784 INFO L134 CoverageAnalysis]: Checked inductivity of 6027 backedges. 0 proven. 6027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:15:42,784 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:15:42,784 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-04-11 15:15:42,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-04-11 15:15:42,785 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-04-11 15:15:42,785 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3539, Unknown=0, NotChecked=0, Total=3660 [2018-04-11 15:15:42,785 INFO L87 Difference]: Start difference. First operand 265 states and 266 transitions. Second operand 61 states. Received shutdown request... [2018-04-11 15:15:43,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 15:15:43,722 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-11 15:15:43,724 WARN L197 ceAbstractionStarter]: Timeout [2018-04-11 15:15:43,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 03:15:43 BoogieIcfgContainer [2018-04-11 15:15:43,725 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 15:15:43,725 INFO L168 Benchmark]: Toolchain (without parser) took 178732.15 ms. Allocated memory was 405.3 MB in the beginning and 2.4 GB in the end (delta: 2.0 GB). Free memory was 338.6 MB in the beginning and 1.0 GB in the end (delta: -667.9 MB). Peak memory consumption was 1.3 GB. Max. memory is 5.3 GB. [2018-04-11 15:15:43,726 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 405.3 MB. Free memory is still 365.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 15:15:43,726 INFO L168 Benchmark]: CACSL2BoogieTranslator took 203.73 ms. Allocated memory is still 405.3 MB. Free memory was 337.3 MB in the beginning and 313.5 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. [2018-04-11 15:15:43,726 INFO L168 Benchmark]: Boogie Preprocessor took 32.54 ms. Allocated memory is still 405.3 MB. Free memory was 313.5 MB in the beginning and 312.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-04-11 15:15:43,727 INFO L168 Benchmark]: RCFGBuilder took 349.43 ms. Allocated memory was 405.3 MB in the beginning and 597.2 MB in the end (delta: 191.9 MB). Free memory was 312.2 MB in the beginning and 535.3 MB in the end (delta: -223.1 MB). Peak memory consumption was 24.4 MB. Max. memory is 5.3 GB. [2018-04-11 15:15:43,727 INFO L168 Benchmark]: TraceAbstraction took 178143.59 ms. Allocated memory was 597.2 MB in the beginning and 2.4 GB in the end (delta: 1.8 GB). Free memory was 535.3 MB in the beginning and 1.0 GB in the end (delta: -471.3 MB). Peak memory consumption was 1.3 GB. Max. memory is 5.3 GB. [2018-04-11 15:15:43,728 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 405.3 MB. Free memory is still 365.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 203.73 ms. Allocated memory is still 405.3 MB. Free memory was 337.3 MB in the beginning and 313.5 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.54 ms. Allocated memory is still 405.3 MB. Free memory was 313.5 MB in the beginning and 312.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 349.43 ms. Allocated memory was 405.3 MB in the beginning and 597.2 MB in the end (delta: 191.9 MB). Free memory was 312.2 MB in the beginning and 535.3 MB in the end (delta: -223.1 MB). Peak memory consumption was 24.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 178143.59 ms. Allocated memory was 597.2 MB in the beginning and 2.4 GB in the end (delta: 1.8 GB). Free memory was 535.3 MB in the beginning and 1.0 GB in the end (delta: -471.3 MB). Peak memory consumption was 1.3 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 557]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 557). Cancelled while BasicCegarLoop was constructing difference of abstraction (265states) and interpolant automaton (currently 16 states, 61 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 73 known predicates. - TimeoutResultAtElement [Line: 545]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 545). Cancelled while BasicCegarLoop was constructing difference of abstraction (265states) and interpolant automaton (currently 16 states, 61 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 73 known predicates. - TimeoutResultAtElement [Line: 557]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 557). Cancelled while BasicCegarLoop was constructing difference of abstraction (265states) and interpolant automaton (currently 16 states, 61 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 73 known predicates. - TimeoutResultAtElement [Line: 542]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was constructing difference of abstraction (265states) and interpolant automaton (currently 16 states, 61 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 73 known predicates. - TimeoutResultAtElement [Line: 542]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was constructing difference of abstraction (265states) and interpolant automaton (currently 16 states, 61 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 73 known predicates. - TimeoutResultAtElement [Line: 542]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was constructing difference of abstraction (265states) and interpolant automaton (currently 16 states, 61 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 73 known predicates. - TimeoutResultAtElement [Line: 542]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 542). Cancelled while BasicCegarLoop was constructing difference of abstraction (265states) and interpolant automaton (currently 16 states, 61 states before enhancement), while PredicateComparison was comparing new predicate (quantifier-free) to 73 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 46 locations, 7 error locations. TIMEOUT Result, 178.1s OverallTime, 65 OverallIterations, 50 TraceHistogramMax, 103.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3434 SDtfs, 6806 SDslu, 111867 SDs, 0 SdLazy, 160022 SolverSat, 1556 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 52.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8911 GetRequests, 5467 SyntacticMatches, 5 SemanticMatches, 3438 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 31699 ImplicationChecksByTransitivity, 78.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=265occurred in iteration=64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 64 MinimizatonAttempts, 191 StatesRemovedByMinimization, 58 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 23.3s SatisfiabilityAnalysisTime, 50.1s InterpolantComputationTime, 14721 NumberOfCodeBlocks, 14712 NumberOfCodeBlocksAsserted, 756 NumberOfCheckSat, 7371 ConstructedInterpolants, 67 QuantifiedInterpolants, 20810347 SizeOfPredicates, 647 NumberOfNonLiveVariables, 31244 ConjunctsInSsa, 9362 ConjunctsInUnsatCore, 66 InterpolantComputations, 11 PerfectInterpolantSequences, 26/101809 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_15-15-43-732.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/openbsd_cstpcpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_15-15-43-732.csv Completed graceful shutdown