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/cstrncpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-666feb3-m [2018-04-11 15:09:37,781 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-04-11 15:09:37,782 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-04-11 15:09:37,791 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-04-11 15:09:37,791 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-04-11 15:09:37,792 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-04-11 15:09:37,793 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-04-11 15:09:37,794 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-04-11 15:09:37,795 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-04-11 15:09:37,796 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-04-11 15:09:37,796 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-04-11 15:09:37,796 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-04-11 15:09:37,797 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-04-11 15:09:37,797 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-04-11 15:09:37,798 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-04-11 15:09:37,799 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-04-11 15:09:37,800 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-04-11 15:09:37,801 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-04-11 15:09:37,802 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-04-11 15:09:37,802 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-04-11 15:09:37,807 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-04-11 15:09:37,808 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-04-11 15:09:37,808 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-04-11 15:09:37,808 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-04-11 15:09:37,809 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-04-11 15:09:37,810 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-04-11 15:09:37,810 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-04-11 15:09:37,810 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-04-11 15:09:37,811 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-04-11 15:09:37,811 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-04-11 15:09:37,812 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-04-11 15:09:37,812 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:09:37,835 INFO L110 SettingsManager]: Loading preferences was successful [2018-04-11 15:09:37,835 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-04-11 15:09:37,836 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-04-11 15:09:37,837 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-04-11 15:09:37,837 INFO L133 SettingsManager]: * Use SBE=true [2018-04-11 15:09:37,837 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-04-11 15:09:37,837 INFO L133 SettingsManager]: * sizeof long=4 [2018-04-11 15:09:37,838 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-04-11 15:09:37,838 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-04-11 15:09:37,838 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-04-11 15:09:37,838 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-04-11 15:09:37,838 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-04-11 15:09:37,838 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-04-11 15:09:37,839 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-04-11 15:09:37,839 INFO L133 SettingsManager]: * sizeof long double=12 [2018-04-11 15:09:37,839 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-04-11 15:09:37,839 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-04-11 15:09:37,839 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-04-11 15:09:37,839 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-04-11 15:09:37,840 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-04-11 15:09:37,840 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-04-11 15:09:37,840 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-04-11 15:09:37,840 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-04-11 15:09:37,840 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:09:37,870 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-04-11 15:09:37,879 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully (re)initialized [2018-04-11 15:09:37,882 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-04-11 15:09:37,883 INFO L271 PluginConnector]: Initializing CDTParser... [2018-04-11 15:09:37,884 INFO L276 PluginConnector]: CDTParser initialized [2018-04-11 15:09:37,884 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,185 INFO L225 CDTParser]: Created temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGb94eac1d1 [2018-04-11 15:09:38,330 INFO L287 CDTParser]: IsIndexed: true [2018-04-11 15:09:38,331 INFO L288 CDTParser]: Found 1 translation units. [2018-04-11 15:09:38,331 INFO L168 CDTParser]: Scanning cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,338 INFO L210 ultiparseSymbolTable]: Include resolver: [2018-04-11 15:09:38,338 INFO L215 ultiparseSymbolTable]: [2018-04-11 15:09:38,339 INFO L218 ultiparseSymbolTable]: Function table: [2018-04-11 15:09:38,339 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__ ('') in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,339 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____bswap_32 ('__bswap_32') in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,339 INFO L221 ultiparseSymbolTable]: Function definition of null ('main') in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,339 INFO L221 ultiparseSymbolTable]: Function definition of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____bswap_64 ('__bswap_64') in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,339 INFO L227 ultiparseSymbolTable]: Global variable table: [2018-04-11 15:09:38,339 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_mutex_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,339 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____u_short in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,339 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____rlim_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,340 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__size_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,340 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____mode_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,340 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____time_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,340 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__int8_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,340 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____timer_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,340 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____suseconds_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,340 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__caddr_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,340 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_mutexattr_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,340 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__u_int in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,340 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____rlim64_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,341 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____fsfilcnt_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,341 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pid_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,341 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__int32_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,341 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__fd_set in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,341 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__fsblkcnt_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,341 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__gid_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,341 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__fsfilcnt_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,341 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____syscall_ulong_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,341 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____blkcnt64_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,341 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____id_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,341 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____int32_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,341 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____caddr_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,341 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____int8_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,342 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____ssize_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,342 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__timer_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,342 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__mode_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,342 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____dev_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,342 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____nlink_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,342 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__key_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,342 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____uint64_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,342 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__ssize_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,342 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__u_quad_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,342 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____uid_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,342 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____fsword_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,343 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____blksize_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,343 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__sigset_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,343 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____qaddr_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,343 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____fsfilcnt64_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,343 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__u_int64_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,343 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_rwlock_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,343 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____u_int in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,343 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____useconds_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,343 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__id_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,343 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__loff_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,344 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__dev_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,344 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____int64_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,344 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__ino_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,344 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__ldiv_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,344 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__time_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,344 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__register_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,344 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_key_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,344 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_barrierattr_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,344 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____fsblkcnt_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,345 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____syscall_slong_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,345 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____loff_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,345 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__int64_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,345 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__fd_mask in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,345 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__suseconds_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,345 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_cond_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,345 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__fsid_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,345 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____WAIT_STATUS in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,345 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__u_int16_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,345 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__ushort in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,346 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____blkcnt_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,346 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_barrier_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,346 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____clock_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,346 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____u_quad_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,346 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____ino64_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,346 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____daddr_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,346 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____key_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,346 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_spinlock_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,346 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____uint8_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,346 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____gid_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,347 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____quad_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,347 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____ino_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,347 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____sigset_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,347 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____pid_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,347 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_condattr_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,347 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__clock_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,347 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__u_int8_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,347 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____uint16_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,347 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__uint in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,347 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__daddr_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,347 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____fsid_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,348 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__nlink_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,348 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,348 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____off_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,348 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_rwlockattr_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,348 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__u_long in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,348 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__clockid_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,348 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____fd_mask in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,348 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____sig_atomic_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,348 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____fsblkcnt64_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,348 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__u_int32_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,349 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__ulong in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,349 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_once_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,349 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____u_long in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,349 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__blksize_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,349 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____u_char in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,349 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____off64_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,349 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__u_short in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,349 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____uint32_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,349 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__wchar_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,349 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____int16_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,349 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__div_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,350 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____intptr_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,350 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____clockid_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,350 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__pthread_attr_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,350 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__blkcnt_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,350 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__u_char in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,350 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__off_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,350 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__quad_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,350 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____pthread_list_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,350 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__lldiv_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,350 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____socklen_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,350 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__int16_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,350 INFO L230 ultiparseSymbolTable]: Global variable declaration of __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i__uid_t in cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:38,365 INFO L330 CDTParser]: Deleted temporary CDT project at /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/data/FLAGb94eac1d1 [2018-04-11 15:09:38,369 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-04-11 15:09:38,370 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-04-11 15:09:38,370 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-04-11 15:09:38,371 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-04-11 15:09:38,375 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-04-11 15:09:38,375 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 03:09:38" (1/1) ... [2018-04-11 15:09:38,377 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4118d497 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:09:38, skipping insertion in model container [2018-04-11 15:09:38,377 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.04 03:09:38" (1/1) ... [2018-04-11 15:09:38,388 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 15:09:38,408 INFO L167 Dispatcher]: Using SV-COMP mode [2018-04-11 15:09:38,530 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 15:09:38,566 INFO L175 PostProcessor]: Settings: Checked method=main [2018-04-11 15:09:38,572 INFO L100 SccComputation]: Graph consists of 0 InCaSumBalls and 112 non ball SCCs. Number of states in SCCs 112. [2018-04-11 15:09:38,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:09:38 WrapperNode [2018-04-11 15:09:38,604 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-04-11 15:09:38,605 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-04-11 15:09:38,605 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-04-11 15:09:38,605 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-04-11 15:09:38,613 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:09:38" (1/1) ... [2018-04-11 15:09:38,613 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:09:38" (1/1) ... [2018-04-11 15:09:38,624 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:09:38" (1/1) ... [2018-04-11 15:09:38,624 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:09:38" (1/1) ... [2018-04-11 15:09:38,632 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:09:38" (1/1) ... [2018-04-11 15:09:38,636 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:09:38" (1/1) ... [2018-04-11 15:09:38,638 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:09:38" (1/1) ... [2018-04-11 15:09:38,642 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-04-11 15:09:38,642 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-04-11 15:09:38,643 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-04-11 15:09:38,643 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-04-11 15:09:38,644 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:09:38" (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:09:38,742 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-04-11 15:09:38,742 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-04-11 15:09:38,742 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-11 15:09:38,742 INFO L136 BoogieDeclarations]: Found implementation of procedure __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-11 15:09:38,743 INFO L136 BoogieDeclarations]: Found implementation of procedure cstrncpy [2018-04-11 15:09:38,743 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-04-11 15:09:38,743 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____bswap_32 [2018-04-11 15:09:38,743 INFO L128 BoogieDeclarations]: Found specification of procedure __U_MULTI_fcstrncpy_alloca_true_valid_memsafety_true_termination_i____bswap_64 [2018-04-11 15:09:38,743 INFO L128 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-04-11 15:09:38,743 INFO L128 BoogieDeclarations]: Found specification of procedure atof [2018-04-11 15:09:38,743 INFO L128 BoogieDeclarations]: Found specification of procedure atoi [2018-04-11 15:09:38,743 INFO L128 BoogieDeclarations]: Found specification of procedure atol [2018-04-11 15:09:38,743 INFO L128 BoogieDeclarations]: Found specification of procedure atoll [2018-04-11 15:09:38,743 INFO L128 BoogieDeclarations]: Found specification of procedure strtod [2018-04-11 15:09:38,744 INFO L128 BoogieDeclarations]: Found specification of procedure strtof [2018-04-11 15:09:38,744 INFO L128 BoogieDeclarations]: Found specification of procedure strtold [2018-04-11 15:09:38,744 INFO L128 BoogieDeclarations]: Found specification of procedure strtol [2018-04-11 15:09:38,744 INFO L128 BoogieDeclarations]: Found specification of procedure strtoul [2018-04-11 15:09:38,744 INFO L128 BoogieDeclarations]: Found specification of procedure strtoq [2018-04-11 15:09:38,744 INFO L128 BoogieDeclarations]: Found specification of procedure strtouq [2018-04-11 15:09:38,744 INFO L128 BoogieDeclarations]: Found specification of procedure strtoll [2018-04-11 15:09:38,744 INFO L128 BoogieDeclarations]: Found specification of procedure strtoull [2018-04-11 15:09:38,744 INFO L128 BoogieDeclarations]: Found specification of procedure l64a [2018-04-11 15:09:38,744 INFO L128 BoogieDeclarations]: Found specification of procedure a64l [2018-04-11 15:09:38,745 INFO L128 BoogieDeclarations]: Found specification of procedure select [2018-04-11 15:09:38,745 INFO L128 BoogieDeclarations]: Found specification of procedure pselect [2018-04-11 15:09:38,745 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-04-11 15:09:38,745 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-04-11 15:09:38,745 INFO L128 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-04-11 15:09:38,745 INFO L128 BoogieDeclarations]: Found specification of procedure random [2018-04-11 15:09:38,745 INFO L128 BoogieDeclarations]: Found specification of procedure srandom [2018-04-11 15:09:38,745 INFO L128 BoogieDeclarations]: Found specification of procedure initstate [2018-04-11 15:09:38,745 INFO L128 BoogieDeclarations]: Found specification of procedure setstate [2018-04-11 15:09:38,746 INFO L128 BoogieDeclarations]: Found specification of procedure random_r [2018-04-11 15:09:38,746 INFO L128 BoogieDeclarations]: Found specification of procedure srandom_r [2018-04-11 15:09:38,746 INFO L128 BoogieDeclarations]: Found specification of procedure initstate_r [2018-04-11 15:09:38,746 INFO L128 BoogieDeclarations]: Found specification of procedure setstate_r [2018-04-11 15:09:38,746 INFO L128 BoogieDeclarations]: Found specification of procedure rand [2018-04-11 15:09:38,746 INFO L128 BoogieDeclarations]: Found specification of procedure srand [2018-04-11 15:09:38,746 INFO L128 BoogieDeclarations]: Found specification of procedure rand_r [2018-04-11 15:09:38,746 INFO L128 BoogieDeclarations]: Found specification of procedure drand48 [2018-04-11 15:09:38,746 INFO L128 BoogieDeclarations]: Found specification of procedure erand48 [2018-04-11 15:09:38,747 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48 [2018-04-11 15:09:38,747 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48 [2018-04-11 15:09:38,747 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48 [2018-04-11 15:09:38,747 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48 [2018-04-11 15:09:38,747 INFO L128 BoogieDeclarations]: Found specification of procedure srand48 [2018-04-11 15:09:38,747 INFO L128 BoogieDeclarations]: Found specification of procedure seed48 [2018-04-11 15:09:38,747 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48 [2018-04-11 15:09:38,747 INFO L128 BoogieDeclarations]: Found specification of procedure drand48_r [2018-04-11 15:09:38,747 INFO L128 BoogieDeclarations]: Found specification of procedure erand48_r [2018-04-11 15:09:38,747 INFO L128 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-04-11 15:09:38,748 INFO L128 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-04-11 15:09:38,748 INFO L128 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-04-11 15:09:38,748 INFO L128 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-04-11 15:09:38,748 INFO L128 BoogieDeclarations]: Found specification of procedure srand48_r [2018-04-11 15:09:38,748 INFO L128 BoogieDeclarations]: Found specification of procedure seed48_r [2018-04-11 15:09:38,748 INFO L128 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-04-11 15:09:38,748 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-04-11 15:09:38,748 INFO L128 BoogieDeclarations]: Found specification of procedure calloc [2018-04-11 15:09:38,749 INFO L128 BoogieDeclarations]: Found specification of procedure realloc [2018-04-11 15:09:38,749 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-04-11 15:09:38,749 INFO L128 BoogieDeclarations]: Found specification of procedure cfree [2018-04-11 15:09:38,749 INFO L128 BoogieDeclarations]: Found specification of procedure alloca [2018-04-11 15:09:38,749 INFO L128 BoogieDeclarations]: Found specification of procedure valloc [2018-04-11 15:09:38,749 INFO L128 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-04-11 15:09:38,749 INFO L128 BoogieDeclarations]: Found specification of procedure abort [2018-04-11 15:09:38,749 INFO L128 BoogieDeclarations]: Found specification of procedure atexit [2018-04-11 15:09:38,749 INFO L128 BoogieDeclarations]: Found specification of procedure on_exit [2018-04-11 15:09:38,750 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-04-11 15:09:38,750 INFO L128 BoogieDeclarations]: Found specification of procedure _Exit [2018-04-11 15:09:38,750 INFO L128 BoogieDeclarations]: Found specification of procedure getenv [2018-04-11 15:09:38,750 INFO L128 BoogieDeclarations]: Found specification of procedure putenv [2018-04-11 15:09:38,750 INFO L128 BoogieDeclarations]: Found specification of procedure setenv [2018-04-11 15:09:38,750 INFO L128 BoogieDeclarations]: Found specification of procedure unsetenv [2018-04-11 15:09:38,750 INFO L128 BoogieDeclarations]: Found specification of procedure clearenv [2018-04-11 15:09:38,750 INFO L128 BoogieDeclarations]: Found specification of procedure mktemp [2018-04-11 15:09:38,750 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemp [2018-04-11 15:09:38,750 INFO L128 BoogieDeclarations]: Found specification of procedure mkstemps [2018-04-11 15:09:38,750 INFO L128 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-04-11 15:09:38,750 INFO L128 BoogieDeclarations]: Found specification of procedure system [2018-04-11 15:09:38,750 INFO L128 BoogieDeclarations]: Found specification of procedure realpath [2018-04-11 15:09:38,750 INFO L128 BoogieDeclarations]: Found specification of procedure bsearch [2018-04-11 15:09:38,751 INFO L128 BoogieDeclarations]: Found specification of procedure qsort [2018-04-11 15:09:38,751 INFO L128 BoogieDeclarations]: Found specification of procedure abs [2018-04-11 15:09:38,751 INFO L128 BoogieDeclarations]: Found specification of procedure labs [2018-04-11 15:09:38,751 INFO L128 BoogieDeclarations]: Found specification of procedure llabs [2018-04-11 15:09:38,751 INFO L128 BoogieDeclarations]: Found specification of procedure div [2018-04-11 15:09:38,751 INFO L128 BoogieDeclarations]: Found specification of procedure ldiv [2018-04-11 15:09:38,751 INFO L128 BoogieDeclarations]: Found specification of procedure lldiv [2018-04-11 15:09:38,751 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt [2018-04-11 15:09:38,751 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt [2018-04-11 15:09:38,751 INFO L128 BoogieDeclarations]: Found specification of procedure gcvt [2018-04-11 15:09:38,751 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt [2018-04-11 15:09:38,751 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt [2018-04-11 15:09:38,751 INFO L128 BoogieDeclarations]: Found specification of procedure qgcvt [2018-04-11 15:09:38,751 INFO L128 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-04-11 15:09:38,751 INFO L128 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-04-11 15:09:38,752 INFO L128 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-04-11 15:09:38,752 INFO L128 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-04-11 15:09:38,752 INFO L128 BoogieDeclarations]: Found specification of procedure mblen [2018-04-11 15:09:38,752 INFO L128 BoogieDeclarations]: Found specification of procedure mbtowc [2018-04-11 15:09:38,752 INFO L128 BoogieDeclarations]: Found specification of procedure wctomb [2018-04-11 15:09:38,752 INFO L128 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-04-11 15:09:38,752 INFO L128 BoogieDeclarations]: Found specification of procedure wcstombs [2018-04-11 15:09:38,752 INFO L128 BoogieDeclarations]: Found specification of procedure rpmatch [2018-04-11 15:09:38,752 INFO L128 BoogieDeclarations]: Found specification of procedure getsubopt [2018-04-11 15:09:38,752 INFO L128 BoogieDeclarations]: Found specification of procedure getloadavg [2018-04-11 15:09:38,752 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-04-11 15:09:38,753 INFO L128 BoogieDeclarations]: Found specification of procedure cstrncpy [2018-04-11 15:09:38,753 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-04-11 15:09:38,753 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-04-11 15:09:38,753 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-04-11 15:09:38,753 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-04-11 15:09:38,753 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-04-11 15:09:38,753 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-04-11 15:09:38,753 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-04-11 15:09:38,753 INFO L128 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-04-11 15:09:39,008 INFO L259 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-04-11 15:09:39,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 03:09:39 BoogieIcfgContainer [2018-04-11 15:09:39,009 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-04-11 15:09:39,009 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-04-11 15:09:39,009 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-04-11 15:09:39,012 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-04-11 15:09:39,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.04 03:09:38" (1/3) ... [2018-04-11 15:09:39,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1777397c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 03:09:39, skipping insertion in model container [2018-04-11 15:09:39,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.04 03:09:38" (2/3) ... [2018-04-11 15:09:39,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1777397c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.04 03:09:39, skipping insertion in model container [2018-04-11 15:09:39,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.04 03:09:39" (3/3) ... [2018-04-11 15:09:39,014 INFO L107 eAbstractionObserver]: Analyzing ICFG cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-04-11 15:09:39,022 INFO L131 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-04-11 15:09:39,030 INFO L143 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-04-11 15:09:39,065 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-04-11 15:09:39,065 INFO L369 AbstractCegarLoop]: Interprodecural is true [2018-04-11 15:09:39,065 INFO L370 AbstractCegarLoop]: Hoare is false [2018-04-11 15:09:39,065 INFO L371 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-04-11 15:09:39,066 INFO L372 AbstractCegarLoop]: Backedges is TWOTRACK [2018-04-11 15:09:39,066 INFO L373 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-04-11 15:09:39,066 INFO L374 AbstractCegarLoop]: Difference is false [2018-04-11 15:09:39,066 INFO L375 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-04-11 15:09:39,066 INFO L380 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-04-11 15:09:39,067 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-04-11 15:09:39,075 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-04-11 15:09:39,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-11 15:09:39,081 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:39,081 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:09:39,081 INFO L408 AbstractCegarLoop]: === Iteration 1 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:09:39,084 INFO L82 PathProgramCache]: Analyzing trace with hash -441767553, now seen corresponding path program 1 times [2018-04-11 15:09:39,085 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:39,085 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:39,117 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:39,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:09:39,118 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:39,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:39,154 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:09:39,200 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:09:39,202 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:09:39,202 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-04-11 15:09:39,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-04-11 15:09:39,215 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-04-11 15:09:39,216 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-04-11 15:09:39,218 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 4 states. [2018-04-11 15:09:39,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:39,275 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-04-11 15:09:39,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-04-11 15:09:39,276 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-04-11 15:09:39,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:39,285 INFO L225 Difference]: With dead ends: 45 [2018-04-11 15:09:39,285 INFO L226 Difference]: Without dead ends: 42 [2018-04-11 15:09:39,287 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:09:39,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-04-11 15:09:39,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-04-11 15:09:39,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-04-11 15:09:39,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-04-11 15:09:39,312 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 13 [2018-04-11 15:09:39,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:39,312 INFO L459 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-04-11 15:09:39,312 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-04-11 15:09:39,312 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-04-11 15:09:39,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-04-11 15:09:39,312 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:39,312 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:09:39,313 INFO L408 AbstractCegarLoop]: === Iteration 2 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:09:39,313 INFO L82 PathProgramCache]: Analyzing trace with hash -441767552, now seen corresponding path program 1 times [2018-04-11 15:09:39,313 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:39,313 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:39,314 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:39,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:09:39,314 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:39,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:39,327 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:09:39,390 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:09:39,391 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:09:39,391 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-04-11 15:09:39,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:09:39,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:09:39,392 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:09:39,392 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 5 states. [2018-04-11 15:09:39,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:39,426 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-04-11 15:09:39,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:09:39,427 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-04-11 15:09:39,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:39,427 INFO L225 Difference]: With dead ends: 41 [2018-04-11 15:09:39,427 INFO L226 Difference]: Without dead ends: 41 [2018-04-11 15:09:39,428 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:09:39,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-04-11 15:09:39,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-04-11 15:09:39,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-04-11 15:09:39,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-04-11 15:09:39,430 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 13 [2018-04-11 15:09:39,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:39,431 INFO L459 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-04-11 15:09:39,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:09:39,431 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-04-11 15:09:39,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-11 15:09:39,431 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:39,432 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:09:39,432 INFO L408 AbstractCegarLoop]: === Iteration 3 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:09:39,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1083273766, now seen corresponding path program 1 times [2018-04-11 15:09:39,432 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:39,432 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:39,433 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:39,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:09:39,433 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:39,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:39,451 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:09:39,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:09:39,512 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:09:39,512 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 15:09:39,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 15:09:39,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 15:09:39,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:09:39,513 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 6 states. [2018-04-11 15:09:39,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:39,581 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-04-11 15:09:39,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-04-11 15:09:39,582 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-04-11 15:09:39,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:39,582 INFO L225 Difference]: With dead ends: 40 [2018-04-11 15:09:39,582 INFO L226 Difference]: Without dead ends: 40 [2018-04-11 15:09:39,583 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-04-11 15:09:39,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-04-11 15:09:39,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-04-11 15:09:39,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-04-11 15:09:39,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2018-04-11 15:09:39,585 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 18 [2018-04-11 15:09:39,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:39,585 INFO L459 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2018-04-11 15:09:39,585 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 15:09:39,585 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2018-04-11 15:09:39,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-04-11 15:09:39,585 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:39,585 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:09:39,586 INFO L408 AbstractCegarLoop]: === Iteration 4 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:09:39,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1083273765, now seen corresponding path program 1 times [2018-04-11 15:09:39,586 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:39,586 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:39,586 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:39,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:09:39,587 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:39,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:39,597 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:09:39,688 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:09:39,688 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:09:39,688 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 15:09:39,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 15:09:39,689 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 15:09:39,689 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-04-11 15:09:39,689 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 9 states. [2018-04-11 15:09:39,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:39,776 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-04-11 15:09:39,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 15:09:39,777 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-04-11 15:09:39,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:39,779 INFO L225 Difference]: With dead ends: 50 [2018-04-11 15:09:39,779 INFO L226 Difference]: Without dead ends: 50 [2018-04-11 15:09:39,779 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-04-11 15:09:39,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-04-11 15:09:39,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2018-04-11 15:09:39,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-04-11 15:09:39,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-04-11 15:09:39,781 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 18 [2018-04-11 15:09:39,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:39,782 INFO L459 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-04-11 15:09:39,782 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 15:09:39,782 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-04-11 15:09:39,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-11 15:09:39,782 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:39,782 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:09:39,782 INFO L408 AbstractCegarLoop]: === Iteration 5 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:09:39,782 INFO L82 PathProgramCache]: Analyzing trace with hash 778251610, now seen corresponding path program 1 times [2018-04-11 15:09:39,782 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:39,783 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:39,783 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:39,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:09:39,784 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:39,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:39,798 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:09:39,804 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:09:39,804 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:09:39,804 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:09:39,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:09:39,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:39,841 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:09:39,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:09:39,872 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:39,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:39,874 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 15:09:39,908 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:09:39,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:39,912 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:09:39,912 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2018-04-11 15:09:39,942 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:09:39,942 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:09:39,942 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 15:09:39,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-04-11 15:09:39,943 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-04-11 15:09:39,943 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-04-11 15:09:39,943 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 7 states. [2018-04-11 15:09:40,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:40,023 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-04-11 15:09:40,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 15:09:40,025 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-04-11 15:09:40,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:40,026 INFO L225 Difference]: With dead ends: 42 [2018-04-11 15:09:40,026 INFO L226 Difference]: Without dead ends: 42 [2018-04-11 15:09:40,026 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-04-11 15:09:40,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-04-11 15:09:40,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-04-11 15:09:40,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-04-11 15:09:40,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2018-04-11 15:09:40,029 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 19 [2018-04-11 15:09:40,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:40,029 INFO L459 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2018-04-11 15:09:40,029 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-04-11 15:09:40,030 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-04-11 15:09:40,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-11 15:09:40,030 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:40,030 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:09:40,030 INFO L408 AbstractCegarLoop]: === Iteration 6 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:09:40,030 INFO L82 PathProgramCache]: Analyzing trace with hash 778251611, now seen corresponding path program 1 times [2018-04-11 15:09:40,030 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:40,031 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:40,031 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:40,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:09:40,031 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:40,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:40,042 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:09:40,046 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:09:40,047 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:09:40,047 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:09:40,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:09:40,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:40,078 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:09:40,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:09:40,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:40,103 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:09:40,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:40,109 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:09:40,109 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:22, output treesize:17 [2018-04-11 15:09:40,147 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:40,147 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:40,148 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:09:40,148 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:40,160 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:09:40,160 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:40,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:40,166 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2018-04-11 15:09:40,286 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:09:40,286 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:09:40,287 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-04-11 15:09:40,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 15:09:40,287 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 15:09:40,287 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-04-11 15:09:40,287 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand 13 states. [2018-04-11 15:09:40,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:40,627 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2018-04-11 15:09:40,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 15:09:40,628 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 19 [2018-04-11 15:09:40,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:40,628 INFO L225 Difference]: With dead ends: 82 [2018-04-11 15:09:40,628 INFO L226 Difference]: Without dead ends: 82 [2018-04-11 15:09:40,629 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2018-04-11 15:09:40,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-04-11 15:09:40,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 67. [2018-04-11 15:09:40,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-04-11 15:09:40,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2018-04-11 15:09:40,633 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 81 transitions. Word has length 19 [2018-04-11 15:09:40,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:40,633 INFO L459 AbstractCegarLoop]: Abstraction has 67 states and 81 transitions. [2018-04-11 15:09:40,633 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 15:09:40,633 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 81 transitions. [2018-04-11 15:09:40,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-04-11 15:09:40,634 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:40,634 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:09:40,634 INFO L408 AbstractCegarLoop]: === Iteration 7 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:09:40,635 INFO L82 PathProgramCache]: Analyzing trace with hash 191445597, now seen corresponding path program 1 times [2018-04-11 15:09:40,635 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:40,635 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:40,636 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:40,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:09:40,636 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:40,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:40,644 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:09:40,648 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:09:40,648 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:09:40,648 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:09:40,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:09:40,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:40,674 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:09:40,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:09:40,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:40,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:09:40,685 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:40,690 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:09:40,690 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-04-11 15:09:40,703 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:40,705 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:09:40,705 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:40,712 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:40,713 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:40,713 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:09:40,713 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:40,717 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:09:40,718 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:09:40,740 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:09:40,740 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:09:40,740 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 15:09:40,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-04-11 15:09:40,741 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-04-11 15:09:40,741 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-04-11 15:09:40,741 INFO L87 Difference]: Start difference. First operand 67 states and 81 transitions. Second operand 9 states. [2018-04-11 15:09:40,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:40,846 INFO L93 Difference]: Finished difference Result 76 states and 92 transitions. [2018-04-11 15:09:40,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-04-11 15:09:40,847 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-04-11 15:09:40,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:40,847 INFO L225 Difference]: With dead ends: 76 [2018-04-11 15:09:40,848 INFO L226 Difference]: Without dead ends: 76 [2018-04-11 15:09:40,848 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-04-11 15:09:40,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-04-11 15:09:40,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 43. [2018-04-11 15:09:40,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-04-11 15:09:40,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-04-11 15:09:40,851 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 19 [2018-04-11 15:09:40,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:40,851 INFO L459 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-04-11 15:09:40,851 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-04-11 15:09:40,851 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-04-11 15:09:40,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-11 15:09:40,852 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:40,852 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] [2018-04-11 15:09:40,852 INFO L408 AbstractCegarLoop]: === Iteration 8 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:09:40,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1006730087, now seen corresponding path program 1 times [2018-04-11 15:09:40,852 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:40,852 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:40,853 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:40,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:09:40,853 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:40,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:40,861 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:09:40,889 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:09:40,889 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:09:40,889 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-04-11 15:09:40,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 15:09:40,889 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 15:09:40,889 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:09:40,889 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 6 states. [2018-04-11 15:09:40,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:40,910 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2018-04-11 15:09:40,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 15:09:40,910 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-04-11 15:09:40,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:40,910 INFO L225 Difference]: With dead ends: 77 [2018-04-11 15:09:40,910 INFO L226 Difference]: Without dead ends: 77 [2018-04-11 15:09:40,911 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-04-11 15:09:40,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-04-11 15:09:40,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 65. [2018-04-11 15:09:40,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-04-11 15:09:40,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2018-04-11 15:09:40,913 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 23 [2018-04-11 15:09:40,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:40,914 INFO L459 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2018-04-11 15:09:40,914 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 15:09:40,914 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2018-04-11 15:09:40,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-11 15:09:40,914 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:40,914 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] [2018-04-11 15:09:40,914 INFO L408 AbstractCegarLoop]: === Iteration 9 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:09:40,914 INFO L82 PathProgramCache]: Analyzing trace with hash -2027798441, now seen corresponding path program 1 times [2018-04-11 15:09:40,914 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:40,914 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:40,915 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:40,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:09:40,915 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:40,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:40,922 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:09:41,011 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:09:41,012 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:09:41,012 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-04-11 15:09:41,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 15:09:41,012 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 15:09:41,012 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-04-11 15:09:41,012 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand 10 states. [2018-04-11 15:09:41,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:41,093 INFO L93 Difference]: Finished difference Result 121 states and 137 transitions. [2018-04-11 15:09:41,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 15:09:41,093 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2018-04-11 15:09:41,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:41,094 INFO L225 Difference]: With dead ends: 121 [2018-04-11 15:09:41,094 INFO L226 Difference]: Without dead ends: 121 [2018-04-11 15:09:41,094 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2018-04-11 15:09:41,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-04-11 15:09:41,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 86. [2018-04-11 15:09:41,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-04-11 15:09:41,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 101 transitions. [2018-04-11 15:09:41,101 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 101 transitions. Word has length 23 [2018-04-11 15:09:41,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:41,101 INFO L459 AbstractCegarLoop]: Abstraction has 86 states and 101 transitions. [2018-04-11 15:09:41,101 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 15:09:41,101 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 101 transitions. [2018-04-11 15:09:41,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-04-11 15:09:41,102 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:41,102 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] [2018-04-11 15:09:41,102 INFO L408 AbstractCegarLoop]: === Iteration 10 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:09:41,102 INFO L82 PathProgramCache]: Analyzing trace with hash 678820953, now seen corresponding path program 1 times [2018-04-11 15:09:41,102 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:41,102 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:41,103 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:41,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:09:41,103 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:41,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:41,117 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:09:41,328 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:09:41,328 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:09:41,328 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:09:41,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:09:41,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:41,360 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:09:41,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:09:41,365 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:41,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:41,367 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 15:09:41,389 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:09:41,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 13 treesize of output 12 [2018-04-11 15:09:41,392 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:41,394 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:41,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:41,399 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-04-11 15:09:41,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2018-04-11 15:09:41,527 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2018-04-11 15:09:41,527 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:09:41,530 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:09:41,537 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:09:41,537 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:54 [2018-04-11 15:09:41,616 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:09:41,616 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-04-11 15:09:41,616 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2018-04-11 15:09:41,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 15:09:41,617 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 15:09:41,617 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2018-04-11 15:09:41,617 INFO L87 Difference]: Start difference. First operand 86 states and 101 transitions. Second operand 21 states. [2018-04-11 15:09:41,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:41,985 INFO L93 Difference]: Finished difference Result 115 states and 132 transitions. [2018-04-11 15:09:41,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 15:09:41,985 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 23 [2018-04-11 15:09:41,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:41,986 INFO L225 Difference]: With dead ends: 115 [2018-04-11 15:09:41,986 INFO L226 Difference]: Without dead ends: 115 [2018-04-11 15:09:41,986 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=121, Invalid=809, Unknown=0, NotChecked=0, Total=930 [2018-04-11 15:09:41,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-04-11 15:09:41,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 90. [2018-04-11 15:09:41,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-04-11 15:09:41,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 107 transitions. [2018-04-11 15:09:41,993 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 107 transitions. Word has length 23 [2018-04-11 15:09:41,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:41,993 INFO L459 AbstractCegarLoop]: Abstraction has 90 states and 107 transitions. [2018-04-11 15:09:41,993 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 15:09:41,993 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 107 transitions. [2018-04-11 15:09:41,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-11 15:09:41,994 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:41,994 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:09:41,994 INFO L408 AbstractCegarLoop]: === Iteration 11 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:09:41,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1161751038, now seen corresponding path program 1 times [2018-04-11 15:09:41,995 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:41,995 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:41,995 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:41,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:09:41,996 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:42,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:42,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:09:42,035 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:09:42,036 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:09:42,036 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 15:09:42,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-04-11 15:09:42,036 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-04-11 15:09:42,036 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:09:42,036 INFO L87 Difference]: Start difference. First operand 90 states and 107 transitions. Second operand 6 states. [2018-04-11 15:09:42,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:42,096 INFO L93 Difference]: Finished difference Result 104 states and 119 transitions. [2018-04-11 15:09:42,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-04-11 15:09:42,096 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-04-11 15:09:42,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:42,097 INFO L225 Difference]: With dead ends: 104 [2018-04-11 15:09:42,097 INFO L226 Difference]: Without dead ends: 104 [2018-04-11 15:09:42,097 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-04-11 15:09:42,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-04-11 15:09:42,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 89. [2018-04-11 15:09:42,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-04-11 15:09:42,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 104 transitions. [2018-04-11 15:09:42,102 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 104 transitions. Word has length 24 [2018-04-11 15:09:42,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:42,102 INFO L459 AbstractCegarLoop]: Abstraction has 89 states and 104 transitions. [2018-04-11 15:09:42,102 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-04-11 15:09:42,102 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 104 transitions. [2018-04-11 15:09:42,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-11 15:09:42,103 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:42,103 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:09:42,103 INFO L408 AbstractCegarLoop]: === Iteration 12 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:09:42,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1161751037, now seen corresponding path program 1 times [2018-04-11 15:09:42,103 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:42,103 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:42,104 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:42,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:09:42,104 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:42,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:42,111 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:09:42,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:09:42,165 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:09:42,165 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-04-11 15:09:42,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 15:09:42,165 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 15:09:42,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-04-11 15:09:42,166 INFO L87 Difference]: Start difference. First operand 89 states and 104 transitions. Second operand 8 states. [2018-04-11 15:09:42,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:42,248 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2018-04-11 15:09:42,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 15:09:42,248 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-04-11 15:09:42,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:42,249 INFO L225 Difference]: With dead ends: 112 [2018-04-11 15:09:42,249 INFO L226 Difference]: Without dead ends: 112 [2018-04-11 15:09:42,249 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-04-11 15:09:42,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-04-11 15:09:42,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 105. [2018-04-11 15:09:42,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-04-11 15:09:42,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2018-04-11 15:09:42,253 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 24 [2018-04-11 15:09:42,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:42,253 INFO L459 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2018-04-11 15:09:42,254 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 15:09:42,254 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2018-04-11 15:09:42,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-11 15:09:42,255 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:42,255 INFO L355 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:09:42,255 INFO L408 AbstractCegarLoop]: === Iteration 13 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:09:42,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1544868357, now seen corresponding path program 1 times [2018-04-11 15:09:42,255 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:42,255 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:42,256 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:42,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:09:42,256 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:42,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:42,265 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:09:42,271 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:09:42,271 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:09:42,271 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:09:42,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:09:42,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:42,294 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:09:42,304 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:09:42,304 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:42,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:09:42,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:42,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:42,315 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:09:42,331 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:42,332 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:09:42,333 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:42,342 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:42,343 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:42,343 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:09:42,343 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:42,347 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:09:42,347 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:09:42,408 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:09:42,408 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:09:42,408 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-04-11 15:09:42,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-04-11 15:09:42,409 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-04-11 15:09:42,409 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-04-11 15:09:42,409 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand 12 states. [2018-04-11 15:09:42,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:42,626 INFO L93 Difference]: Finished difference Result 130 states and 145 transitions. [2018-04-11 15:09:42,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 15:09:42,627 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2018-04-11 15:09:42,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:42,628 INFO L225 Difference]: With dead ends: 130 [2018-04-11 15:09:42,628 INFO L226 Difference]: Without dead ends: 130 [2018-04-11 15:09:42,628 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2018-04-11 15:09:42,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-04-11 15:09:42,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 113. [2018-04-11 15:09:42,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-04-11 15:09:42,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 127 transitions. [2018-04-11 15:09:42,632 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 127 transitions. Word has length 24 [2018-04-11 15:09:42,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:42,633 INFO L459 AbstractCegarLoop]: Abstraction has 113 states and 127 transitions. [2018-04-11 15:09:42,633 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-04-11 15:09:42,633 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2018-04-11 15:09:42,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-04-11 15:09:42,634 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:42,634 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:09:42,634 INFO L408 AbstractCegarLoop]: === Iteration 14 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:09:42,634 INFO L82 PathProgramCache]: Analyzing trace with hash -431386979, now seen corresponding path program 1 times [2018-04-11 15:09:42,634 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:42,634 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:42,635 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:42,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:09:42,635 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:42,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:42,642 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:09:42,645 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:09:42,645 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:09:42,646 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:09:42,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:09:42,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:42,665 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:09:42,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:09:42,688 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:42,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:09:42,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:42,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:42,697 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:09:42,708 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:42,709 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:42,709 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:09:42,709 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:42,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:09:42,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:42,721 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:09:42,721 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:09:42,784 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:09:42,784 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:09:42,784 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-04-11 15:09:42,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-04-11 15:09:42,785 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-04-11 15:09:42,785 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-04-11 15:09:42,785 INFO L87 Difference]: Start difference. First operand 113 states and 127 transitions. Second operand 10 states. [2018-04-11 15:09:42,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:42,936 INFO L93 Difference]: Finished difference Result 130 states and 146 transitions. [2018-04-11 15:09:42,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-04-11 15:09:42,936 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-04-11 15:09:42,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:42,937 INFO L225 Difference]: With dead ends: 130 [2018-04-11 15:09:42,937 INFO L226 Difference]: Without dead ends: 130 [2018-04-11 15:09:42,937 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2018-04-11 15:09:42,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-04-11 15:09:42,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 114. [2018-04-11 15:09:42,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-04-11 15:09:42,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 128 transitions. [2018-04-11 15:09:42,940 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 128 transitions. Word has length 24 [2018-04-11 15:09:42,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:42,941 INFO L459 AbstractCegarLoop]: Abstraction has 114 states and 128 transitions. [2018-04-11 15:09:42,941 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-04-11 15:09:42,941 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 128 transitions. [2018-04-11 15:09:42,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-04-11 15:09:42,941 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:42,942 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] [2018-04-11 15:09:42,942 INFO L408 AbstractCegarLoop]: === Iteration 15 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:09:42,942 INFO L82 PathProgramCache]: Analyzing trace with hash 675191908, now seen corresponding path program 1 times [2018-04-11 15:09:42,942 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:42,942 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:42,943 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:42,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:09:42,943 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:42,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:42,947 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:09:42,964 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:09:42,964 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:09:42,964 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-04-11 15:09:42,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-04-11 15:09:42,965 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-04-11 15:09:42,965 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-04-11 15:09:42,965 INFO L87 Difference]: Start difference. First operand 114 states and 128 transitions. Second operand 5 states. [2018-04-11 15:09:42,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:42,976 INFO L93 Difference]: Finished difference Result 120 states and 132 transitions. [2018-04-11 15:09:42,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-04-11 15:09:42,976 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-04-11 15:09:42,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:42,976 INFO L225 Difference]: With dead ends: 120 [2018-04-11 15:09:42,977 INFO L226 Difference]: Without dead ends: 114 [2018-04-11 15:09:42,977 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-04-11 15:09:42,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-04-11 15:09:42,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-04-11 15:09:42,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-04-11 15:09:42,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 126 transitions. [2018-04-11 15:09:42,979 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 126 transitions. Word has length 26 [2018-04-11 15:09:42,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:42,980 INFO L459 AbstractCegarLoop]: Abstraction has 114 states and 126 transitions. [2018-04-11 15:09:42,980 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-04-11 15:09:42,980 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 126 transitions. [2018-04-11 15:09:42,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-04-11 15:09:42,981 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:42,981 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] [2018-04-11 15:09:42,981 INFO L408 AbstractCegarLoop]: === Iteration 16 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:09:42,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1936618715, now seen corresponding path program 2 times [2018-04-11 15:09:42,981 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:42,981 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:42,981 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:42,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:09:42,981 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:42,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:42,989 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:09:43,000 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:09:43,000 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:09:43,000 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:09:43,001 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:09:43,036 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:09:43,036 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:09:43,040 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:09:43,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:09:43,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:43,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:43,049 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 15:09:43,061 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:43,062 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:43,063 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:09:43,063 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:43,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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:09:43,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:43,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:43,073 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-11 15:09:43,086 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:09:43,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-04-11 15:09:43,088 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:43,090 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:43,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:43,093 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-04-11 15:09:43,138 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:09:43,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:09:43,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:43,144 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:43,148 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:09:43,148 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:15 [2018-04-11 15:09:43,184 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:09:43,188 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:09:43,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:09:43,190 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:09:43,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:09:43,194 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:30 [2018-04-11 15:09:43,232 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:09:43,233 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:09:43,233 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-11 15:09:43,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 15:09:43,233 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 15:09:43,233 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-04-11 15:09:43,233 INFO L87 Difference]: Start difference. First operand 114 states and 126 transitions. Second operand 16 states. [2018-04-11 15:09:43,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:43,513 INFO L93 Difference]: Finished difference Result 133 states and 149 transitions. [2018-04-11 15:09:43,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-11 15:09:43,513 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2018-04-11 15:09:43,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:43,514 INFO L225 Difference]: With dead ends: 133 [2018-04-11 15:09:43,514 INFO L226 Difference]: Without dead ends: 133 [2018-04-11 15:09:43,515 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2018-04-11 15:09:43,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-04-11 15:09:43,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 118. [2018-04-11 15:09:43,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-11 15:09:43,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 132 transitions. [2018-04-11 15:09:43,518 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 132 transitions. Word has length 28 [2018-04-11 15:09:43,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:43,519 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 132 transitions. [2018-04-11 15:09:43,519 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 15:09:43,519 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 132 transitions. [2018-04-11 15:09:43,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 15:09:43,519 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:43,520 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:09:43,520 INFO L408 AbstractCegarLoop]: === Iteration 17 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:09:43,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1902193704, now seen corresponding path program 1 times [2018-04-11 15:09:43,520 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:43,520 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:43,520 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:43,521 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:09:43,521 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:43,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:43,528 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:09:43,535 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:09:43,535 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:09:43,535 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:09:43,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:09:43,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:43,559 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:09:43,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:09:43,574 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:43,580 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:09:43,580 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:43,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:43,585 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:09:43,602 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:43,603 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:43,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:09:43,603 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:43,617 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:09:43,617 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:43,623 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:09:43,624 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:09:43,734 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:09:43,734 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:09:43,734 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-11 15:09:43,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 15:09:43,735 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 15:09:43,735 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-04-11 15:09:43,735 INFO L87 Difference]: Start difference. First operand 118 states and 132 transitions. Second operand 15 states. [2018-04-11 15:09:44,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:44,063 INFO L93 Difference]: Finished difference Result 148 states and 165 transitions. [2018-04-11 15:09:44,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 15:09:44,064 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2018-04-11 15:09:44,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:44,064 INFO L225 Difference]: With dead ends: 148 [2018-04-11 15:09:44,064 INFO L226 Difference]: Without dead ends: 148 [2018-04-11 15:09:44,064 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702 [2018-04-11 15:09:44,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-04-11 15:09:44,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 128. [2018-04-11 15:09:44,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-04-11 15:09:44,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 144 transitions. [2018-04-11 15:09:44,067 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 144 transitions. Word has length 29 [2018-04-11 15:09:44,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:44,067 INFO L459 AbstractCegarLoop]: Abstraction has 128 states and 144 transitions. [2018-04-11 15:09:44,067 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 15:09:44,067 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 144 transitions. [2018-04-11 15:09:44,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 15:09:44,067 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:44,067 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:09:44,067 INFO L408 AbstractCegarLoop]: === Iteration 18 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:09:44,068 INFO L82 PathProgramCache]: Analyzing trace with hash -112251391, now seen corresponding path program 1 times [2018-04-11 15:09:44,068 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:44,068 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:44,068 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:44,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:09:44,068 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:44,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:44,081 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:09:44,089 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:09:44,089 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:09:44,089 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:09:44,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:09:44,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:44,107 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:09:44,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:09:44,113 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:44,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:09:44,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:44,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:44,120 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:09:44,133 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:44,134 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:09:44,134 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:44,141 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:44,142 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:44,142 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:09:44,142 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:44,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:44,147 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:09:44,224 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:09:44,225 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:09:44,225 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-11 15:09:44,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 15:09:44,225 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 15:09:44,225 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-04-11 15:09:44,225 INFO L87 Difference]: Start difference. First operand 128 states and 144 transitions. Second operand 13 states. [2018-04-11 15:09:44,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:44,463 INFO L93 Difference]: Finished difference Result 151 states and 170 transitions. [2018-04-11 15:09:44,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 15:09:44,496 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 29 [2018-04-11 15:09:44,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:44,496 INFO L225 Difference]: With dead ends: 151 [2018-04-11 15:09:44,496 INFO L226 Difference]: Without dead ends: 151 [2018-04-11 15:09:44,497 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2018-04-11 15:09:44,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-04-11 15:09:44,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 128. [2018-04-11 15:09:44,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-04-11 15:09:44,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 144 transitions. [2018-04-11 15:09:44,499 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 144 transitions. Word has length 29 [2018-04-11 15:09:44,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:44,499 INFO L459 AbstractCegarLoop]: Abstraction has 128 states and 144 transitions. [2018-04-11 15:09:44,499 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 15:09:44,499 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 144 transitions. [2018-04-11 15:09:44,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-04-11 15:09:44,499 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:44,499 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:09:44,499 INFO L408 AbstractCegarLoop]: === Iteration 19 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:09:44,500 INFO L82 PathProgramCache]: Analyzing trace with hash -94362021, now seen corresponding path program 2 times [2018-04-11 15:09:44,500 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:44,500 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:44,500 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:44,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:09:44,500 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:44,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:44,505 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:09:44,508 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:09:44,508 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:09:44,508 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:09:44,508 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:09:44,522 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:09:44,523 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:09:44,525 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:09:44,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:09:44,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:44,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:09:44,536 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:44,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:44,539 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:09:44,560 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:44,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:09:44,562 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:44,569 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:44,570 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:44,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:09:44,570 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:44,574 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:09:44,575 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:09:44,665 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:09:44,665 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:09:44,665 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-04-11 15:09:44,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-04-11 15:09:44,666 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-04-11 15:09:44,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-04-11 15:09:44,666 INFO L87 Difference]: Start difference. First operand 128 states and 144 transitions. Second operand 11 states. [2018-04-11 15:09:44,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:44,862 INFO L93 Difference]: Finished difference Result 152 states and 172 transitions. [2018-04-11 15:09:44,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-04-11 15:09:44,863 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-04-11 15:09:44,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:44,863 INFO L225 Difference]: With dead ends: 152 [2018-04-11 15:09:44,863 INFO L226 Difference]: Without dead ends: 152 [2018-04-11 15:09:44,864 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2018-04-11 15:09:44,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-04-11 15:09:44,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 129. [2018-04-11 15:09:44,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-11 15:09:44,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 145 transitions. [2018-04-11 15:09:44,867 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 145 transitions. Word has length 29 [2018-04-11 15:09:44,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:44,868 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 145 transitions. [2018-04-11 15:09:44,868 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-04-11 15:09:44,868 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 145 transitions. [2018-04-11 15:09:44,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-04-11 15:09:44,868 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:44,868 INFO L355 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:09:44,868 INFO L408 AbstractCegarLoop]: === Iteration 20 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:09:44,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1749994402, now seen corresponding path program 1 times [2018-04-11 15:09:44,869 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:44,869 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:44,869 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:44,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:09:44,870 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:44,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:44,875 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:09:44,877 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:09:44,877 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:09:44,877 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:09:44,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:09:44,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:44,901 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:09:44,943 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:44,944 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:09:44,946 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:09:44,946 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:44,950 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:44,954 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:09:44,954 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:15 [2018-04-11 15:09:44,977 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (select .cse0 |c_main_#t~malloc11.base|) 0) (= |c_#valid| (store (store .cse0 |c_main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0))))) is different from true [2018-04-11 15:09:44,986 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|main_#t~malloc11.base| Int) (|main_#t~malloc10.base| Int)) (let ((.cse0 (store |c_old(#valid)| |main_#t~malloc10.base| 1))) (and (= 0 (select |c_old(#valid)| |main_#t~malloc10.base|)) (= (store (store (store .cse0 |main_#t~malloc11.base| 1) |main_#t~malloc10.base| 0) |main_#t~malloc11.base| 0) |c_#valid|) (= (select .cse0 |main_#t~malloc11.base|) 0)))) is different from true [2018-04-11 15:09:44,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-11 15:09:44,991 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-04-11 15:09:44,991 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-04-11 15:09:44,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-04-11 15:09:44,992 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-04-11 15:09:44,992 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=22, Unknown=2, NotChecked=18, Total=56 [2018-04-11 15:09:44,992 INFO L87 Difference]: Start difference. First operand 129 states and 145 transitions. Second operand 8 states. [2018-04-11 15:09:45,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:45,054 INFO L93 Difference]: Finished difference Result 128 states and 144 transitions. [2018-04-11 15:09:45,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-04-11 15:09:45,055 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-04-11 15:09:45,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:45,055 INFO L225 Difference]: With dead ends: 128 [2018-04-11 15:09:45,055 INFO L226 Difference]: Without dead ends: 78 [2018-04-11 15:09:45,055 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=30, Unknown=2, NotChecked=22, Total=72 [2018-04-11 15:09:45,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-04-11 15:09:45,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 64. [2018-04-11 15:09:45,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-04-11 15:09:45,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2018-04-11 15:09:45,057 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 31 [2018-04-11 15:09:45,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:45,057 INFO L459 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2018-04-11 15:09:45,057 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-04-11 15:09:45,057 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-04-11 15:09:45,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-04-11 15:09:45,058 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:45,058 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] [2018-04-11 15:09:45,058 INFO L408 AbstractCegarLoop]: === Iteration 21 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:09:45,058 INFO L82 PathProgramCache]: Analyzing trace with hash -422117991, now seen corresponding path program 3 times [2018-04-11 15:09:45,058 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:45,058 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:45,059 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:45,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:09:45,059 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:45,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:45,068 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:09:45,083 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:09:45,083 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:09:45,084 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:09:45,084 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:09:45,116 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-11 15:09:45,117 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:09:45,120 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:09:45,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:09:45,125 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:45,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:45,127 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-04-11 15:09:45,139 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:09:45,140 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:45,146 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:45,147 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:45,148 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:09:45,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:45,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:45,152 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-04-11 15:09:45,170 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:09:45,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 12 treesize of output 11 [2018-04-11 15:09:45,173 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:45,174 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:45,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:45,178 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-04-11 15:09:45,224 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:09:45,226 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select 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:09:45,226 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:45,230 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:45,234 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:09:45,234 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2018-04-11 15:09:45,258 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:09:45,261 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-04-11 15:09:45,261 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:45,265 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:45,269 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:09:45,269 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:11 [2018-04-11 15:09:45,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-04-11 15:09:45,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2018-04-11 15:09:45,299 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-04-11 15:09:45,301 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:09:45,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:09:45,306 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:32 [2018-04-11 15:09:45,348 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-04-11 15:09:45,348 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:09:45,348 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-11 15:09:45,348 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 15:09:45,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 15:09:45,349 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-04-11 15:09:45,349 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 16 states. [2018-04-11 15:09:45,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:45,703 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2018-04-11 15:09:45,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 15:09:45,704 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 33 [2018-04-11 15:09:45,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:45,704 INFO L225 Difference]: With dead ends: 63 [2018-04-11 15:09:45,704 INFO L226 Difference]: Without dead ends: 63 [2018-04-11 15:09:45,704 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2018-04-11 15:09:45,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-04-11 15:09:45,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-04-11 15:09:45,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-04-11 15:09:45,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2018-04-11 15:09:45,706 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 33 [2018-04-11 15:09:45,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:45,706 INFO L459 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-04-11 15:09:45,706 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 15:09:45,706 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-04-11 15:09:45,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-11 15:09:45,707 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:45,707 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:09:45,707 INFO L408 AbstractCegarLoop]: === Iteration 22 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:09:45,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1686720539, now seen corresponding path program 2 times [2018-04-11 15:09:45,707 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:45,707 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:45,708 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:45,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:09:45,708 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:45,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:45,715 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:09:45,731 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:09:45,731 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:09:45,731 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:09:45,732 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:09:45,750 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:09:45,750 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:09:45,753 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:09:45,763 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:09:45,763 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:45,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:09:45,770 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:45,775 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:45,775 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:09:45,795 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:45,797 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:09:45,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:45,807 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:45,807 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:45,807 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:09:45,808 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:45,812 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:09:45,812 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:09:45,965 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:09:45,965 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:09:45,965 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 15:09:45,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 15:09:45,965 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 15:09:45,966 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-04-11 15:09:45,966 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 17 states. [2018-04-11 15:09:46,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:46,318 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2018-04-11 15:09:46,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 15:09:46,318 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 34 [2018-04-11 15:09:46,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:46,319 INFO L225 Difference]: With dead ends: 79 [2018-04-11 15:09:46,319 INFO L226 Difference]: Without dead ends: 79 [2018-04-11 15:09:46,319 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=706, Unknown=0, NotChecked=0, Total=812 [2018-04-11 15:09:46,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-04-11 15:09:46,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 68. [2018-04-11 15:09:46,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-04-11 15:09:46,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-04-11 15:09:46,320 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 34 [2018-04-11 15:09:46,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:46,320 INFO L459 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-04-11 15:09:46,320 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 15:09:46,320 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-04-11 15:09:46,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-11 15:09:46,320 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:46,321 INFO L355 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:09:46,321 INFO L408 AbstractCegarLoop]: === Iteration 23 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:09:46,321 INFO L82 PathProgramCache]: Analyzing trace with hash -9638484, now seen corresponding path program 1 times [2018-04-11 15:09:46,321 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:46,321 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:46,321 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:46,321 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:09:46,321 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:46,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:46,326 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:09:46,338 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:09:46,338 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:09:46,338 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:09:46,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:09:46,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:46,362 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:09:46,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:09:46,372 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:46,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:09:46,378 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:46,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:46,382 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:09:46,396 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:46,398 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:09:46,398 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:46,408 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:46,409 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:46,410 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:09:46,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:46,415 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:09:46,415 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:09:46,546 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:09:46,546 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:09:46,546 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-11 15:09:46,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 15:09:46,547 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 15:09:46,547 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-04-11 15:09:46,547 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 16 states. [2018-04-11 15:09:46,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:46,866 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2018-04-11 15:09:46,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 15:09:46,866 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 34 [2018-04-11 15:09:46,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:46,866 INFO L225 Difference]: With dead ends: 90 [2018-04-11 15:09:46,866 INFO L226 Difference]: Without dead ends: 90 [2018-04-11 15:09:46,867 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=709, Unknown=0, NotChecked=0, Total=812 [2018-04-11 15:09:46,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-04-11 15:09:46,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 68. [2018-04-11 15:09:46,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-04-11 15:09:46,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-04-11 15:09:46,868 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 34 [2018-04-11 15:09:46,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:46,868 INFO L459 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-04-11 15:09:46,868 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 15:09:46,868 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-04-11 15:09:46,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-11 15:09:46,868 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:46,869 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:09:46,869 INFO L408 AbstractCegarLoop]: === Iteration 24 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:09:46,869 INFO L82 PathProgramCache]: Analyzing trace with hash -218645245, now seen corresponding path program 2 times [2018-04-11 15:09:46,869 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:46,869 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:46,869 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:46,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:09:46,869 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:46,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:46,877 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:09:46,892 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:09:46,892 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:09:46,892 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:09:46,893 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:09:46,914 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:09:46,914 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:09:46,918 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:09:46,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:09:46,928 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:46,942 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:09:46,942 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:46,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:46,946 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:09:46,960 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:46,961 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:46,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, 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:09:46,962 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:46,969 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:09:46,970 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:46,990 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:09:46,990 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:09:47,106 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:09:47,106 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:09:47,106 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-11 15:09:47,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 15:09:47,107 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 15:09:47,107 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-04-11 15:09:47,107 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 14 states. [2018-04-11 15:09:47,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:47,355 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2018-04-11 15:09:47,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 15:09:47,355 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2018-04-11 15:09:47,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:47,356 INFO L225 Difference]: With dead ends: 103 [2018-04-11 15:09:47,356 INFO L226 Difference]: Without dead ends: 103 [2018-04-11 15:09:47,356 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2018-04-11 15:09:47,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-04-11 15:09:47,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 69. [2018-04-11 15:09:47,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-04-11 15:09:47,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2018-04-11 15:09:47,358 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 34 [2018-04-11 15:09:47,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:47,358 INFO L459 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2018-04-11 15:09:47,358 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 15:09:47,358 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2018-04-11 15:09:47,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-04-11 15:09:47,359 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:47,359 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:09:47,359 INFO L408 AbstractCegarLoop]: === Iteration 25 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:09:47,359 INFO L82 PathProgramCache]: Analyzing trace with hash -200755875, now seen corresponding path program 3 times [2018-04-11 15:09:47,359 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:47,359 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:47,360 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:47,360 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:09:47,360 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:47,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:47,367 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:09:47,374 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:09:47,374 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:09:47,374 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:09:47,375 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:09:47,404 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-11 15:09:47,404 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:09:47,409 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:09:47,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:09:47,414 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:47,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:47,417 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-04-11 15:09:47,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:09:47,436 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:09:47,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-04-11 15:09:47,447 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:23 [2018-04-11 15:09:47,611 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:09:47,611 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:09:47,611 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-04-11 15:09:47,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-04-11 15:09:47,612 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-04-11 15:09:47,612 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-04-11 15:09:47,612 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand 14 states. [2018-04-11 15:09:47,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:47,987 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2018-04-11 15:09:47,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-04-11 15:09:47,988 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2018-04-11 15:09:47,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:47,989 INFO L225 Difference]: With dead ends: 105 [2018-04-11 15:09:47,989 INFO L226 Difference]: Without dead ends: 105 [2018-04-11 15:09:47,989 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2018-04-11 15:09:47,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-04-11 15:09:47,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 73. [2018-04-11 15:09:47,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-04-11 15:09:47,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2018-04-11 15:09:47,991 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 34 [2018-04-11 15:09:47,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:47,991 INFO L459 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2018-04-11 15:09:47,991 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-04-11 15:09:47,991 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2018-04-11 15:09:47,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-11 15:09:47,992 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:47,992 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:09:47,992 INFO L408 AbstractCegarLoop]: === Iteration 26 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:09:47,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1138686536, now seen corresponding path program 3 times [2018-04-11 15:09:47,992 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:47,992 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:47,993 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:47,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:09:47,993 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:48,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:48,001 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:09:48,024 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:09:48,024 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:09:48,024 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:09:48,025 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:09:48,046 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-11 15:09:48,046 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:09:48,049 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:09:48,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:09:48,064 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:48,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:09:48,070 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:48,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:48,073 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:09:48,083 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:48,085 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:09:48,085 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:48,101 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:48,102 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:48,102 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:09:48,103 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:48,106 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:09:48,107 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:09:48,328 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:09:48,329 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:09:48,329 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-11 15:09:48,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 15:09:48,329 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 15:09:48,329 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-04-11 15:09:48,329 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand 19 states. [2018-04-11 15:09:48,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:48,870 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2018-04-11 15:09:48,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 15:09:48,870 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 39 [2018-04-11 15:09:48,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:48,870 INFO L225 Difference]: With dead ends: 94 [2018-04-11 15:09:48,871 INFO L226 Difference]: Without dead ends: 94 [2018-04-11 15:09:48,871 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=133, Invalid=1057, Unknown=0, NotChecked=0, Total=1190 [2018-04-11 15:09:48,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-04-11 15:09:48,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 78. [2018-04-11 15:09:48,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-04-11 15:09:48,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2018-04-11 15:09:48,873 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 39 [2018-04-11 15:09:48,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:48,873 INFO L459 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2018-04-11 15:09:48,873 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 15:09:48,873 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2018-04-11 15:09:48,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-11 15:09:48,874 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:48,874 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:09:48,874 INFO L408 AbstractCegarLoop]: === Iteration 27 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:09:48,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1423655137, now seen corresponding path program 2 times [2018-04-11 15:09:48,874 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:48,874 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:48,875 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:48,875 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:09:48,875 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:48,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:48,883 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:09:48,896 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:09:48,896 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:09:48,897 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:09:48,897 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:09:48,922 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:09:48,922 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:09:48,926 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:09:48,932 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:09:48,932 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:48,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:09:48,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:48,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:48,940 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:09:48,950 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:48,951 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:09:48,951 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:48,957 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:48,957 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:48,957 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:09:48,958 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:48,961 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:09:48,961 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:09:49,096 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:09:49,096 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:09:49,096 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 15:09:49,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 15:09:49,097 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 15:09:49,097 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-04-11 15:09:49,097 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 17 states. [2018-04-11 15:09:49,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:49,467 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2018-04-11 15:09:49,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 15:09:49,502 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 39 [2018-04-11 15:09:49,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:49,502 INFO L225 Difference]: With dead ends: 109 [2018-04-11 15:09:49,502 INFO L226 Difference]: Without dead ends: 109 [2018-04-11 15:09:49,503 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=764, Unknown=0, NotChecked=0, Total=870 [2018-04-11 15:09:49,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-04-11 15:09:49,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 78. [2018-04-11 15:09:49,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-04-11 15:09:49,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2018-04-11 15:09:49,504 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 39 [2018-04-11 15:09:49,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:49,504 INFO L459 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2018-04-11 15:09:49,504 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 15:09:49,504 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2018-04-11 15:09:49,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-11 15:09:49,504 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:49,504 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:09:49,504 INFO L408 AbstractCegarLoop]: === Iteration 28 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:09:49,505 INFO L82 PathProgramCache]: Analyzing trace with hash -684757014, now seen corresponding path program 3 times [2018-04-11 15:09:49,505 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:49,505 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:49,505 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:49,505 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:09:49,506 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:49,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:49,513 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:09:49,517 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:09:49,517 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:09:49,517 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:09:49,518 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:09:49,532 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-04-11 15:09:49,532 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:09:49,534 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:09:49,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:09:49,536 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:49,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:09:49,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:49,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:49,543 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:09:49,553 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:49,554 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:49,554 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:09:49,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:49,560 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:09:49,560 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:49,564 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:09:49,564 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:09:49,740 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:09:49,740 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:09:49,740 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-11 15:09:49,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 15:09:49,741 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 15:09:49,741 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-04-11 15:09:49,741 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 16 states. [2018-04-11 15:09:50,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:50,235 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2018-04-11 15:09:50,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 15:09:50,235 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2018-04-11 15:09:50,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:50,236 INFO L225 Difference]: With dead ends: 120 [2018-04-11 15:09:50,236 INFO L226 Difference]: Without dead ends: 120 [2018-04-11 15:09:50,237 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=660, Unknown=0, NotChecked=0, Total=756 [2018-04-11 15:09:50,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-04-11 15:09:50,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 78. [2018-04-11 15:09:50,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-04-11 15:09:50,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2018-04-11 15:09:50,239 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 39 [2018-04-11 15:09:50,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:50,239 INFO L459 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2018-04-11 15:09:50,239 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 15:09:50,239 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2018-04-11 15:09:50,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-11 15:09:50,239 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:50,240 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:09:50,240 INFO L408 AbstractCegarLoop]: === Iteration 29 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:09:50,240 INFO L82 PathProgramCache]: Analyzing trace with hash -893763775, now seen corresponding path program 3 times [2018-04-11 15:09:50,240 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:50,240 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:50,241 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:50,241 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:09:50,241 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:50,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:50,250 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:09:50,260 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:09:50,260 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:09:50,260 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:09:50,261 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:09:50,287 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-11 15:09:50,287 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:09:50,291 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:09:50,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:09:50,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:50,311 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:09:50,312 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:50,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:50,315 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:09:50,328 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:50,330 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:09:50,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:50,352 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:50,353 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:50,353 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:09:50,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:50,359 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:09:50,360 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:09:50,482 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:09:50,482 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:09:50,482 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-04-11 15:09:50,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-04-11 15:09:50,483 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-04-11 15:09:50,483 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2018-04-11 15:09:50,483 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand 15 states. [2018-04-11 15:09:50,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:50,841 INFO L93 Difference]: Finished difference Result 133 states and 139 transitions. [2018-04-11 15:09:50,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-04-11 15:09:50,841 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 39 [2018-04-11 15:09:50,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:50,842 INFO L225 Difference]: With dead ends: 133 [2018-04-11 15:09:50,842 INFO L226 Difference]: Without dead ends: 133 [2018-04-11 15:09:50,843 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2018-04-11 15:09:50,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-04-11 15:09:50,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 79. [2018-04-11 15:09:50,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-04-11 15:09:50,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2018-04-11 15:09:50,845 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 39 [2018-04-11 15:09:50,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:50,845 INFO L459 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2018-04-11 15:09:50,845 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-04-11 15:09:50,845 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2018-04-11 15:09:50,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-04-11 15:09:50,845 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:50,846 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:09:50,846 INFO L408 AbstractCegarLoop]: === Iteration 30 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:09:50,846 INFO L82 PathProgramCache]: Analyzing trace with hash -875874405, now seen corresponding path program 4 times [2018-04-11 15:09:50,846 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:50,846 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:50,847 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:50,847 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:09:50,847 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:50,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:50,855 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:09:50,867 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:09:50,867 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:09:50,867 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:09:50,868 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:09:50,894 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:09:50,894 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:09:50,897 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:09:50,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:09:50,904 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:50,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:09:50,910 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:50,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:50,914 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:09:50,929 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:50,930 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:09:50,930 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:50,940 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:50,940 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:50,941 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:09:50,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:50,946 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:09:50,946 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:09:51,048 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:09:51,048 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:09:51,049 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-04-11 15:09:51,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-04-11 15:09:51,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-04-11 15:09:51,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-04-11 15:09:51,049 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 13 states. [2018-04-11 15:09:51,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:51,245 INFO L93 Difference]: Finished difference Result 135 states and 142 transitions. [2018-04-11 15:09:51,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-04-11 15:09:51,246 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39 [2018-04-11 15:09:51,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:51,246 INFO L225 Difference]: With dead ends: 135 [2018-04-11 15:09:51,246 INFO L226 Difference]: Without dead ends: 135 [2018-04-11 15:09:51,246 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2018-04-11 15:09:51,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-04-11 15:09:51,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 83. [2018-04-11 15:09:51,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-04-11 15:09:51,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2018-04-11 15:09:51,248 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 39 [2018-04-11 15:09:51,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:51,248 INFO L459 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2018-04-11 15:09:51,248 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-04-11 15:09:51,248 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2018-04-11 15:09:51,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-11 15:09:51,249 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:51,249 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:09:51,249 INFO L408 AbstractCegarLoop]: === Iteration 31 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:09:51,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1945848379, now seen corresponding path program 4 times [2018-04-11 15:09:51,249 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:51,249 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:51,250 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:51,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:09:51,250 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:51,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:51,258 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:09:51,269 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:09:51,269 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:09:51,269 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:09:51,269 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:09:51,287 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:09:51,288 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:09:51,291 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:09:51,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:09:51,307 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:51,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:51,310 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-11 15:09:51,338 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:09:51,339 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:09:51,348 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 2 xjuncts. [2018-04-11 15:09:51,348 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:36 [2018-04-11 15:09:51,847 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:09:51,848 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:09:51,848 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-11 15:09:51,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-11 15:09:51,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-11 15:09:51,848 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=596, Unknown=0, NotChecked=0, Total=650 [2018-04-11 15:09:51,848 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand 26 states. [2018-04-11 15:09:53,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:53,590 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2018-04-11 15:09:53,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 15:09:53,590 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 44 [2018-04-11 15:09:53,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:53,591 INFO L225 Difference]: With dead ends: 114 [2018-04-11 15:09:53,591 INFO L226 Difference]: Without dead ends: 114 [2018-04-11 15:09:53,591 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=194, Invalid=2158, Unknown=0, NotChecked=0, Total=2352 [2018-04-11 15:09:53,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-04-11 15:09:53,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 88. [2018-04-11 15:09:53,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-04-11 15:09:53,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2018-04-11 15:09:53,594 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 44 [2018-04-11 15:09:53,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:53,594 INFO L459 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2018-04-11 15:09:53,594 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-11 15:09:53,594 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2018-04-11 15:09:53,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-11 15:09:53,594 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:53,609 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:09:53,609 INFO L408 AbstractCegarLoop]: === Iteration 32 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:09:53,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1319759619, now seen corresponding path program 1 times [2018-04-11 15:09:53,610 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:53,610 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:53,611 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:53,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:09:53,611 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:53,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:53,618 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:09:53,643 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:09:53,643 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:09:53,643 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:09:53,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:09:53,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:53,672 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:09:53,684 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:09:53,684 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:53,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 6 treesize of output 5 [2018-04-11 15:09:53,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:53,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:53,694 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:09:53,709 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:53,710 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:09:53,710 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:53,720 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:53,721 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:53,721 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:09:53,722 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:53,727 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:09:53,727 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:09:53,937 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:09:53,937 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:09:53,937 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-11 15:09:53,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 15:09:53,938 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 15:09:53,938 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2018-04-11 15:09:53,938 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand 21 states. [2018-04-11 15:09:54,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:54,426 INFO L93 Difference]: Finished difference Result 133 states and 139 transitions. [2018-04-11 15:09:54,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 15:09:54,426 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 44 [2018-04-11 15:09:54,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:54,426 INFO L225 Difference]: With dead ends: 133 [2018-04-11 15:09:54,427 INFO L226 Difference]: Without dead ends: 133 [2018-04-11 15:09:54,427 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=143, Invalid=1263, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 15:09:54,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-04-11 15:09:54,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 88. [2018-04-11 15:09:54,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-04-11 15:09:54,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2018-04-11 15:09:54,428 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 44 [2018-04-11 15:09:54,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:54,428 INFO L459 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2018-04-11 15:09:54,428 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 15:09:54,429 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2018-04-11 15:09:54,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-11 15:09:54,429 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:54,429 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:09:54,429 INFO L408 AbstractCegarLoop]: === Iteration 33 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:09:54,429 INFO L82 PathProgramCache]: Analyzing trace with hash 819570380, now seen corresponding path program 4 times [2018-04-11 15:09:54,429 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:54,429 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:54,430 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:54,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:09:54,430 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:54,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:54,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:09:54,452 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:09:54,452 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:09:54,452 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:09:54,452 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:09:54,463 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:09:54,463 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:09:54,465 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:09:54,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:09:54,468 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:54,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:09:54,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:54,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:54,508 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:09:54,518 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:54,519 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:09:54,520 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:54,527 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:54,527 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:54,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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:09:54,528 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:54,533 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:09:54,533 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:09:54,830 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:09:54,830 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:09:54,830 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-11 15:09:54,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 15:09:54,830 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 15:09:54,831 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-04-11 15:09:54,831 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand 19 states. [2018-04-11 15:09:55,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:55,365 INFO L93 Difference]: Finished difference Result 129 states and 135 transitions. [2018-04-11 15:09:55,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-11 15:09:55,365 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 44 [2018-04-11 15:09:55,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:55,366 INFO L225 Difference]: With dead ends: 129 [2018-04-11 15:09:55,366 INFO L226 Difference]: Without dead ends: 129 [2018-04-11 15:09:55,366 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=1000, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 15:09:55,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-04-11 15:09:55,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 88. [2018-04-11 15:09:55,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-04-11 15:09:55,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2018-04-11 15:09:55,368 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 44 [2018-04-11 15:09:55,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:55,368 INFO L459 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2018-04-11 15:09:55,368 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 15:09:55,368 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2018-04-11 15:09:55,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-11 15:09:55,368 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:55,368 INFO L355 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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:09:55,368 INFO L408 AbstractCegarLoop]: === Iteration 34 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:09:55,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1176925539, now seen corresponding path program 5 times [2018-04-11 15:09:55,369 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:55,369 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:55,369 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:55,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:09:55,369 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:55,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:55,374 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:09:55,386 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:09:55,386 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:09:55,387 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:09:55,387 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:09:55,414 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-04-11 15:09:55,414 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:09:55,417 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:09:55,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:09:55,423 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:55,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:09:55,427 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:55,430 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:55,430 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:09:55,460 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:55,461 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:55,462 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:09:55,462 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:55,471 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:09:55,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:55,477 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:09:55,478 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:09:55,671 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:09:55,671 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:09:55,671 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-11 15:09:55,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 15:09:55,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 15:09:55,672 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=380, Unknown=0, NotChecked=0, Total=420 [2018-04-11 15:09:55,672 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand 21 states. [2018-04-11 15:09:56,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:56,228 INFO L93 Difference]: Finished difference Result 144 states and 150 transitions. [2018-04-11 15:09:56,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 15:09:56,228 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 44 [2018-04-11 15:09:56,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:56,229 INFO L225 Difference]: With dead ends: 144 [2018-04-11 15:09:56,229 INFO L226 Difference]: Without dead ends: 144 [2018-04-11 15:09:56,230 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=144, Invalid=1338, Unknown=0, NotChecked=0, Total=1482 [2018-04-11 15:09:56,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-04-11 15:09:56,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 88. [2018-04-11 15:09:56,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-04-11 15:09:56,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2018-04-11 15:09:56,232 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 44 [2018-04-11 15:09:56,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:56,232 INFO L459 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2018-04-11 15:09:56,232 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 15:09:56,232 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2018-04-11 15:09:56,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-11 15:09:56,233 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:56,233 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:09:56,233 INFO L408 AbstractCegarLoop]: === Iteration 35 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:09:56,233 INFO L82 PathProgramCache]: Analyzing trace with hash -931486612, now seen corresponding path program 6 times [2018-04-11 15:09:56,233 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:56,233 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:56,234 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:56,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:09:56,234 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:56,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:56,243 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:09:56,256 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:09:56,256 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:09:56,256 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:09:56,257 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:09:56,287 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-04-11 15:09:56,287 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:09:56,292 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:09:56,296 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:56,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-04-11 15:09:56,296 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:56,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:09:56,302 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:56,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:56,306 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:14 [2018-04-11 15:09:56,320 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:56,321 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:09:56,322 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:56,331 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:56,331 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:56,332 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:09:56,332 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:56,337 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:09:56,337 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:09:56,397 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 7 treesize of output 5 [2018-04-11 15:09:56,398 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:09:56,398 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:56,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:56,402 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:09:56,402 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:16 [2018-04-11 15:09:56,484 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:09:56,484 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:09:56,484 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 15:09:56,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 15:09:56,485 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 15:09:56,485 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-04-11 15:09:56,485 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand 17 states. [2018-04-11 15:09:56,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:56,854 INFO L93 Difference]: Finished difference Result 155 states and 161 transitions. [2018-04-11 15:09:56,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 15:09:56,855 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 44 [2018-04-11 15:09:56,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:56,855 INFO L225 Difference]: With dead ends: 155 [2018-04-11 15:09:56,855 INFO L226 Difference]: Without dead ends: 155 [2018-04-11 15:09:56,856 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=768, Unknown=0, NotChecked=0, Total=870 [2018-04-11 15:09:56,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-04-11 15:09:56,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 88. [2018-04-11 15:09:56,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-04-11 15:09:56,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2018-04-11 15:09:56,857 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 44 [2018-04-11 15:09:56,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:56,857 INFO L459 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2018-04-11 15:09:56,857 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 15:09:56,857 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2018-04-11 15:09:56,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-11 15:09:56,857 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:56,857 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:09:56,857 INFO L408 AbstractCegarLoop]: === Iteration 36 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:09:56,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1140493373, now seen corresponding path program 4 times [2018-04-11 15:09:56,858 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:56,858 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:56,858 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:56,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:09:56,858 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:56,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:56,864 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:09:56,878 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:09:56,878 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:09:56,878 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:09:56,878 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:09:56,894 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:09:56,894 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:09:56,896 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:09:56,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:09:56,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:56,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:09:56,911 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:56,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:56,914 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:09:56,924 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:56,925 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:09:56,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:56,953 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:56,954 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:56,954 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:09:56,954 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:56,959 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:09:56,960 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:09:57,085 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:09:57,085 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:09:57,085 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-11 15:09:57,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 15:09:57,085 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 15:09:57,086 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-04-11 15:09:57,086 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand 16 states. [2018-04-11 15:09:57,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:57,434 INFO L93 Difference]: Finished difference Result 168 states and 175 transitions. [2018-04-11 15:09:57,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 15:09:57,445 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 44 [2018-04-11 15:09:57,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:57,446 INFO L225 Difference]: With dead ends: 168 [2018-04-11 15:09:57,446 INFO L226 Difference]: Without dead ends: 168 [2018-04-11 15:09:57,446 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=668, Unknown=0, NotChecked=0, Total=756 [2018-04-11 15:09:57,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-04-11 15:09:57,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 89. [2018-04-11 15:09:57,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-04-11 15:09:57,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2018-04-11 15:09:57,448 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 44 [2018-04-11 15:09:57,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:57,448 INFO L459 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2018-04-11 15:09:57,448 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 15:09:57,448 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2018-04-11 15:09:57,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-04-11 15:09:57,449 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:57,449 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:09:57,449 INFO L408 AbstractCegarLoop]: === Iteration 37 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:09:57,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1122604003, now seen corresponding path program 5 times [2018-04-11 15:09:57,449 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:57,449 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:57,450 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:57,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:09:57,450 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:57,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:57,457 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:09:57,465 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:09:57,466 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:09:57,466 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:09:57,466 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:09:57,504 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-04-11 15:09:57,504 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:09:57,509 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:09:57,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:09:57,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:57,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:09:57,519 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:57,523 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:57,524 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:09:57,536 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:57,537 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:09:57,538 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:57,546 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:57,546 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:57,547 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:09:57,547 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:57,552 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:09:57,552 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:23 [2018-04-11 15:09:57,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, 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:09:57,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:57,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:57,627 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:15 [2018-04-11 15:09:57,705 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:09:57,705 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:09:57,705 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-11 15:09:57,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 15:09:57,706 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 15:09:57,706 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2018-04-11 15:09:57,706 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand 16 states. [2018-04-11 15:09:58,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:58,060 INFO L93 Difference]: Finished difference Result 170 states and 178 transitions. [2018-04-11 15:09:58,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 15:09:58,060 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 44 [2018-04-11 15:09:58,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:58,061 INFO L225 Difference]: With dead ends: 170 [2018-04-11 15:09:58,061 INFO L226 Difference]: Without dead ends: 170 [2018-04-11 15:09:58,061 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=665, Unknown=0, NotChecked=0, Total=756 [2018-04-11 15:09:58,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-04-11 15:09:58,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 93. [2018-04-11 15:09:58,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-04-11 15:09:58,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2018-04-11 15:09:58,063 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 44 [2018-04-11 15:09:58,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:58,063 INFO L459 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2018-04-11 15:09:58,063 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 15:09:58,063 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2018-04-11 15:09:58,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-11 15:09:58,064 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:58,064 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:09:58,064 INFO L408 AbstractCegarLoop]: === Iteration 38 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:09:58,064 INFO L82 PathProgramCache]: Analyzing trace with hash -2104909720, now seen corresponding path program 5 times [2018-04-11 15:09:58,064 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:58,064 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:58,065 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:58,065 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:09:58,065 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:58,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:58,072 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:09:58,093 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:09:58,093 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:09:58,093 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:09:58,094 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:09:58,118 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-04-11 15:09:58,118 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:09:58,122 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:09:58,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:09:58,134 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:58,140 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:09:58,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:58,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:58,144 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:09:58,158 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:58,159 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:09:58,159 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:58,170 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:58,171 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:58,172 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:09:58,172 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:58,177 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:09:58,177 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:09:58,256 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:09:58,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:58,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:58,258 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:11 [2018-04-11 15:09:58,438 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:09:58,438 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:09:58,439 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 15:09:58,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 15:09:58,439 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 15:09:58,440 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2018-04-11 15:09:58,440 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand 23 states. [2018-04-11 15:09:58,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:58,934 INFO L93 Difference]: Finished difference Result 124 states and 131 transitions. [2018-04-11 15:09:58,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 15:09:58,934 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 49 [2018-04-11 15:09:58,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:58,934 INFO L225 Difference]: With dead ends: 124 [2018-04-11 15:09:58,934 INFO L226 Difference]: Without dead ends: 124 [2018-04-11 15:09:58,935 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=1563, Unknown=0, NotChecked=0, Total=1722 [2018-04-11 15:09:58,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-04-11 15:09:58,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 98. [2018-04-11 15:09:58,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-04-11 15:09:58,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2018-04-11 15:09:58,936 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 49 [2018-04-11 15:09:58,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:58,936 INFO L459 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2018-04-11 15:09:58,936 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 15:09:58,936 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2018-04-11 15:09:58,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-11 15:09:58,937 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:58,937 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:09:58,937 INFO L408 AbstractCegarLoop]: === Iteration 39 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:09:58,937 INFO L82 PathProgramCache]: Analyzing trace with hash 236272577, now seen corresponding path program 7 times [2018-04-11 15:09:58,937 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:58,937 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:58,938 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:58,938 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:09:58,938 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:58,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:58,943 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:09:58,953 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:09:58,953 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:09:58,953 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:09:58,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:09:58,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:58,970 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:09:58,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:09:58,972 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:58,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:09:58,993 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:58,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:58,996 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:09:59,006 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:59,007 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:59,008 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:09:59,008 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:59,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:09:59,014 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:59,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:59,018 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:09:59,341 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:09:59,341 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:09:59,341 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-11 15:09:59,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 15:09:59,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 15:09:59,342 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2018-04-11 15:09:59,342 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand 22 states. [2018-04-11 15:09:59,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:09:59,920 INFO L93 Difference]: Finished difference Result 149 states and 156 transitions. [2018-04-11 15:09:59,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 15:09:59,920 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 49 [2018-04-11 15:09:59,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:09:59,920 INFO L225 Difference]: With dead ends: 149 [2018-04-11 15:09:59,920 INFO L226 Difference]: Without dead ends: 149 [2018-04-11 15:09:59,921 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=151, Invalid=1489, Unknown=0, NotChecked=0, Total=1640 [2018-04-11 15:09:59,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-04-11 15:09:59,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 98. [2018-04-11 15:09:59,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-04-11 15:09:59,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2018-04-11 15:09:59,922 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 49 [2018-04-11 15:09:59,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:09:59,922 INFO L459 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2018-04-11 15:09:59,922 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 15:09:59,923 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2018-04-11 15:09:59,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-11 15:09:59,923 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:09:59,923 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:09:59,923 INFO L408 AbstractCegarLoop]: === Iteration 40 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:09:59,923 INFO L82 PathProgramCache]: Analyzing trace with hash -263916662, now seen corresponding path program 8 times [2018-04-11 15:09:59,923 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:09:59,923 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:09:59,924 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:59,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:09:59,924 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:09:59,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:09:59,930 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:09:59,937 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:09:59,937 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:09:59,938 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:09:59,938 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:09:59,957 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:09:59,957 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:09:59,961 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:09:59,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:09:59,964 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:59,970 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:09:59,970 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:59,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:09:59,974 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:09:59,988 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:59,989 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:09:59,990 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:09:59,990 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:09:59,997 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:09:59,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:00,002 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:10:00,002 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:10:00,283 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:10:00,283 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:10:00,283 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-11 15:10:00,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 15:10:00,283 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 15:10:00,283 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2018-04-11 15:10:00,283 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand 20 states. [2018-04-11 15:10:00,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:00,914 INFO L93 Difference]: Finished difference Result 169 states and 176 transitions. [2018-04-11 15:10:00,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 15:10:00,915 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 49 [2018-04-11 15:10:00,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:00,915 INFO L225 Difference]: With dead ends: 169 [2018-04-11 15:10:00,915 INFO L226 Difference]: Without dead ends: 169 [2018-04-11 15:10:00,916 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=1132, Unknown=0, NotChecked=0, Total=1260 [2018-04-11 15:10:00,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-04-11 15:10:00,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 98. [2018-04-11 15:10:00,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-04-11 15:10:00,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2018-04-11 15:10:00,917 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 49 [2018-04-11 15:10:00,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:00,917 INFO L459 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2018-04-11 15:10:00,917 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 15:10:00,917 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2018-04-11 15:10:00,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-11 15:10:00,917 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:00,918 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:10:00,918 INFO L408 AbstractCegarLoop]: === Iteration 41 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:00,918 INFO L82 PathProgramCache]: Analyzing trace with hash 93438497, now seen corresponding path program 9 times [2018-04-11 15:10:00,918 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:00,918 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:00,918 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:00,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:10:00,918 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:00,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:00,926 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:00,953 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:10:00,953 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:00,953 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:00,954 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:10:00,988 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-04-11 15:10:00,988 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:10:00,994 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:00,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:10:00,997 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:01,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:10:01,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:01,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:01,007 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:10:01,023 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:01,024 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:10:01,024 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:01,033 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:01,034 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:01,034 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:10:01,035 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:01,039 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:10:01,040 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:10:01,093 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 7 treesize of output 5 [2018-04-11 15:10:01,094 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:10:01,094 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:01,095 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:01,098 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:10:01,098 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:16 [2018-04-11 15:10:01,219 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:01,219 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:10:01,219 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-11 15:10:01,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 15:10:01,219 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 15:10:01,219 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-04-11 15:10:01,219 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand 19 states. [2018-04-11 15:10:01,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:01,770 INFO L93 Difference]: Finished difference Result 184 states and 191 transitions. [2018-04-11 15:10:01,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-11 15:10:01,771 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-04-11 15:10:01,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:01,772 INFO L225 Difference]: With dead ends: 184 [2018-04-11 15:10:01,772 INFO L226 Difference]: Without dead ends: 184 [2018-04-11 15:10:01,772 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=1004, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 15:10:01,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-04-11 15:10:01,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 98. [2018-04-11 15:10:01,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-04-11 15:10:01,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2018-04-11 15:10:01,774 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 49 [2018-04-11 15:10:01,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:01,775 INFO L459 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2018-04-11 15:10:01,775 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 15:10:01,775 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2018-04-11 15:10:01,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-11 15:10:01,775 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:01,775 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:10:01,776 INFO L408 AbstractCegarLoop]: === Iteration 42 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:01,776 INFO L82 PathProgramCache]: Analyzing trace with hash -2014973654, now seen corresponding path program 10 times [2018-04-11 15:10:01,776 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:01,776 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:01,776 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:01,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:10:01,777 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:01,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:01,786 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:01,794 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:10:01,794 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:01,794 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:01,795 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:10:01,854 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:10:01,855 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:10:01,859 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:01,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:10:01,871 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:01,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:10:01,921 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:01,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:01,924 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:10:01,935 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:01,936 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:10:01,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:02,005 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:02,006 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:02,006 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:10:02,006 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:02,132 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:10:02,132 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:10:02,449 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:02,450 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:10:02,450 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-11 15:10:02,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 15:10:02,450 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 15:10:02,450 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2018-04-11 15:10:02,450 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand 18 states. [2018-04-11 15:10:02,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:02,970 INFO L93 Difference]: Finished difference Result 195 states and 202 transitions. [2018-04-11 15:10:02,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 15:10:02,970 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 49 [2018-04-11 15:10:02,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:02,971 INFO L225 Difference]: With dead ends: 195 [2018-04-11 15:10:02,971 INFO L226 Difference]: Without dead ends: 195 [2018-04-11 15:10:02,971 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=104, Invalid=888, Unknown=0, NotChecked=0, Total=992 [2018-04-11 15:10:02,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-04-11 15:10:02,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 98. [2018-04-11 15:10:02,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-04-11 15:10:02,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2018-04-11 15:10:02,973 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 49 [2018-04-11 15:10:02,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:02,973 INFO L459 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2018-04-11 15:10:02,973 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 15:10:02,973 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2018-04-11 15:10:02,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-11 15:10:02,973 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:02,973 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:10:02,973 INFO L408 AbstractCegarLoop]: === Iteration 43 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:02,974 INFO L82 PathProgramCache]: Analyzing trace with hash 2070986881, now seen corresponding path program 5 times [2018-04-11 15:10:02,974 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:02,974 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:02,974 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:02,974 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:10:02,974 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:02,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:02,981 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:02,990 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:10:02,990 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:02,990 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:02,991 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:10:03,009 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-04-11 15:10:03,009 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:10:03,012 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:03,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:10:03,015 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:03,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:10:03,019 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:03,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:03,022 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:10:03,032 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:03,033 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:10:03,033 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:03,042 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:03,043 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:03,043 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:10:03,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:03,051 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:10:03,051 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:26 [2018-04-11 15:10:03,153 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:10:03,153 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:03,158 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:10:03,158 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:17 [2018-04-11 15:10:03,293 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:03,293 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:10:03,293 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-11 15:10:03,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 15:10:03,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 15:10:03,294 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=340, Unknown=0, NotChecked=0, Total=380 [2018-04-11 15:10:03,294 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand 20 states. [2018-04-11 15:10:04,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:04,010 INFO L93 Difference]: Finished difference Result 208 states and 216 transitions. [2018-04-11 15:10:04,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 15:10:04,010 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 49 [2018-04-11 15:10:04,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:04,010 INFO L225 Difference]: With dead ends: 208 [2018-04-11 15:10:04,010 INFO L226 Difference]: Without dead ends: 208 [2018-04-11 15:10:04,011 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=1274, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 15:10:04,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-04-11 15:10:04,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 99. [2018-04-11 15:10:04,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-04-11 15:10:04,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2018-04-11 15:10:04,012 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 49 [2018-04-11 15:10:04,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:04,012 INFO L459 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2018-04-11 15:10:04,012 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 15:10:04,012 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2018-04-11 15:10:04,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-04-11 15:10:04,013 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:04,013 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:10:04,013 INFO L408 AbstractCegarLoop]: === Iteration 44 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:04,013 INFO L82 PathProgramCache]: Analyzing trace with hash 2088876251, now seen corresponding path program 6 times [2018-04-11 15:10:04,013 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:04,013 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:04,013 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:04,013 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:10:04,013 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:04,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:04,018 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:04,032 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:10:04,032 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:04,032 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:04,032 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:10:04,058 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-04-11 15:10:04,058 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:10:04,062 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:04,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:10:04,064 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:04,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:10:04,068 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:04,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:04,079 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:10:04,089 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:04,090 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:10:04,091 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:04,128 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:04,128 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:04,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:10:04,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:04,135 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:10:04,136 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:10:04,297 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:04,297 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:10:04,298 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-11 15:10:04,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 15:10:04,298 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 15:10:04,298 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-04-11 15:10:04,298 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand 16 states. [2018-04-11 15:10:04,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:04,667 INFO L93 Difference]: Finished difference Result 210 states and 219 transitions. [2018-04-11 15:10:04,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 15:10:04,668 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 49 [2018-04-11 15:10:04,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:04,668 INFO L225 Difference]: With dead ends: 210 [2018-04-11 15:10:04,668 INFO L226 Difference]: Without dead ends: 210 [2018-04-11 15:10:04,669 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=722, Unknown=0, NotChecked=0, Total=812 [2018-04-11 15:10:04,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-04-11 15:10:04,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 103. [2018-04-11 15:10:04,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-04-11 15:10:04,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2018-04-11 15:10:04,670 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 49 [2018-04-11 15:10:04,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:04,670 INFO L459 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2018-04-11 15:10:04,670 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 15:10:04,670 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2018-04-11 15:10:04,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-11 15:10:04,670 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:04,670 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:10:04,670 INFO L408 AbstractCegarLoop]: === Iteration 45 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:04,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1655497637, now seen corresponding path program 6 times [2018-04-11 15:10:04,671 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:04,671 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:04,671 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:04,671 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:10:04,671 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:04,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:04,675 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:04,689 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:10:04,689 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:04,689 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:04,690 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:10:04,708 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-04-11 15:10:04,708 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:10:04,711 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:04,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:10:04,729 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:04,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:04,732 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-11 15:10:04,747 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:10:04,747 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:10:04,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 15:10:04,768 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:24 [2018-04-11 15:10:05,137 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:05,137 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:10:05,137 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-11 15:10:05,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 15:10:05,137 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 15:10:05,138 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=551, Unknown=0, NotChecked=0, Total=600 [2018-04-11 15:10:05,138 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 25 states. [2018-04-11 15:10:06,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:06,493 INFO L93 Difference]: Finished difference Result 144 states and 152 transitions. [2018-04-11 15:10:06,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 15:10:06,493 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 54 [2018-04-11 15:10:06,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:06,494 INFO L225 Difference]: With dead ends: 144 [2018-04-11 15:10:06,494 INFO L226 Difference]: Without dead ends: 144 [2018-04-11 15:10:06,495 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=171, Invalid=1899, Unknown=0, NotChecked=0, Total=2070 [2018-04-11 15:10:06,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-04-11 15:10:06,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 108. [2018-04-11 15:10:06,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-04-11 15:10:06,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2018-04-11 15:10:06,497 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 54 [2018-04-11 15:10:06,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:06,497 INFO L459 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2018-04-11 15:10:06,497 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 15:10:06,497 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2018-04-11 15:10:06,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-11 15:10:06,497 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:06,498 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:10:06,498 INFO L408 AbstractCegarLoop]: === Iteration 46 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:06,498 INFO L82 PathProgramCache]: Analyzing trace with hash -700307613, now seen corresponding path program 2 times [2018-04-11 15:10:06,498 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:06,498 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:06,499 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:06,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:10:06,499 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:06,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:06,506 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:06,519 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:10:06,519 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:06,519 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:06,519 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:10:06,535 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:10:06,536 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:10:06,539 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:06,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:10:06,550 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:06,556 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:10:06,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:06,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:06,562 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:10:06,599 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:06,599 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:06,600 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:10:06,600 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:06,606 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:10:06,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:06,611 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:10:06,611 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:10:06,954 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:06,955 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:10:06,955 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-11 15:10:06,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 15:10:06,955 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 15:10:06,955 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=549, Unknown=0, NotChecked=0, Total=600 [2018-04-11 15:10:06,955 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand 25 states. [2018-04-11 15:10:07,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:07,754 INFO L93 Difference]: Finished difference Result 173 states and 181 transitions. [2018-04-11 15:10:07,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 15:10:07,754 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 54 [2018-04-11 15:10:07,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:07,754 INFO L225 Difference]: With dead ends: 173 [2018-04-11 15:10:07,754 INFO L226 Difference]: Without dead ends: 173 [2018-04-11 15:10:07,755 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=170, Invalid=1810, Unknown=0, NotChecked=0, Total=1980 [2018-04-11 15:10:07,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-04-11 15:10:07,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 108. [2018-04-11 15:10:07,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-04-11 15:10:07,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2018-04-11 15:10:07,756 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 54 [2018-04-11 15:10:07,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:07,756 INFO L459 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2018-04-11 15:10:07,756 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 15:10:07,756 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2018-04-11 15:10:07,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-11 15:10:07,757 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:07,757 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:10:07,757 INFO L408 AbstractCegarLoop]: === Iteration 47 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:07,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1829337068, now seen corresponding path program 11 times [2018-04-11 15:10:07,757 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:07,757 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:07,757 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:07,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:10:07,757 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:07,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:07,762 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:07,773 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:10:07,773 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:07,773 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:07,773 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:10:07,798 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-04-11 15:10:07,799 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:10:07,802 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:07,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:10:07,812 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:07,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:10:07,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:07,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:07,819 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:10:07,828 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:07,829 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:10:07,829 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:07,836 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:07,836 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:07,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-04-11 15:10:07,837 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:07,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:10:07,842 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:23 [2018-04-11 15:10:07,968 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:10:07,968 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:07,970 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:10:07,970 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:11 [2018-04-11 15:10:08,137 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:08,137 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:10:08,137 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-11 15:10:08,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 15:10:08,137 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 15:10:08,137 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=550, Unknown=0, NotChecked=0, Total=600 [2018-04-11 15:10:08,138 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand 25 states. [2018-04-11 15:10:09,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:09,129 INFO L93 Difference]: Finished difference Result 169 states and 177 transitions. [2018-04-11 15:10:09,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 15:10:09,129 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 54 [2018-04-11 15:10:09,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:09,129 INFO L225 Difference]: With dead ends: 169 [2018-04-11 15:10:09,129 INFO L226 Difference]: Without dead ends: 169 [2018-04-11 15:10:09,130 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=179, Invalid=1983, Unknown=0, NotChecked=0, Total=2162 [2018-04-11 15:10:09,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-04-11 15:10:09,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 108. [2018-04-11 15:10:09,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-04-11 15:10:09,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2018-04-11 15:10:09,132 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 54 [2018-04-11 15:10:09,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:09,132 INFO L459 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2018-04-11 15:10:09,132 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 15:10:09,132 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2018-04-11 15:10:09,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-11 15:10:09,133 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:09,133 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:10:09,133 INFO L408 AbstractCegarLoop]: === Iteration 48 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:09,133 INFO L82 PathProgramCache]: Analyzing trace with hash 772945347, now seen corresponding path program 12 times [2018-04-11 15:10:09,133 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:09,133 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:09,134 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:09,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:10:09,134 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:09,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:09,142 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:09,162 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:10:09,162 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:09,162 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:09,162 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:10:09,187 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-04-11 15:10:09,188 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:10:09,192 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:09,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:10:09,206 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:09,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:10:09,212 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:09,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:09,215 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:10:09,232 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:09,233 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:10:09,233 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:09,239 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:09,239 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:09,240 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:10:09,240 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:09,243 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:10:09,243 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:10:09,472 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:09,472 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:10:09,472 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 15:10:09,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 15:10:09,473 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 15:10:09,473 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506 [2018-04-11 15:10:09,473 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand 23 states. [2018-04-11 15:10:10,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:10,122 INFO L93 Difference]: Finished difference Result 194 states and 202 transitions. [2018-04-11 15:10:10,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 15:10:10,122 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 54 [2018-04-11 15:10:10,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:10,123 INFO L225 Difference]: With dead ends: 194 [2018-04-11 15:10:10,123 INFO L226 Difference]: Without dead ends: 194 [2018-04-11 15:10:10,124 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=161, Invalid=1645, Unknown=0, NotChecked=0, Total=1806 [2018-04-11 15:10:10,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-04-11 15:10:10,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 108. [2018-04-11 15:10:10,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-04-11 15:10:10,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2018-04-11 15:10:10,125 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 54 [2018-04-11 15:10:10,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:10,125 INFO L459 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2018-04-11 15:10:10,125 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 15:10:10,125 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2018-04-11 15:10:10,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-11 15:10:10,126 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:10,126 INFO L355 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:10:10,126 INFO L408 AbstractCegarLoop]: === Iteration 49 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:10,126 INFO L82 PathProgramCache]: Analyzing trace with hash 272756108, now seen corresponding path program 13 times [2018-04-11 15:10:10,126 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:10,126 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:10,126 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:10,126 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:10:10,127 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:10,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:10,131 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:10,168 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:10:10,169 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:10,169 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:10,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:10:10,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:10,186 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:10,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:10:10,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:10,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:10:10,194 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:10,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:10,197 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:10:10,206 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:10,207 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:10:10,207 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:10,213 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:10,213 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:10,214 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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:10:10,214 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:10,217 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:10:10,217 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:10:10,416 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:10,416 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:10:10,416 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-11 15:10:10,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 15:10:10,416 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 15:10:10,416 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=380, Unknown=0, NotChecked=0, Total=420 [2018-04-11 15:10:10,417 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand 21 states. [2018-04-11 15:10:11,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:11,011 INFO L93 Difference]: Finished difference Result 214 states and 222 transitions. [2018-04-11 15:10:11,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 15:10:11,011 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 54 [2018-04-11 15:10:11,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:11,012 INFO L225 Difference]: With dead ends: 214 [2018-04-11 15:10:11,012 INFO L226 Difference]: Without dead ends: 214 [2018-04-11 15:10:11,013 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=1272, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 15:10:11,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-04-11 15:10:11,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 108. [2018-04-11 15:10:11,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-04-11 15:10:11,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2018-04-11 15:10:11,014 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 54 [2018-04-11 15:10:11,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:11,014 INFO L459 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2018-04-11 15:10:11,014 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 15:10:11,014 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2018-04-11 15:10:11,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-11 15:10:11,015 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:11,015 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:10:11,015 INFO L408 AbstractCegarLoop]: === Iteration 50 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:11,015 INFO L82 PathProgramCache]: Analyzing trace with hash 630111267, now seen corresponding path program 14 times [2018-04-11 15:10:11,015 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:11,015 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:11,015 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:11,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:10:11,015 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:11,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:11,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:10:11,031 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:10:11,031 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:11,031 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:11,032 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:10:11,048 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:10:11,048 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:10:11,052 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:11,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:10:11,054 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:11,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:10:11,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:11,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:11,062 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:10:11,072 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:11,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:10:11,073 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:11,081 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:11,082 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:11,082 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:10:11,083 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:11,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:11,089 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:23 [2018-04-11 15:10:11,253 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:10:11,253 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:11,259 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:10:11,259 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:19 [2018-04-11 15:10:11,437 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:11,437 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:10:11,437 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-11 15:10:11,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 15:10:11,437 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 15:10:11,438 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=418, Unknown=0, NotChecked=0, Total=462 [2018-04-11 15:10:11,438 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand 22 states. [2018-04-11 15:10:12,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:12,198 INFO L93 Difference]: Finished difference Result 229 states and 237 transitions. [2018-04-11 15:10:12,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 15:10:12,199 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 54 [2018-04-11 15:10:12,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:12,199 INFO L225 Difference]: With dead ends: 229 [2018-04-11 15:10:12,199 INFO L226 Difference]: Without dead ends: 229 [2018-04-11 15:10:12,200 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=145, Invalid=1495, Unknown=0, NotChecked=0, Total=1640 [2018-04-11 15:10:12,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-04-11 15:10:12,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 108. [2018-04-11 15:10:12,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-04-11 15:10:12,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2018-04-11 15:10:12,201 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 54 [2018-04-11 15:10:12,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:12,201 INFO L459 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2018-04-11 15:10:12,201 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 15:10:12,201 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2018-04-11 15:10:12,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-11 15:10:12,202 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:12,202 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:10:12,202 INFO L408 AbstractCegarLoop]: === Iteration 51 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:12,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1478300884, now seen corresponding path program 15 times [2018-04-11 15:10:12,202 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:12,202 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:12,202 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:12,202 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:10:12,202 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:12,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:12,208 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:12,227 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:10:12,227 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:12,227 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:12,228 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:10:12,249 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-04-11 15:10:12,249 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:10:12,253 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:12,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:10:12,255 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:12,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:10:12,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:12,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:12,266 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:10:12,276 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:12,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:10:12,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:12,284 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:12,285 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:12,285 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:10:12,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:12,289 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:10:12,289 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:10:12,460 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:12,461 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:10:12,461 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-11 15:10:12,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 15:10:12,461 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 15:10:12,461 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-04-11 15:10:12,461 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand 19 states. [2018-04-11 15:10:12,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:12,966 INFO L93 Difference]: Finished difference Result 240 states and 248 transitions. [2018-04-11 15:10:12,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-11 15:10:12,966 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 54 [2018-04-11 15:10:12,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:12,967 INFO L225 Difference]: With dead ends: 240 [2018-04-11 15:10:12,967 INFO L226 Difference]: Without dead ends: 240 [2018-04-11 15:10:12,967 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=1008, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 15:10:12,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-04-11 15:10:12,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 108. [2018-04-11 15:10:12,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-04-11 15:10:12,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2018-04-11 15:10:12,969 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 54 [2018-04-11 15:10:12,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:12,969 INFO L459 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2018-04-11 15:10:12,970 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 15:10:12,970 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2018-04-11 15:10:12,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-11 15:10:12,970 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:12,970 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:10:12,970 INFO L408 AbstractCegarLoop]: === Iteration 52 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:12,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1687307645, now seen corresponding path program 6 times [2018-04-11 15:10:12,970 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:12,970 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:12,971 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:12,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:10:12,971 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:12,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:12,977 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:13,002 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:10:13,002 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:13,002 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:13,003 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:10:13,051 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-04-11 15:10:13,051 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:10:13,057 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:13,064 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:10:13,064 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:13,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:10:13,069 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:13,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:13,073 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:10:13,085 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:13,085 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:13,086 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:10:13,086 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:13,093 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:10:13,094 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:13,100 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:10:13,100 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:10:13,391 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:13,391 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:10:13,391 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-11 15:10:13,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 15:10:13,392 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 15:10:13,392 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-04-11 15:10:13,392 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand 19 states. [2018-04-11 15:10:13,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:13,930 INFO L93 Difference]: Finished difference Result 253 states and 262 transitions. [2018-04-11 15:10:13,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 15:10:13,930 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 54 [2018-04-11 15:10:13,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:13,931 INFO L225 Difference]: With dead ends: 253 [2018-04-11 15:10:13,931 INFO L226 Difference]: Without dead ends: 253 [2018-04-11 15:10:13,931 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=1076, Unknown=0, NotChecked=0, Total=1190 [2018-04-11 15:10:13,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-04-11 15:10:13,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 109. [2018-04-11 15:10:13,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-04-11 15:10:13,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2018-04-11 15:10:13,933 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 54 [2018-04-11 15:10:13,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:13,933 INFO L459 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2018-04-11 15:10:13,933 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 15:10:13,933 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2018-04-11 15:10:13,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-04-11 15:10:13,933 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:13,933 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:10:13,933 INFO L408 AbstractCegarLoop]: === Iteration 53 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:13,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1669418275, now seen corresponding path program 7 times [2018-04-11 15:10:13,934 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:13,934 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:13,934 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:13,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:10:13,934 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:13,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:13,940 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:13,951 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:10:13,951 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:13,951 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:13,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:10:13,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:13,974 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:13,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:10:13,976 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:13,988 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:10:13,989 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:13,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:13,993 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:10:14,003 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:14,003 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:14,003 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:10:14,004 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:14,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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:10:14,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:14,013 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:10:14,013 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:10:14,168 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:14,168 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:10:14,168 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-04-11 15:10:14,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-04-11 15:10:14,168 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-04-11 15:10:14,169 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-04-11 15:10:14,169 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand 16 states. [2018-04-11 15:10:14,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:14,570 INFO L93 Difference]: Finished difference Result 255 states and 265 transitions. [2018-04-11 15:10:14,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-04-11 15:10:14,571 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 54 [2018-04-11 15:10:14,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:14,571 INFO L225 Difference]: With dead ends: 255 [2018-04-11 15:10:14,571 INFO L226 Difference]: Without dead ends: 255 [2018-04-11 15:10:14,571 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=674, Unknown=0, NotChecked=0, Total=756 [2018-04-11 15:10:14,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-04-11 15:10:14,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 113. [2018-04-11 15:10:14,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-04-11 15:10:14,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2018-04-11 15:10:14,573 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 54 [2018-04-11 15:10:14,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:14,573 INFO L459 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2018-04-11 15:10:14,573 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-04-11 15:10:14,573 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2018-04-11 15:10:14,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-11 15:10:14,573 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:14,574 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:10:14,574 INFO L408 AbstractCegarLoop]: === Iteration 54 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:14,574 INFO L82 PathProgramCache]: Analyzing trace with hash -583852408, now seen corresponding path program 7 times [2018-04-11 15:10:14,574 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:14,574 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:14,574 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:14,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:10:14,574 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:14,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:14,579 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:14,584 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:10:14,584 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:14,584 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:14,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:10:14,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:14,599 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:14,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:10:14,602 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:14,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:14,606 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-11 15:10:14,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:10:14,621 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:10:14,630 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 2 xjuncts. [2018-04-11 15:10:14,630 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:36 [2018-04-11 15:10:15,200 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:15,200 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:10:15,234 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-04-11 15:10:15,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-11 15:10:15,235 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-11 15:10:15,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=867, Unknown=0, NotChecked=0, Total=930 [2018-04-11 15:10:15,235 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand 31 states. [2018-04-11 15:10:17,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:17,322 INFO L93 Difference]: Finished difference Result 159 states and 168 transitions. [2018-04-11 15:10:17,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-11 15:10:17,322 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 59 [2018-04-11 15:10:17,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:17,323 INFO L225 Difference]: With dead ends: 159 [2018-04-11 15:10:17,323 INFO L226 Difference]: Without dead ends: 159 [2018-04-11 15:10:17,323 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 572 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=231, Invalid=3191, Unknown=0, NotChecked=0, Total=3422 [2018-04-11 15:10:17,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-04-11 15:10:17,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 118. [2018-04-11 15:10:17,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-11 15:10:17,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2018-04-11 15:10:17,324 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 127 transitions. Word has length 59 [2018-04-11 15:10:17,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:17,324 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 127 transitions. [2018-04-11 15:10:17,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-11 15:10:17,324 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 127 transitions. [2018-04-11 15:10:17,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-11 15:10:17,325 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:17,325 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:10:17,325 INFO L408 AbstractCegarLoop]: === Iteration 55 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:17,325 INFO L82 PathProgramCache]: Analyzing trace with hash -139951734, now seen corresponding path program 3 times [2018-04-11 15:10:17,325 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:17,325 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:17,326 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:17,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:10:17,326 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:17,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:17,334 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:17,367 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:10:17,367 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:17,367 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:17,368 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:10:17,384 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-04-11 15:10:17,384 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:10:17,388 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:17,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:10:17,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:17,407 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:10:17,407 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:17,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:17,413 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:10:17,421 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:17,422 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:10:17,422 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:17,427 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:17,428 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:17,428 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:10:17,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:17,431 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:10:17,431 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:10:17,662 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:17,662 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:10:17,662 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-11 15:10:17,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-11 15:10:17,663 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-11 15:10:17,663 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2018-04-11 15:10:17,663 INFO L87 Difference]: Start difference. First operand 118 states and 127 transitions. Second operand 26 states. [2018-04-11 15:10:18,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:18,281 INFO L93 Difference]: Finished difference Result 193 states and 202 transitions. [2018-04-11 15:10:18,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 15:10:18,281 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 59 [2018-04-11 15:10:18,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:18,281 INFO L225 Difference]: With dead ends: 193 [2018-04-11 15:10:18,281 INFO L226 Difference]: Without dead ends: 193 [2018-04-11 15:10:18,282 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=180, Invalid=2076, Unknown=0, NotChecked=0, Total=2256 [2018-04-11 15:10:18,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-04-11 15:10:18,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 118. [2018-04-11 15:10:18,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-11 15:10:18,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2018-04-11 15:10:18,283 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 127 transitions. Word has length 59 [2018-04-11 15:10:18,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:18,284 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 127 transitions. [2018-04-11 15:10:18,284 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-11 15:10:18,284 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 127 transitions. [2018-04-11 15:10:18,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-11 15:10:18,284 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:18,284 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:10:18,284 INFO L408 AbstractCegarLoop]: === Iteration 56 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:18,284 INFO L82 PathProgramCache]: Analyzing trace with hash -222617951, now seen corresponding path program 16 times [2018-04-11 15:10:18,284 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:18,284 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:18,285 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:18,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:10:18,285 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:18,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:18,290 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:18,295 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:10:18,295 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:18,295 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:18,296 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:10:18,306 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:10:18,306 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:10:18,308 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:18,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:10:18,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:18,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:10:18,314 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:18,316 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:18,316 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:10:18,326 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:18,327 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:10:18,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:18,342 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:18,343 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:18,343 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:10:18,343 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:18,348 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:10:18,349 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:10:18,667 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:18,667 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:10:18,667 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-11 15:10:18,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-11 15:10:18,667 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-11 15:10:18,667 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=649, Unknown=0, NotChecked=0, Total=702 [2018-04-11 15:10:18,668 INFO L87 Difference]: Start difference. First operand 118 states and 127 transitions. Second operand 27 states. [2018-04-11 15:10:19,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:19,454 INFO L93 Difference]: Finished difference Result 189 states and 198 transitions. [2018-04-11 15:10:19,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-11 15:10:19,454 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 59 [2018-04-11 15:10:19,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:19,455 INFO L225 Difference]: With dead ends: 189 [2018-04-11 15:10:19,455 INFO L226 Difference]: Without dead ends: 189 [2018-04-11 15:10:19,455 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=194, Invalid=2356, Unknown=0, NotChecked=0, Total=2550 [2018-04-11 15:10:19,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-04-11 15:10:19,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 118. [2018-04-11 15:10:19,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-11 15:10:19,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2018-04-11 15:10:19,456 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 127 transitions. Word has length 59 [2018-04-11 15:10:19,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:19,456 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 127 transitions. [2018-04-11 15:10:19,456 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-11 15:10:19,456 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 127 transitions. [2018-04-11 15:10:19,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-11 15:10:19,457 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:19,457 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:10:19,457 INFO L408 AbstractCegarLoop]: === Iteration 57 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:19,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1987940566, now seen corresponding path program 17 times [2018-04-11 15:10:19,457 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:19,457 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:19,457 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:19,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:10:19,457 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:19,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:19,470 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:19,503 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:10:19,503 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:19,503 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:19,503 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:10:19,521 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-04-11 15:10:19,521 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:10:19,524 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:19,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:10:19,526 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:19,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:10:19,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:19,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:19,533 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:10:19,551 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:19,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:10:19,552 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:19,558 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:19,558 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:19,559 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:10:19,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:19,562 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:10:19,562 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:10:19,675 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:10:19,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:19,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:19,678 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:11 [2018-04-11 15:10:19,846 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:19,846 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:10:19,846 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-11 15:10:19,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-11 15:10:19,846 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-11 15:10:19,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=648, Unknown=0, NotChecked=0, Total=702 [2018-04-11 15:10:19,846 INFO L87 Difference]: Start difference. First operand 118 states and 127 transitions. Second operand 27 states. [2018-04-11 15:10:20,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:20,646 INFO L93 Difference]: Finished difference Result 219 states and 228 transitions. [2018-04-11 15:10:20,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-11 15:10:20,646 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 59 [2018-04-11 15:10:20,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:20,646 INFO L225 Difference]: With dead ends: 219 [2018-04-11 15:10:20,646 INFO L226 Difference]: Without dead ends: 219 [2018-04-11 15:10:20,647 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=193, Invalid=2357, Unknown=0, NotChecked=0, Total=2550 [2018-04-11 15:10:20,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-04-11 15:10:20,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 118. [2018-04-11 15:10:20,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-11 15:10:20,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2018-04-11 15:10:20,648 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 127 transitions. Word has length 59 [2018-04-11 15:10:20,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:20,648 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 127 transitions. [2018-04-11 15:10:20,649 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-11 15:10:20,649 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 127 transitions. [2018-04-11 15:10:20,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-11 15:10:20,649 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:20,649 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:10:20,649 INFO L408 AbstractCegarLoop]: === Iteration 58 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:20,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1250635009, now seen corresponding path program 18 times [2018-04-11 15:10:20,649 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:20,649 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:20,650 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:20,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:10:20,650 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:20,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:20,655 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:20,688 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:10:20,688 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:20,688 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:20,688 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:10:20,715 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-04-11 15:10:20,716 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:10:20,720 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:20,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:10:20,724 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:20,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:10:20,728 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:20,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:20,731 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:10:20,741 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:20,742 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:10:20,742 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:20,749 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:20,749 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:20,750 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:10:20,750 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:20,754 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:10:20,754 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:10:21,074 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:21,075 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:10:21,075 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-11 15:10:21,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 15:10:21,075 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 15:10:21,075 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552 [2018-04-11 15:10:21,075 INFO L87 Difference]: Start difference. First operand 118 states and 127 transitions. Second operand 24 states. [2018-04-11 15:10:21,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:21,894 INFO L93 Difference]: Finished difference Result 244 states and 253 transitions. [2018-04-11 15:10:21,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 15:10:21,894 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 59 [2018-04-11 15:10:21,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:21,895 INFO L225 Difference]: With dead ends: 244 [2018-04-11 15:10:21,895 INFO L226 Difference]: Without dead ends: 244 [2018-04-11 15:10:21,895 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=167, Invalid=1813, Unknown=0, NotChecked=0, Total=1980 [2018-04-11 15:10:21,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-04-11 15:10:21,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 118. [2018-04-11 15:10:21,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-11 15:10:21,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2018-04-11 15:10:21,897 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 127 transitions. Word has length 59 [2018-04-11 15:10:21,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:21,897 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 127 transitions. [2018-04-11 15:10:21,897 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 15:10:21,897 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 127 transitions. [2018-04-11 15:10:21,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-11 15:10:21,897 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:21,897 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:10:21,897 INFO L408 AbstractCegarLoop]: === Iteration 59 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:21,897 INFO L82 PathProgramCache]: Analyzing trace with hash 750445770, now seen corresponding path program 19 times [2018-04-11 15:10:21,897 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:21,897 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:21,898 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:21,898 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:10:21,898 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:21,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:21,903 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:21,923 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:10:21,923 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:21,923 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:21,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:10:21,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:21,939 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:21,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:10:21,941 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:21,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:10:21,954 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:21,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:21,957 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:10:21,967 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:21,968 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:21,968 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:10:21,969 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:21,974 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:10:21,974 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:21,978 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:10:21,978 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:10:22,209 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:22,209 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:10:22,209 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-11 15:10:22,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 15:10:22,209 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 15:10:22,209 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2018-04-11 15:10:22,209 INFO L87 Difference]: Start difference. First operand 118 states and 127 transitions. Second operand 22 states. [2018-04-11 15:10:22,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:22,881 INFO L93 Difference]: Finished difference Result 264 states and 273 transitions. [2018-04-11 15:10:22,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 15:10:22,881 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 59 [2018-04-11 15:10:22,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:22,882 INFO L225 Difference]: With dead ends: 264 [2018-04-11 15:10:22,882 INFO L226 Difference]: Without dead ends: 264 [2018-04-11 15:10:22,882 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=140, Invalid=1420, Unknown=0, NotChecked=0, Total=1560 [2018-04-11 15:10:22,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-04-11 15:10:22,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 118. [2018-04-11 15:10:22,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-11 15:10:22,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2018-04-11 15:10:22,884 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 127 transitions. Word has length 59 [2018-04-11 15:10:22,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:22,884 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 127 transitions. [2018-04-11 15:10:22,884 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 15:10:22,884 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 127 transitions. [2018-04-11 15:10:22,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-11 15:10:22,884 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:22,884 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:10:22,884 INFO L408 AbstractCegarLoop]: === Iteration 60 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:22,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1107800929, now seen corresponding path program 20 times [2018-04-11 15:10:22,884 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:22,884 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:22,885 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:22,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:10:22,885 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:22,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:22,891 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:22,900 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:10:22,900 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:22,900 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:22,900 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:10:22,916 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:10:22,916 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:10:22,920 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:22,922 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:10:22,922 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:22,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:10:22,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:22,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:22,928 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:10:22,936 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:22,936 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:22,936 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:10:22,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:22,940 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:10:22,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:22,943 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:10:22,944 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:10:23,127 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:23,127 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:10:23,127 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-11 15:10:23,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 15:10:23,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 15:10:23,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=380, Unknown=0, NotChecked=0, Total=420 [2018-04-11 15:10:23,128 INFO L87 Difference]: Start difference. First operand 118 states and 127 transitions. Second operand 21 states. [2018-04-11 15:10:23,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:23,743 INFO L93 Difference]: Finished difference Result 279 states and 288 transitions. [2018-04-11 15:10:23,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 15:10:23,743 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 59 [2018-04-11 15:10:23,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:23,743 INFO L225 Difference]: With dead ends: 279 [2018-04-11 15:10:23,744 INFO L226 Difference]: Without dead ends: 279 [2018-04-11 15:10:23,744 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=1280, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 15:10:23,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-04-11 15:10:23,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 118. [2018-04-11 15:10:23,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-11 15:10:23,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2018-04-11 15:10:23,745 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 127 transitions. Word has length 59 [2018-04-11 15:10:23,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:23,745 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 127 transitions. [2018-04-11 15:10:23,745 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 15:10:23,745 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 127 transitions. [2018-04-11 15:10:23,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-11 15:10:23,746 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:23,746 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:10:23,746 INFO L408 AbstractCegarLoop]: === Iteration 61 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:23,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1000611222, now seen corresponding path program 21 times [2018-04-11 15:10:23,746 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:23,746 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:23,746 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:23,746 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:10:23,746 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:23,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:23,752 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:23,763 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:10:23,763 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:23,763 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:23,763 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:10:23,799 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-04-11 15:10:23,799 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:10:23,802 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:23,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:10:23,804 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:23,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:10:23,809 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:23,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:23,812 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:10:23,822 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:23,823 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:10:23,823 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:23,830 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:23,830 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:23,831 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:10:23,831 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:23,835 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:10:23,835 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:10:24,023 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 109 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:24,023 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:10:24,024 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-11 15:10:24,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 15:10:24,024 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 15:10:24,024 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2018-04-11 15:10:24,024 INFO L87 Difference]: Start difference. First operand 118 states and 127 transitions. Second operand 20 states. [2018-04-11 15:10:24,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:24,605 INFO L93 Difference]: Finished difference Result 290 states and 299 transitions. [2018-04-11 15:10:24,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 15:10:24,605 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 59 [2018-04-11 15:10:24,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:24,606 INFO L225 Difference]: With dead ends: 290 [2018-04-11 15:10:24,606 INFO L226 Difference]: Without dead ends: 290 [2018-04-11 15:10:24,606 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=1140, Unknown=0, NotChecked=0, Total=1260 [2018-04-11 15:10:24,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-04-11 15:10:24,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 118. [2018-04-11 15:10:24,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-04-11 15:10:24,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 127 transitions. [2018-04-11 15:10:24,607 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 127 transitions. Word has length 59 [2018-04-11 15:10:24,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:24,608 INFO L459 AbstractCegarLoop]: Abstraction has 118 states and 127 transitions. [2018-04-11 15:10:24,608 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 15:10:24,608 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 127 transitions. [2018-04-11 15:10:24,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-11 15:10:24,608 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:24,608 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:10:24,608 INFO L408 AbstractCegarLoop]: === Iteration 62 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:24,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1209617983, now seen corresponding path program 7 times [2018-04-11 15:10:24,608 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:24,608 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:24,609 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:24,609 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:10:24,609 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:24,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:24,615 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:24,630 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:10:24,630 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:24,631 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:24,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:10:24,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:24,650 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:24,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:10:24,652 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:24,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:10:24,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:24,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:24,658 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:10:24,666 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:24,667 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:10:24,667 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:24,672 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:24,672 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:24,673 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:10:24,673 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:24,676 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:10:24,676 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:10:24,811 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:24,811 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:10:24,812 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-11 15:10:24,812 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 15:10:24,812 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 15:10:24,812 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-04-11 15:10:24,812 INFO L87 Difference]: Start difference. First operand 118 states and 127 transitions. Second operand 19 states. [2018-04-11 15:10:25,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:25,331 INFO L93 Difference]: Finished difference Result 303 states and 313 transitions. [2018-04-11 15:10:25,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-11 15:10:25,331 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 59 [2018-04-11 15:10:25,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:25,332 INFO L225 Difference]: With dead ends: 303 [2018-04-11 15:10:25,332 INFO L226 Difference]: Without dead ends: 303 [2018-04-11 15:10:25,332 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=1016, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 15:10:25,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-04-11 15:10:25,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 119. [2018-04-11 15:10:25,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-04-11 15:10:25,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 129 transitions. [2018-04-11 15:10:25,334 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 129 transitions. Word has length 59 [2018-04-11 15:10:25,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:25,334 INFO L459 AbstractCegarLoop]: Abstraction has 119 states and 129 transitions. [2018-04-11 15:10:25,335 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 15:10:25,335 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 129 transitions. [2018-04-11 15:10:25,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-04-11 15:10:25,335 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:25,335 INFO L355 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:10:25,335 INFO L408 AbstractCegarLoop]: === Iteration 63 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:25,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1191728613, now seen corresponding path program 8 times [2018-04-11 15:10:25,335 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:25,336 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:25,336 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:25,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:10:25,336 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:25,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:25,346 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:25,369 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:10:25,369 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:25,369 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:25,370 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:10:25,392 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:10:25,392 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:10:25,396 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:25,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:10:25,398 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:25,402 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:10:25,402 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:25,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:25,405 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:10:25,415 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:25,416 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:10:25,416 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:25,423 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:25,423 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:25,423 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:10:25,423 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:25,427 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:10:25,427 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:10:25,549 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:25,550 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:10:25,550 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-04-11 15:10:25,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-04-11 15:10:25,550 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-04-11 15:10:25,550 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2018-04-11 15:10:25,550 INFO L87 Difference]: Start difference. First operand 119 states and 129 transitions. Second operand 17 states. [2018-04-11 15:10:25,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:25,986 INFO L93 Difference]: Finished difference Result 305 states and 316 transitions. [2018-04-11 15:10:25,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-04-11 15:10:25,987 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 59 [2018-04-11 15:10:25,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:25,987 INFO L225 Difference]: With dead ends: 305 [2018-04-11 15:10:25,987 INFO L226 Difference]: Without dead ends: 305 [2018-04-11 15:10:25,988 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=782, Unknown=0, NotChecked=0, Total=870 [2018-04-11 15:10:25,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-04-11 15:10:25,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 123. [2018-04-11 15:10:25,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-04-11 15:10:25,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 133 transitions. [2018-04-11 15:10:25,989 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 133 transitions. Word has length 59 [2018-04-11 15:10:25,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:25,989 INFO L459 AbstractCegarLoop]: Abstraction has 123 states and 133 transitions. [2018-04-11 15:10:25,989 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-04-11 15:10:25,989 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 133 transitions. [2018-04-11 15:10:25,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-11 15:10:25,990 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:25,990 INFO L355 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:10:25,990 INFO L408 AbstractCegarLoop]: === Iteration 64 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:25,990 INFO L82 PathProgramCache]: Analyzing trace with hash -2099431035, now seen corresponding path program 8 times [2018-04-11 15:10:25,990 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:25,990 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:25,991 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:25,991 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:10:25,991 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:25,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:25,996 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:26,010 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:10:26,010 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:26,011 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:26,011 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:10:26,023 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:10:26,023 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:10:26,026 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:26,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:10:26,029 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:26,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:10:26,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:26,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:26,038 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:17 [2018-04-11 15:10:26,052 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:26,053 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:26,053 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:10:26,053 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:26,058 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:10:26,058 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:26,062 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:10:26,062 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:10:26,544 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:26,544 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:10:26,544 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-04-11 15:10:26,545 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-11 15:10:26,545 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-11 15:10:26,545 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=753, Unknown=0, NotChecked=0, Total=812 [2018-04-11 15:10:26,545 INFO L87 Difference]: Start difference. First operand 123 states and 133 transitions. Second operand 29 states. [2018-04-11 15:10:27,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:27,639 INFO L93 Difference]: Finished difference Result 169 states and 179 transitions. [2018-04-11 15:10:27,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 15:10:27,639 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 64 [2018-04-11 15:10:27,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:27,640 INFO L225 Difference]: With dead ends: 169 [2018-04-11 15:10:27,640 INFO L226 Difference]: Without dead ends: 169 [2018-04-11 15:10:27,640 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=202, Invalid=2554, Unknown=0, NotChecked=0, Total=2756 [2018-04-11 15:10:27,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-04-11 15:10:27,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 128. [2018-04-11 15:10:27,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-04-11 15:10:27,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2018-04-11 15:10:27,642 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 64 [2018-04-11 15:10:27,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:27,642 INFO L459 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2018-04-11 15:10:27,642 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-11 15:10:27,642 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2018-04-11 15:10:27,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-11 15:10:27,643 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:27,643 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:10:27,643 INFO L408 AbstractCegarLoop]: === Iteration 65 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:27,643 INFO L82 PathProgramCache]: Analyzing trace with hash -855744244, now seen corresponding path program 22 times [2018-04-11 15:10:27,643 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:27,643 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:27,644 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:27,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:10:27,644 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:27,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:27,649 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:27,668 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:10:27,669 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:27,669 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:27,669 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:10:27,682 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:10:27,682 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:10:27,685 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:27,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:10:27,687 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:27,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:10:27,699 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:27,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:27,703 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:10:27,722 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:27,723 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:27,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:10:27,724 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:27,730 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:10:27,730 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:27,734 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:10:27,734 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:10:28,270 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 138 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:28,270 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:10:28,270 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-11 15:10:28,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-11 15:10:28,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-11 15:10:28,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=650, Unknown=0, NotChecked=0, Total=702 [2018-04-11 15:10:28,271 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand 27 states. [2018-04-11 15:10:29,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:29,277 INFO L93 Difference]: Finished difference Result 209 states and 219 transitions. [2018-04-11 15:10:29,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-11 15:10:29,278 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 64 [2018-04-11 15:10:29,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:29,278 INFO L225 Difference]: With dead ends: 209 [2018-04-11 15:10:29,278 INFO L226 Difference]: Without dead ends: 209 [2018-04-11 15:10:29,279 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=186, Invalid=2264, Unknown=0, NotChecked=0, Total=2450 [2018-04-11 15:10:29,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-04-11 15:10:29,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 128. [2018-04-11 15:10:29,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-04-11 15:10:29,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2018-04-11 15:10:29,280 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 64 [2018-04-11 15:10:29,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:29,280 INFO L459 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2018-04-11 15:10:29,280 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-11 15:10:29,281 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2018-04-11 15:10:29,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-11 15:10:29,281 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:29,281 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:10:29,281 INFO L408 AbstractCegarLoop]: === Iteration 66 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:29,281 INFO L82 PathProgramCache]: Analyzing trace with hash -938410461, now seen corresponding path program 23 times [2018-04-11 15:10:29,281 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:29,281 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:29,282 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:29,282 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:10:29,282 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:29,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:29,288 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:29,313 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:10:29,313 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:29,313 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:29,313 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:10:29,330 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-04-11 15:10:29,330 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:10:29,333 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:29,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:10:29,347 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:29,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:10:29,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:29,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:29,363 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:10:29,373 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:29,374 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:10:29,374 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:29,389 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:29,389 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:29,390 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:10:29,390 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:29,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:10:29,396 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:23 [2018-04-11 15:10:29,768 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:10:29,768 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:29,772 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:10:29,772 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:16 [2018-04-11 15:10:29,860 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:29,860 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:10:29,860 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-11 15:10:29,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-11 15:10:29,861 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-11 15:10:29,861 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=700, Unknown=0, NotChecked=0, Total=756 [2018-04-11 15:10:29,861 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand 28 states. [2018-04-11 15:10:31,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:31,390 INFO L93 Difference]: Finished difference Result 244 states and 254 transitions. [2018-04-11 15:10:31,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 15:10:31,391 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 64 [2018-04-11 15:10:31,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:31,391 INFO L225 Difference]: With dead ends: 244 [2018-04-11 15:10:31,391 INFO L226 Difference]: Without dead ends: 244 [2018-04-11 15:10:31,392 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=201, Invalid=2555, Unknown=0, NotChecked=0, Total=2756 [2018-04-11 15:10:31,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-04-11 15:10:31,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 128. [2018-04-11 15:10:31,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-04-11 15:10:31,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2018-04-11 15:10:31,393 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 64 [2018-04-11 15:10:31,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:31,393 INFO L459 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2018-04-11 15:10:31,393 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-11 15:10:31,393 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2018-04-11 15:10:31,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-11 15:10:31,393 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:31,393 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:10:31,393 INFO L408 AbstractCegarLoop]: === Iteration 67 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:31,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1591234220, now seen corresponding path program 24 times [2018-04-11 15:10:31,394 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:31,394 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:31,394 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:31,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:10:31,394 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:31,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:31,400 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:31,426 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:10:31,427 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:31,427 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:31,427 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:10:31,453 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-04-11 15:10:31,453 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:10:31,457 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:31,459 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:10:31,459 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:31,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:10:31,471 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:31,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:31,474 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:10:31,484 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:31,485 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:10:31,485 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:31,492 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:31,492 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:31,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:10:31,493 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:31,510 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:10:31,510 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:10:31,608 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 7 treesize of output 5 [2018-04-11 15:10:31,610 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:10:31,610 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:31,611 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:31,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 15:10:31,618 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:21 [2018-04-11 15:10:31,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-04-11 15:10:31,745 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:31,750 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:10:31,750 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2018-04-11 15:10:31,988 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:31,988 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:10:31,988 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-11 15:10:31,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-11 15:10:31,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-11 15:10:31,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=699, Unknown=0, NotChecked=0, Total=756 [2018-04-11 15:10:31,989 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand 28 states. [2018-04-11 15:10:33,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:33,003 INFO L93 Difference]: Finished difference Result 274 states and 284 transitions. [2018-04-11 15:10:33,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-11 15:10:33,004 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 64 [2018-04-11 15:10:33,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:33,004 INFO L225 Difference]: With dead ends: 274 [2018-04-11 15:10:33,004 INFO L226 Difference]: Without dead ends: 274 [2018-04-11 15:10:33,005 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=199, Invalid=2453, Unknown=0, NotChecked=0, Total=2652 [2018-04-11 15:10:33,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-04-11 15:10:33,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 128. [2018-04-11 15:10:33,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-04-11 15:10:33,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2018-04-11 15:10:33,006 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 64 [2018-04-11 15:10:33,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:33,006 INFO L459 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2018-04-11 15:10:33,006 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-11 15:10:33,006 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2018-04-11 15:10:33,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-11 15:10:33,006 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:33,006 INFO L355 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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:10:33,006 INFO L408 AbstractCegarLoop]: === Iteration 68 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:33,007 INFO L82 PathProgramCache]: Analyzing trace with hash 534842499, now seen corresponding path program 25 times [2018-04-11 15:10:33,007 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:33,007 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:33,007 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:33,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:10:33,007 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:33,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:33,013 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:33,015 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:10:33,015 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:33,015 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:33,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:10:33,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:33,036 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:33,037 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:10:33,038 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:33,054 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:10:33,054 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:33,057 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:33,057 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:10:33,067 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:33,068 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:10:33,068 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:33,075 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:33,075 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:33,076 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:10:33,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:33,079 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:10:33,079 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:10:33,359 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:33,359 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:10:33,359 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-11 15:10:33,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-11 15:10:33,359 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-11 15:10:33,359 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2018-04-11 15:10:33,360 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand 26 states. [2018-04-11 15:10:34,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:34,257 INFO L93 Difference]: Finished difference Result 299 states and 309 transitions. [2018-04-11 15:10:34,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-11 15:10:34,258 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 64 [2018-04-11 15:10:34,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:34,258 INFO L225 Difference]: With dead ends: 299 [2018-04-11 15:10:34,258 INFO L226 Difference]: Without dead ends: 299 [2018-04-11 15:10:34,259 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=180, Invalid=2172, Unknown=0, NotChecked=0, Total=2352 [2018-04-11 15:10:34,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-04-11 15:10:34,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 128. [2018-04-11 15:10:34,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-04-11 15:10:34,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2018-04-11 15:10:34,260 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 64 [2018-04-11 15:10:34,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:34,260 INFO L459 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2018-04-11 15:10:34,260 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-11 15:10:34,260 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2018-04-11 15:10:34,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-11 15:10:34,261 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:34,261 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:10:34,261 INFO L408 AbstractCegarLoop]: === Iteration 69 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:34,261 INFO L82 PathProgramCache]: Analyzing trace with hash 34653260, now seen corresponding path program 26 times [2018-04-11 15:10:34,261 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:34,261 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:34,261 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:34,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:10:34,262 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:34,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:34,270 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:34,272 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:10:34,272 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:34,272 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:34,272 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:10:34,292 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:10:34,293 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:10:34,296 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:34,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:10:34,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:34,302 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:10:34,302 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:34,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:34,305 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:10:34,316 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:34,317 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:10:34,317 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:34,324 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:34,325 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:34,325 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:10:34,326 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:34,329 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:10:34,329 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:10:34,584 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:34,584 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:10:34,584 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 15:10:34,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 15:10:34,585 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 15:10:34,585 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506 [2018-04-11 15:10:34,585 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand 23 states. [2018-04-11 15:10:35,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:35,433 INFO L93 Difference]: Finished difference Result 319 states and 329 transitions. [2018-04-11 15:10:35,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 15:10:35,434 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 64 [2018-04-11 15:10:35,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:35,434 INFO L225 Difference]: With dead ends: 319 [2018-04-11 15:10:35,434 INFO L226 Difference]: Without dead ends: 319 [2018-04-11 15:10:35,434 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=146, Invalid=1576, Unknown=0, NotChecked=0, Total=1722 [2018-04-11 15:10:35,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-04-11 15:10:35,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 128. [2018-04-11 15:10:35,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-04-11 15:10:35,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2018-04-11 15:10:35,436 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 64 [2018-04-11 15:10:35,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:35,436 INFO L459 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2018-04-11 15:10:35,436 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 15:10:35,436 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2018-04-11 15:10:35,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-11 15:10:35,436 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:35,436 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:10:35,436 INFO L408 AbstractCegarLoop]: === Iteration 70 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:35,436 INFO L82 PathProgramCache]: Analyzing trace with hash 392008419, now seen corresponding path program 27 times [2018-04-11 15:10:35,436 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:35,436 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:35,437 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:35,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:10:35,437 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:35,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:35,444 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:35,445 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:10:35,446 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:35,446 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:35,446 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:10:35,506 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-04-11 15:10:35,506 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:10:35,533 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:35,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:10:35,547 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:35,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:10:35,569 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:35,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:35,573 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:10:35,587 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:35,588 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:35,589 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:10:35,589 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:35,596 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:10:35,597 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:35,602 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:10:35,602 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:10:35,874 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 118 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:35,875 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:10:35,875 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-11 15:10:35,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 15:10:35,875 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 15:10:35,875 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2018-04-11 15:10:35,875 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand 22 states. [2018-04-11 15:10:36,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:36,589 INFO L93 Difference]: Finished difference Result 334 states and 344 transitions. [2018-04-11 15:10:36,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 15:10:36,590 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 64 [2018-04-11 15:10:36,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:36,590 INFO L225 Difference]: With dead ends: 334 [2018-04-11 15:10:36,590 INFO L226 Difference]: Without dead ends: 334 [2018-04-11 15:10:36,591 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=1424, Unknown=0, NotChecked=0, Total=1560 [2018-04-11 15:10:36,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-04-11 15:10:36,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 128. [2018-04-11 15:10:36,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-04-11 15:10:36,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2018-04-11 15:10:36,592 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 64 [2018-04-11 15:10:36,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:36,592 INFO L459 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2018-04-11 15:10:36,593 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 15:10:36,593 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2018-04-11 15:10:36,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-11 15:10:36,593 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:36,593 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:10:36,593 INFO L408 AbstractCegarLoop]: === Iteration 71 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:36,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1716403732, now seen corresponding path program 28 times [2018-04-11 15:10:36,593 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:36,593 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:36,594 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:36,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:10:36,594 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:36,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:36,603 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:36,606 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:10:36,606 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:36,606 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:36,607 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:10:36,640 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:10:36,641 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:10:36,646 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:36,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:10:36,656 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:36,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:10:36,663 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:36,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:36,667 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:10:36,682 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:36,683 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:10:36,684 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:36,693 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:36,694 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:36,695 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:10:36,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:36,699 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:10:36,699 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:10:36,896 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:36,896 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:10:36,896 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-11 15:10:36,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 15:10:36,896 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 15:10:36,896 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=380, Unknown=0, NotChecked=0, Total=420 [2018-04-11 15:10:36,897 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand 21 states. [2018-04-11 15:10:37,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:37,619 INFO L93 Difference]: Finished difference Result 345 states and 355 transitions. [2018-04-11 15:10:37,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 15:10:37,620 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 64 [2018-04-11 15:10:37,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:37,620 INFO L225 Difference]: With dead ends: 345 [2018-04-11 15:10:37,621 INFO L226 Difference]: Without dead ends: 345 [2018-04-11 15:10:37,621 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=1280, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 15:10:37,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-04-11 15:10:37,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 128. [2018-04-11 15:10:37,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-04-11 15:10:37,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2018-04-11 15:10:37,622 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 64 [2018-04-11 15:10:37,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:37,622 INFO L459 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2018-04-11 15:10:37,622 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 15:10:37,622 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2018-04-11 15:10:37,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-11 15:10:37,623 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:37,623 INFO L355 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:10:37,623 INFO L408 AbstractCegarLoop]: === Iteration 72 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:37,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1925410493, now seen corresponding path program 8 times [2018-04-11 15:10:37,623 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:37,623 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:37,624 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:37,624 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:10:37,624 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:37,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:37,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:10:37,681 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:10:37,681 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:37,681 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:37,682 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:10:37,711 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:10:37,711 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:10:37,716 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:37,735 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:10:37,736 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:37,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:10:37,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:37,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:37,745 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:10:37,759 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:37,761 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:10:37,761 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:37,770 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:37,771 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:37,771 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:10:37,772 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:37,777 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:10:37,777 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:10:37,958 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:37,958 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:10:37,958 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-11 15:10:37,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 15:10:37,959 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 15:10:37,959 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2018-04-11 15:10:37,959 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand 20 states. [2018-04-11 15:10:38,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:38,619 INFO L93 Difference]: Finished difference Result 358 states and 369 transitions. [2018-04-11 15:10:38,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 15:10:38,619 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 64 [2018-04-11 15:10:38,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:38,620 INFO L225 Difference]: With dead ends: 358 [2018-04-11 15:10:38,620 INFO L226 Difference]: Without dead ends: 358 [2018-04-11 15:10:38,620 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=1148, Unknown=0, NotChecked=0, Total=1260 [2018-04-11 15:10:38,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-04-11 15:10:38,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 129. [2018-04-11 15:10:38,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-04-11 15:10:38,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 140 transitions. [2018-04-11 15:10:38,621 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 140 transitions. Word has length 64 [2018-04-11 15:10:38,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:38,621 INFO L459 AbstractCegarLoop]: Abstraction has 129 states and 140 transitions. [2018-04-11 15:10:38,621 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 15:10:38,621 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 140 transitions. [2018-04-11 15:10:38,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-04-11 15:10:38,622 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:38,622 INFO L355 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:10:38,622 INFO L408 AbstractCegarLoop]: === Iteration 73 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:38,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1907521123, now seen corresponding path program 9 times [2018-04-11 15:10:38,622 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:38,622 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:38,622 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:38,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:10:38,622 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:38,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:38,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:10:38,631 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:10:38,631 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:38,631 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:38,632 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:10:38,681 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-04-11 15:10:38,681 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:10:38,697 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:38,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:10:38,700 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:38,705 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:10:38,705 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:38,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:38,710 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:10:38,729 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:38,730 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:10:38,730 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:38,748 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:38,749 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:38,749 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:10:38,750 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:38,756 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:10:38,756 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:10:38,946 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:38,946 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:10:38,946 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-04-11 15:10:38,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-04-11 15:10:38,946 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-04-11 15:10:38,946 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2018-04-11 15:10:38,947 INFO L87 Difference]: Start difference. First operand 129 states and 140 transitions. Second operand 18 states. [2018-04-11 15:10:39,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:39,440 INFO L93 Difference]: Finished difference Result 360 states and 372 transitions. [2018-04-11 15:10:39,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-04-11 15:10:39,440 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 64 [2018-04-11 15:10:39,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:39,441 INFO L225 Difference]: With dead ends: 360 [2018-04-11 15:10:39,441 INFO L226 Difference]: Without dead ends: 360 [2018-04-11 15:10:39,441 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=898, Unknown=0, NotChecked=0, Total=992 [2018-04-11 15:10:39,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2018-04-11 15:10:39,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 133. [2018-04-11 15:10:39,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-04-11 15:10:39,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 144 transitions. [2018-04-11 15:10:39,443 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 144 transitions. Word has length 64 [2018-04-11 15:10:39,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:39,443 INFO L459 AbstractCegarLoop]: Abstraction has 133 states and 144 transitions. [2018-04-11 15:10:39,443 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-04-11 15:10:39,443 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 144 transitions. [2018-04-11 15:10:39,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-11 15:10:39,443 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:39,443 INFO L355 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:10:39,443 INFO L408 AbstractCegarLoop]: === Iteration 74 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:39,444 INFO L82 PathProgramCache]: Analyzing trace with hash -450005848, now seen corresponding path program 9 times [2018-04-11 15:10:39,444 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:39,444 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:39,444 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:39,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:10:39,444 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:39,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:39,450 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:39,522 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:10:39,523 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:39,523 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:39,523 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:10:39,540 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-04-11 15:10:39,541 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:10:39,546 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:39,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:10:39,550 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:39,555 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:10:39,555 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:39,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:39,558 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:10:39,569 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:39,570 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:10:39,570 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:39,577 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:39,577 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:39,578 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:10:39,578 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:39,582 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:10:39,582 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:10:39,978 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:39,978 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:10:39,978 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-04-11 15:10:39,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-11 15:10:39,978 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-11 15:10:39,978 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=870, Unknown=0, NotChecked=0, Total=930 [2018-04-11 15:10:39,979 INFO L87 Difference]: Start difference. First operand 133 states and 144 transitions. Second operand 31 states. [2018-04-11 15:10:41,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:41,022 INFO L93 Difference]: Finished difference Result 184 states and 195 transitions. [2018-04-11 15:10:41,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-11 15:10:41,022 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 69 [2018-04-11 15:10:41,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:41,023 INFO L225 Difference]: With dead ends: 184 [2018-04-11 15:10:41,023 INFO L226 Difference]: Without dead ends: 184 [2018-04-11 15:10:41,023 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=229, Invalid=3193, Unknown=0, NotChecked=0, Total=3422 [2018-04-11 15:10:41,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-04-11 15:10:41,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 138. [2018-04-11 15:10:41,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-04-11 15:10:41,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 149 transitions. [2018-04-11 15:10:41,024 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 149 transitions. Word has length 69 [2018-04-11 15:10:41,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:41,024 INFO L459 AbstractCegarLoop]: Abstraction has 138 states and 149 transitions. [2018-04-11 15:10:41,024 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-11 15:10:41,024 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 149 transitions. [2018-04-11 15:10:41,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-11 15:10:41,025 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:41,025 INFO L355 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:10:41,025 INFO L408 AbstractCegarLoop]: === Iteration 75 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:41,025 INFO L82 PathProgramCache]: Analyzing trace with hash 990570881, now seen corresponding path program 29 times [2018-04-11 15:10:41,025 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:41,025 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:41,025 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:41,025 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:10:41,025 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:41,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:41,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:10:41,077 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:10:41,077 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:41,077 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:41,078 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:10:41,114 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-04-11 15:10:41,114 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:10:41,119 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:41,121 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:10:41,122 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:41,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:10:41,133 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:41,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:41,145 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:10:41,155 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:41,156 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:41,156 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:10:41,157 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:41,164 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:10:41,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:41,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:10:41,170 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:23 [2018-04-11 15:10:41,330 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:10:41,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:41,335 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:10:41,335 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:14 [2018-04-11 15:10:41,670 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:41,670 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:10:41,670 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-04-11 15:10:41,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-11 15:10:41,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-11 15:10:41,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=869, Unknown=0, NotChecked=0, Total=930 [2018-04-11 15:10:41,671 INFO L87 Difference]: Start difference. First operand 138 states and 149 transitions. Second operand 31 states. [2018-04-11 15:10:43,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:43,366 INFO L93 Difference]: Finished difference Result 229 states and 240 transitions. [2018-04-11 15:10:43,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-11 15:10:43,367 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 69 [2018-04-11 15:10:43,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:43,367 INFO L225 Difference]: With dead ends: 229 [2018-04-11 15:10:43,367 INFO L226 Difference]: Without dead ends: 229 [2018-04-11 15:10:43,368 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 450 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=231, Invalid=3309, Unknown=0, NotChecked=0, Total=3540 [2018-04-11 15:10:43,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-04-11 15:10:43,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 138. [2018-04-11 15:10:43,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-04-11 15:10:43,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 149 transitions. [2018-04-11 15:10:43,369 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 149 transitions. Word has length 69 [2018-04-11 15:10:43,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:43,369 INFO L459 AbstractCegarLoop]: Abstraction has 138 states and 149 transitions. [2018-04-11 15:10:43,369 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-11 15:10:43,369 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 149 transitions. [2018-04-11 15:10:43,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-11 15:10:43,369 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:43,369 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:10:43,369 INFO L408 AbstractCegarLoop]: === Iteration 76 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:43,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1800528586, now seen corresponding path program 30 times [2018-04-11 15:10:43,370 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:43,370 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:43,370 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:43,370 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:10:43,370 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:43,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:43,378 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:43,402 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:10:43,402 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:43,402 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:43,403 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:10:43,443 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-04-11 15:10:43,443 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:10:43,449 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:43,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:10:43,460 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:43,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:10:43,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:43,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:43,469 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:10:43,481 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:43,483 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:10:43,483 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:43,492 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:43,493 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:43,493 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:10:43,493 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:43,507 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:10:43,507 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:10:43,894 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:43,894 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:10:43,895 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-04-11 15:10:43,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-11 15:10:43,895 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-11 15:10:43,895 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-04-11 15:10:43,895 INFO L87 Difference]: Start difference. First operand 138 states and 149 transitions. Second operand 30 states. [2018-04-11 15:10:44,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:44,854 INFO L93 Difference]: Finished difference Result 269 states and 280 transitions. [2018-04-11 15:10:44,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-11 15:10:44,854 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 69 [2018-04-11 15:10:44,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:44,855 INFO L225 Difference]: With dead ends: 269 [2018-04-11 15:10:44,855 INFO L226 Difference]: Without dead ends: 269 [2018-04-11 15:10:44,855 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=219, Invalid=3087, Unknown=0, NotChecked=0, Total=3306 [2018-04-11 15:10:44,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-04-11 15:10:44,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 138. [2018-04-11 15:10:44,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-04-11 15:10:44,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 149 transitions. [2018-04-11 15:10:44,857 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 149 transitions. Word has length 69 [2018-04-11 15:10:44,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:44,857 INFO L459 AbstractCegarLoop]: Abstraction has 138 states and 149 transitions. [2018-04-11 15:10:44,857 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-11 15:10:44,857 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 149 transitions. [2018-04-11 15:10:44,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-11 15:10:44,857 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:44,857 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:10:44,857 INFO L408 AbstractCegarLoop]: === Iteration 77 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:44,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1717862369, now seen corresponding path program 31 times [2018-04-11 15:10:44,857 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:44,857 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:44,858 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:44,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:10:44,858 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:44,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:44,882 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:44,906 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:10:44,906 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:44,906 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:44,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:10:44,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:44,923 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:44,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:10:44,925 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:44,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:10:44,929 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:44,931 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:44,931 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:10:44,940 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:44,941 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:10:44,941 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:44,951 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:44,952 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:44,952 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:10:44,952 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:44,955 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:10:44,955 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:10:45,250 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 129 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:45,250 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:10:45,250 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-11 15:10:45,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-11 15:10:45,250 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-11 15:10:45,251 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=701, Unknown=0, NotChecked=0, Total=756 [2018-04-11 15:10:45,251 INFO L87 Difference]: Start difference. First operand 138 states and 149 transitions. Second operand 28 states. [2018-04-11 15:10:46,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:46,177 INFO L93 Difference]: Finished difference Result 304 states and 315 transitions. [2018-04-11 15:10:46,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-11 15:10:46,177 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 69 [2018-04-11 15:10:46,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:46,178 INFO L225 Difference]: With dead ends: 304 [2018-04-11 15:10:46,178 INFO L226 Difference]: Without dead ends: 304 [2018-04-11 15:10:46,178 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=193, Invalid=2459, Unknown=0, NotChecked=0, Total=2652 [2018-04-11 15:10:46,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-04-11 15:10:46,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 138. [2018-04-11 15:10:46,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-04-11 15:10:46,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 149 transitions. [2018-04-11 15:10:46,179 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 149 transitions. Word has length 69 [2018-04-11 15:10:46,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:46,179 INFO L459 AbstractCegarLoop]: Abstraction has 138 states and 149 transitions. [2018-04-11 15:10:46,179 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-11 15:10:46,179 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 149 transitions. [2018-04-11 15:10:46,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-11 15:10:46,180 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:46,180 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:10:46,180 INFO L408 AbstractCegarLoop]: === Iteration 78 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:46,180 INFO L82 PathProgramCache]: Analyzing trace with hash -47460246, now seen corresponding path program 32 times [2018-04-11 15:10:46,180 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:46,180 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:46,180 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:46,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:10:46,180 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:46,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:46,186 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:46,188 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:10:46,188 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:46,188 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:46,188 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:10:46,201 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:10:46,201 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:10:46,204 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:46,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:10:46,206 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:46,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:10:46,210 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:46,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:46,212 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:10:46,220 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:46,221 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:10:46,221 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:46,226 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:46,227 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:46,227 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:10:46,227 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:46,230 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:10:46,230 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:10:46,558 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:46,558 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:10:46,558 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-11 15:10:46,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-11 15:10:46,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-11 15:10:46,558 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2018-04-11 15:10:46,559 INFO L87 Difference]: Start difference. First operand 138 states and 149 transitions. Second operand 26 states. [2018-04-11 15:10:47,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:47,585 INFO L93 Difference]: Finished difference Result 334 states and 345 transitions. [2018-04-11 15:10:47,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 15:10:47,585 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 69 [2018-04-11 15:10:47,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:47,586 INFO L225 Difference]: With dead ends: 334 [2018-04-11 15:10:47,586 INFO L226 Difference]: Without dead ends: 334 [2018-04-11 15:10:47,586 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=172, Invalid=2084, Unknown=0, NotChecked=0, Total=2256 [2018-04-11 15:10:47,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-04-11 15:10:47,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 138. [2018-04-11 15:10:47,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-04-11 15:10:47,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 149 transitions. [2018-04-11 15:10:47,587 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 149 transitions. Word has length 69 [2018-04-11 15:10:47,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:47,588 INFO L459 AbstractCegarLoop]: Abstraction has 138 states and 149 transitions. [2018-04-11 15:10:47,588 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-11 15:10:47,588 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 149 transitions. [2018-04-11 15:10:47,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-11 15:10:47,588 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:47,588 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:10:47,588 INFO L408 AbstractCegarLoop]: === Iteration 79 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:47,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1103851967, now seen corresponding path program 33 times [2018-04-11 15:10:47,588 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:47,588 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:47,589 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:47,589 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:10:47,589 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:47,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:47,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:10:47,597 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:10:47,597 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:47,597 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:47,597 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:10:47,626 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-04-11 15:10:47,626 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:10:47,630 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:47,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:10:47,632 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:47,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:10:47,640 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:47,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:47,643 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:10:47,651 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:47,652 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:10:47,652 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:47,658 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:47,659 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:47,659 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:10:47,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:47,663 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:10:47,663 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:10:47,929 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:47,929 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:10:47,929 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-11 15:10:47,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-11 15:10:47,930 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-11 15:10:47,930 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2018-04-11 15:10:47,930 INFO L87 Difference]: Start difference. First operand 138 states and 149 transitions. Second operand 26 states. [2018-04-11 15:10:48,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:48,876 INFO L93 Difference]: Finished difference Result 359 states and 370 transitions. [2018-04-11 15:10:48,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-11 15:10:48,876 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 69 [2018-04-11 15:10:48,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:48,877 INFO L225 Difference]: With dead ends: 359 [2018-04-11 15:10:48,877 INFO L226 Difference]: Without dead ends: 359 [2018-04-11 15:10:48,877 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=179, Invalid=2173, Unknown=0, NotChecked=0, Total=2352 [2018-04-11 15:10:48,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-04-11 15:10:48,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 138. [2018-04-11 15:10:48,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-04-11 15:10:48,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 149 transitions. [2018-04-11 15:10:48,879 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 149 transitions. Word has length 69 [2018-04-11 15:10:48,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:48,879 INFO L459 AbstractCegarLoop]: Abstraction has 138 states and 149 transitions. [2018-04-11 15:10:48,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-11 15:10:48,879 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 149 transitions. [2018-04-11 15:10:48,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-11 15:10:48,879 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:48,879 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:10:48,879 INFO L408 AbstractCegarLoop]: === Iteration 80 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:48,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1604041206, now seen corresponding path program 34 times [2018-04-11 15:10:48,879 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:48,879 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:48,880 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:48,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:10:48,880 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:48,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:48,887 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:48,889 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:10:48,889 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:48,889 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:48,889 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:10:48,916 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:10:48,916 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:10:48,920 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:48,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:10:48,921 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:48,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:10:48,935 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:48,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:48,939 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:10:48,948 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:48,948 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:10:48,949 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:48,954 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:48,955 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:48,955 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:10:48,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:48,959 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:10:48,959 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:10:49,294 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:49,294 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:10:49,294 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-11 15:10:49,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 15:10:49,295 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 15:10:49,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=552, Unknown=0, NotChecked=0, Total=600 [2018-04-11 15:10:49,295 INFO L87 Difference]: Start difference. First operand 138 states and 149 transitions. Second operand 25 states. [2018-04-11 15:10:50,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:50,183 INFO L93 Difference]: Finished difference Result 379 states and 390 transitions. [2018-04-11 15:10:50,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 15:10:50,183 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 69 [2018-04-11 15:10:50,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:50,184 INFO L225 Difference]: With dead ends: 379 [2018-04-11 15:10:50,184 INFO L226 Difference]: Without dead ends: 379 [2018-04-11 15:10:50,184 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=165, Invalid=1997, Unknown=0, NotChecked=0, Total=2162 [2018-04-11 15:10:50,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-04-11 15:10:50,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 138. [2018-04-11 15:10:50,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-04-11 15:10:50,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 149 transitions. [2018-04-11 15:10:50,186 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 149 transitions. Word has length 69 [2018-04-11 15:10:50,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:50,186 INFO L459 AbstractCegarLoop]: Abstraction has 138 states and 149 transitions. [2018-04-11 15:10:50,186 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 15:10:50,186 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 149 transitions. [2018-04-11 15:10:50,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-11 15:10:50,186 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:50,186 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:10:50,186 INFO L408 AbstractCegarLoop]: === Iteration 81 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:50,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1246686047, now seen corresponding path program 35 times [2018-04-11 15:10:50,186 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:50,186 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:50,187 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:50,187 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:10:50,187 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:50,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:50,193 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:50,195 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:10:50,195 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:50,195 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:50,195 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:10:50,248 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-04-11 15:10:50,248 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:10:50,258 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:50,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:10:50,264 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:50,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:10:50,268 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:50,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:50,270 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:10:50,278 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:50,278 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:50,278 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:10:50,279 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:50,291 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:10:50,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:50,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:10:50,296 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:23 [2018-04-11 15:10:50,421 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:10:50,421 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:50,424 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:10:50,424 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:16 [2018-04-11 15:10:50,561 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:50,561 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:10:50,562 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 15:10:50,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 15:10:50,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 15:10:50,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=461, Unknown=0, NotChecked=0, Total=506 [2018-04-11 15:10:50,562 INFO L87 Difference]: Start difference. First operand 138 states and 149 transitions. Second operand 23 states. [2018-04-11 15:10:51,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:51,488 INFO L93 Difference]: Finished difference Result 394 states and 405 transitions. [2018-04-11 15:10:51,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 15:10:51,488 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 69 [2018-04-11 15:10:51,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:51,489 INFO L225 Difference]: With dead ends: 394 [2018-04-11 15:10:51,489 INFO L226 Difference]: Without dead ends: 394 [2018-04-11 15:10:51,489 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=139, Invalid=1583, Unknown=0, NotChecked=0, Total=1722 [2018-04-11 15:10:51,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-04-11 15:10:51,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 138. [2018-04-11 15:10:51,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-04-11 15:10:51,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 149 transitions. [2018-04-11 15:10:51,491 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 149 transitions. Word has length 69 [2018-04-11 15:10:51,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:51,491 INFO L459 AbstractCegarLoop]: Abstraction has 138 states and 149 transitions. [2018-04-11 15:10:51,491 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 15:10:51,491 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 149 transitions. [2018-04-11 15:10:51,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-11 15:10:51,491 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:51,491 INFO L355 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:10:51,491 INFO L408 AbstractCegarLoop]: === Iteration 82 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:51,491 INFO L82 PathProgramCache]: Analyzing trace with hash 939869098, now seen corresponding path program 36 times [2018-04-11 15:10:51,491 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:51,491 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:51,492 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:51,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:10:51,492 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:51,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:51,499 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:51,500 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:10:51,500 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:51,501 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:51,501 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:10:51,533 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-04-11 15:10:51,533 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:10:51,539 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:51,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:10:51,541 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:51,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:10:51,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:51,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:51,547 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:10:51,555 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:51,556 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:10:51,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:51,561 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:51,562 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:51,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:10:51,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:51,566 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:10:51,566 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:10:51,759 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:51,759 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:10:51,759 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-11 15:10:51,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 15:10:51,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 15:10:51,760 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2018-04-11 15:10:51,760 INFO L87 Difference]: Start difference. First operand 138 states and 149 transitions. Second operand 22 states. [2018-04-11 15:10:52,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:52,503 INFO L93 Difference]: Finished difference Result 405 states and 416 transitions. [2018-04-11 15:10:52,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 15:10:52,504 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 69 [2018-04-11 15:10:52,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:52,504 INFO L225 Difference]: With dead ends: 405 [2018-04-11 15:10:52,504 INFO L226 Difference]: Without dead ends: 405 [2018-04-11 15:10:52,505 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=1428, Unknown=0, NotChecked=0, Total=1560 [2018-04-11 15:10:52,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2018-04-11 15:10:52,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 138. [2018-04-11 15:10:52,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-04-11 15:10:52,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 149 transitions. [2018-04-11 15:10:52,506 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 149 transitions. Word has length 69 [2018-04-11 15:10:52,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:52,506 INFO L459 AbstractCegarLoop]: Abstraction has 138 states and 149 transitions. [2018-04-11 15:10:52,506 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 15:10:52,506 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 149 transitions. [2018-04-11 15:10:52,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-11 15:10:52,507 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:52,507 INFO L355 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:10:52,507 INFO L408 AbstractCegarLoop]: === Iteration 83 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:52,507 INFO L82 PathProgramCache]: Analyzing trace with hash 730862337, now seen corresponding path program 9 times [2018-04-11 15:10:52,507 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:52,507 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:52,507 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:52,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:10:52,507 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:52,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:52,515 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:52,534 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:10:52,534 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:52,534 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:52,534 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:10:52,596 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-04-11 15:10:52,596 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:10:52,606 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:52,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:10:52,609 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:52,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:10:52,613 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:52,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:52,616 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:10:52,634 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:52,635 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:10:52,635 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:52,649 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:52,650 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:52,650 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:10:52,650 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:52,654 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:10:52,654 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:10:52,821 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:52,821 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:10:52,821 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-11 15:10:52,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 15:10:52,821 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 15:10:52,821 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=380, Unknown=0, NotChecked=0, Total=420 [2018-04-11 15:10:52,821 INFO L87 Difference]: Start difference. First operand 138 states and 149 transitions. Second operand 21 states. [2018-04-11 15:10:53,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:53,499 INFO L93 Difference]: Finished difference Result 418 states and 430 transitions. [2018-04-11 15:10:53,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 15:10:53,500 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 69 [2018-04-11 15:10:53,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:53,500 INFO L225 Difference]: With dead ends: 418 [2018-04-11 15:10:53,501 INFO L226 Difference]: Without dead ends: 418 [2018-04-11 15:10:53,501 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=1288, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 15:10:53,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2018-04-11 15:10:53,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 139. [2018-04-11 15:10:53,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-04-11 15:10:53,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 151 transitions. [2018-04-11 15:10:53,502 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 151 transitions. Word has length 69 [2018-04-11 15:10:53,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:53,502 INFO L459 AbstractCegarLoop]: Abstraction has 139 states and 151 transitions. [2018-04-11 15:10:53,502 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 15:10:53,502 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 151 transitions. [2018-04-11 15:10:53,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-04-11 15:10:53,503 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:53,503 INFO L355 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:10:53,503 INFO L408 AbstractCegarLoop]: === Iteration 84 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:53,503 INFO L82 PathProgramCache]: Analyzing trace with hash 748751707, now seen corresponding path program 10 times [2018-04-11 15:10:53,503 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:53,503 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:53,503 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:53,503 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:10:53,503 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:53,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:53,510 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:53,512 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:10:53,512 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:53,513 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:53,513 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:10:53,550 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:10:53,550 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:10:53,557 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:53,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:10:53,564 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:53,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:10:53,569 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:53,574 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:53,574 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:10:53,586 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:53,587 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:10:53,587 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:53,594 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:53,594 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:53,595 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:10:53,595 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:53,599 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:10:53,599 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:10:53,743 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:53,743 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:10:53,743 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-04-11 15:10:53,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-04-11 15:10:53,744 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-04-11 15:10:53,744 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2018-04-11 15:10:53,744 INFO L87 Difference]: Start difference. First operand 139 states and 151 transitions. Second operand 19 states. [2018-04-11 15:10:54,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:54,275 INFO L93 Difference]: Finished difference Result 420 states and 433 transitions. [2018-04-11 15:10:54,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-04-11 15:10:54,276 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 69 [2018-04-11 15:10:54,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:54,277 INFO L225 Difference]: With dead ends: 420 [2018-04-11 15:10:54,277 INFO L226 Difference]: Without dead ends: 420 [2018-04-11 15:10:54,277 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=1022, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 15:10:54,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2018-04-11 15:10:54,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 143. [2018-04-11 15:10:54,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-04-11 15:10:54,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 155 transitions. [2018-04-11 15:10:54,278 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 155 transitions. Word has length 69 [2018-04-11 15:10:54,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:54,278 INFO L459 AbstractCegarLoop]: Abstraction has 143 states and 155 transitions. [2018-04-11 15:10:54,278 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-04-11 15:10:54,278 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 155 transitions. [2018-04-11 15:10:54,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-11 15:10:54,279 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:54,279 INFO L355 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:10:54,279 INFO L408 AbstractCegarLoop]: === Iteration 85 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:54,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1585690469, now seen corresponding path program 10 times [2018-04-11 15:10:54,279 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:54,279 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:54,279 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:54,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:10:54,279 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:54,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:54,285 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:54,321 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:10:54,321 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:54,321 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:54,321 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:10:54,332 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:10:54,332 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:10:54,335 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:54,337 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:10:54,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:54,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:54,339 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-11 15:10:54,351 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:10:54,351 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:10:54,357 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 2 xjuncts. [2018-04-11 15:10:54,357 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:36 [2018-04-11 15:10:55,194 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:55,194 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:10:55,194 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-04-11 15:10:55,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-11 15:10:55,195 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-11 15:10:55,195 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=1256, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 15:10:55,195 INFO L87 Difference]: Start difference. First operand 143 states and 155 transitions. Second operand 37 states. [2018-04-11 15:10:58,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:58,081 INFO L93 Difference]: Finished difference Result 204 states and 216 transitions. [2018-04-11 15:10:58,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-11 15:10:58,081 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 74 [2018-04-11 15:10:58,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:58,081 INFO L225 Difference]: With dead ends: 204 [2018-04-11 15:10:58,081 INFO L226 Difference]: Without dead ends: 204 [2018-04-11 15:10:58,082 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 747 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=277, Invalid=4553, Unknown=0, NotChecked=0, Total=4830 [2018-04-11 15:10:58,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-04-11 15:10:58,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 148. [2018-04-11 15:10:58,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-04-11 15:10:58,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 160 transitions. [2018-04-11 15:10:58,083 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 160 transitions. Word has length 74 [2018-04-11 15:10:58,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:58,083 INFO L459 AbstractCegarLoop]: Abstraction has 148 states and 160 transitions. [2018-04-11 15:10:58,083 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-11 15:10:58,083 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 160 transitions. [2018-04-11 15:10:58,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-11 15:10:58,083 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:58,083 INFO L355 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:10:58,083 INFO L408 AbstractCegarLoop]: === Iteration 86 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:58,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1755336669, now seen corresponding path program 4 times [2018-04-11 15:10:58,084 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:58,084 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:58,084 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:58,084 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:10:58,084 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:58,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:58,090 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:58,108 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:10:58,108 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:58,108 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:58,108 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:10:58,125 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:10:58,125 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:10:58,128 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:58,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:10:58,130 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:58,134 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:10:58,134 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:58,137 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:58,137 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:10:58,146 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:58,146 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:10:58,147 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:58,152 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:58,152 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:58,153 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:10:58,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:58,156 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:10:58,156 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:10:58,557 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:10:58,558 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:10:58,558 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-04-11 15:10:58,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-11 15:10:58,558 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-11 15:10:58,558 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=991, Unknown=0, NotChecked=0, Total=1056 [2018-04-11 15:10:58,558 INFO L87 Difference]: Start difference. First operand 148 states and 160 transitions. Second operand 33 states. [2018-04-11 15:10:59,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:10:59,547 INFO L93 Difference]: Finished difference Result 253 states and 265 transitions. [2018-04-11 15:10:59,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-11 15:10:59,547 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 74 [2018-04-11 15:10:59,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:10:59,547 INFO L225 Difference]: With dead ends: 253 [2018-04-11 15:10:59,548 INFO L226 Difference]: Without dead ends: 253 [2018-04-11 15:10:59,548 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=239, Invalid=3543, Unknown=0, NotChecked=0, Total=3782 [2018-04-11 15:10:59,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-04-11 15:10:59,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 148. [2018-04-11 15:10:59,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-04-11 15:10:59,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 160 transitions. [2018-04-11 15:10:59,549 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 160 transitions. Word has length 74 [2018-04-11 15:10:59,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:10:59,549 INFO L459 AbstractCegarLoop]: Abstraction has 148 states and 160 transitions. [2018-04-11 15:10:59,549 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-11 15:10:59,549 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 160 transitions. [2018-04-11 15:10:59,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-11 15:10:59,550 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:10:59,550 INFO L355 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:10:59,550 INFO L408 AbstractCegarLoop]: === Iteration 87 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:10:59,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1891999188, now seen corresponding path program 37 times [2018-04-11 15:10:59,550 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:10:59,550 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:10:59,550 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:59,550 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:10:59,550 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:10:59,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:59,556 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:10:59,601 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:10:59,601 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:10:59,601 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:10:59,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:10:59,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:10:59,623 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:10:59,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:10:59,625 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:59,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:10:59,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:59,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:59,634 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:10:59,651 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:59,651 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:10:59,652 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:10:59,652 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:59,659 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:10:59,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:10:59,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:10:59,664 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:11:00,454 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 0 proven. 221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:11:00,455 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:11:00,455 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-04-11 15:11:00,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-11 15:11:00,455 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-11 15:11:00,455 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=870, Unknown=0, NotChecked=0, Total=930 [2018-04-11 15:11:00,455 INFO L87 Difference]: Start difference. First operand 148 states and 160 transitions. Second operand 31 states. [2018-04-11 15:11:02,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:11:02,092 INFO L93 Difference]: Finished difference Result 249 states and 261 transitions. [2018-04-11 15:11:02,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-11 15:11:02,092 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 74 [2018-04-11 15:11:02,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:11:02,092 INFO L225 Difference]: With dead ends: 249 [2018-04-11 15:11:02,092 INFO L226 Difference]: Without dead ends: 249 [2018-04-11 15:11:02,093 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=218, Invalid=3088, Unknown=0, NotChecked=0, Total=3306 [2018-04-11 15:11:02,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-04-11 15:11:02,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 148. [2018-04-11 15:11:02,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-04-11 15:11:02,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 160 transitions. [2018-04-11 15:11:02,094 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 160 transitions. Word has length 74 [2018-04-11 15:11:02,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:11:02,094 INFO L459 AbstractCegarLoop]: Abstraction has 148 states and 160 transitions. [2018-04-11 15:11:02,094 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-11 15:11:02,094 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 160 transitions. [2018-04-11 15:11:02,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-11 15:11:02,095 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:11:02,095 INFO L355 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:11:02,095 INFO L408 AbstractCegarLoop]: === Iteration 88 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:11:02,095 INFO L82 PathProgramCache]: Analyzing trace with hash -34025853, now seen corresponding path program 38 times [2018-04-11 15:11:02,095 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:11:02,095 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:11:02,096 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:02,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:11:02,096 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:02,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:02,107 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:11:02,135 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:11:02,135 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:11:02,135 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:11:02,136 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:11:02,151 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:11:02,151 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:11:02,155 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:11:02,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:11:02,157 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:02,162 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:11:02,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:02,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:02,170 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:11:02,180 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:02,181 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:11:02,181 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:02,188 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:02,188 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:02,189 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:11:02,189 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:02,194 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:11:02,194 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:11:02,849 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:11:02,849 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:11:02,849 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-04-11 15:11:02,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-04-11 15:11:02,849 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-04-11 15:11:02,850 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=812, Unknown=0, NotChecked=0, Total=870 [2018-04-11 15:11:02,850 INFO L87 Difference]: Start difference. First operand 148 states and 160 transitions. Second operand 30 states. [2018-04-11 15:11:04,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:11:04,227 INFO L93 Difference]: Finished difference Result 294 states and 306 transitions. [2018-04-11 15:11:04,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-11 15:11:04,228 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 74 [2018-04-11 15:11:04,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:11:04,228 INFO L225 Difference]: With dead ends: 294 [2018-04-11 15:11:04,228 INFO L226 Difference]: Without dead ends: 294 [2018-04-11 15:11:04,229 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=208, Invalid=2872, Unknown=0, NotChecked=0, Total=3080 [2018-04-11 15:11:04,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-04-11 15:11:04,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 148. [2018-04-11 15:11:04,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-04-11 15:11:04,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 160 transitions. [2018-04-11 15:11:04,230 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 160 transitions. Word has length 74 [2018-04-11 15:11:04,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:11:04,230 INFO L459 AbstractCegarLoop]: Abstraction has 148 states and 160 transitions. [2018-04-11 15:11:04,230 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-04-11 15:11:04,230 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 160 transitions. [2018-04-11 15:11:04,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-11 15:11:04,231 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:11:04,231 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:11:04,231 INFO L408 AbstractCegarLoop]: === Iteration 89 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:11:04,231 INFO L82 PathProgramCache]: Analyzing trace with hash 775931852, now seen corresponding path program 39 times [2018-04-11 15:11:04,231 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:11:04,231 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:11:04,231 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:04,231 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:11:04,231 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:04,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:04,238 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:11:04,286 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:11:04,286 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:11:04,287 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:11:04,287 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:11:04,315 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-04-11 15:11:04,315 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:11:04,319 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:11:04,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:11:04,321 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:04,336 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:11:04,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:04,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:04,339 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:11:04,349 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:04,350 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:11:04,350 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:04,358 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:04,358 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:04,359 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:11:04,359 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:04,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:11:04,365 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:23 [2018-04-11 15:11:04,550 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:11:04,550 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:04,552 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:11:04,553 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:11 [2018-04-11 15:11:04,908 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 163 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:11:04,908 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:11:04,908 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-04-11 15:11:04,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-04-11 15:11:04,908 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-04-11 15:11:04,908 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=928, Unknown=0, NotChecked=0, Total=992 [2018-04-11 15:11:04,909 INFO L87 Difference]: Start difference. First operand 148 states and 160 transitions. Second operand 32 states. [2018-04-11 15:11:06,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:11:06,628 INFO L93 Difference]: Finished difference Result 334 states and 346 transitions. [2018-04-11 15:11:06,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-11 15:11:06,628 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 74 [2018-04-11 15:11:06,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:11:06,629 INFO L225 Difference]: With dead ends: 334 [2018-04-11 15:11:06,629 INFO L226 Difference]: Without dead ends: 334 [2018-04-11 15:11:06,629 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=240, Invalid=3542, Unknown=0, NotChecked=0, Total=3782 [2018-04-11 15:11:06,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-04-11 15:11:06,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 148. [2018-04-11 15:11:06,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-04-11 15:11:06,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 160 transitions. [2018-04-11 15:11:06,631 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 160 transitions. Word has length 74 [2018-04-11 15:11:06,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:11:06,631 INFO L459 AbstractCegarLoop]: Abstraction has 148 states and 160 transitions. [2018-04-11 15:11:06,631 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-04-11 15:11:06,631 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 160 transitions. [2018-04-11 15:11:06,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-11 15:11:06,631 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:11:06,631 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:11:06,631 INFO L408 AbstractCegarLoop]: === Iteration 90 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:11:06,631 INFO L82 PathProgramCache]: Analyzing trace with hash 693265635, now seen corresponding path program 40 times [2018-04-11 15:11:06,631 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:11:06,631 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:11:06,632 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:06,632 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:11:06,632 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:06,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:06,638 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:11:06,640 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:11:06,640 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:11:06,640 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:11:06,641 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:11:06,667 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:11:06,667 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:11:06,672 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:11:06,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:11:06,674 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:06,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:11:06,677 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:06,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:06,680 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:11:06,689 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:06,689 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:11:06,689 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:06,695 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:06,696 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:06,696 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:11:06,696 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:06,699 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:11:06,699 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:11:07,153 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 149 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:11:07,153 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:11:07,153 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-11 15:11:07,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-11 15:11:07,153 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-11 15:11:07,153 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2018-04-11 15:11:07,154 INFO L87 Difference]: Start difference. First operand 148 states and 160 transitions. Second operand 28 states. [2018-04-11 15:11:08,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:11:08,358 INFO L93 Difference]: Finished difference Result 369 states and 381 transitions. [2018-04-11 15:11:08,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-11 15:11:08,359 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 74 [2018-04-11 15:11:08,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:11:08,359 INFO L225 Difference]: With dead ends: 369 [2018-04-11 15:11:08,359 INFO L226 Difference]: Without dead ends: 369 [2018-04-11 15:11:08,359 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=184, Invalid=2468, Unknown=0, NotChecked=0, Total=2652 [2018-04-11 15:11:08,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-04-11 15:11:08,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 148. [2018-04-11 15:11:08,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-04-11 15:11:08,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 160 transitions. [2018-04-11 15:11:08,361 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 160 transitions. Word has length 74 [2018-04-11 15:11:08,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:11:08,361 INFO L459 AbstractCegarLoop]: Abstraction has 148 states and 160 transitions. [2018-04-11 15:11:08,361 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-11 15:11:08,361 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 160 transitions. [2018-04-11 15:11:08,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-11 15:11:08,362 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:11:08,362 INFO L355 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 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:11:08,362 INFO L408 AbstractCegarLoop]: === Iteration 91 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:11:08,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1072056980, now seen corresponding path program 41 times [2018-04-11 15:11:08,362 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:11:08,362 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:11:08,363 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:08,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:11:08,363 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:08,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:08,373 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:11:08,376 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:11:08,376 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:11:08,376 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:11:08,376 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:11:08,419 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-04-11 15:11:08,420 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:11:08,424 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:11:08,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:11:08,428 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:08,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:11:08,433 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:08,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:08,437 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:11:08,447 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:08,448 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:11:08,448 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:08,455 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:08,456 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:08,456 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:11:08,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:08,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:11:08,464 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:23 [2018-04-11 15:11:08,675 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:11:08,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:08,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:11:08,685 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:16 [2018-04-11 15:11:08,923 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:11:08,923 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:11:08,923 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-04-11 15:11:08,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-11 15:11:08,923 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-11 15:11:08,923 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=754, Unknown=0, NotChecked=0, Total=812 [2018-04-11 15:11:08,923 INFO L87 Difference]: Start difference. First operand 148 states and 160 transitions. Second operand 29 states. [2018-04-11 15:11:10,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:11:10,627 INFO L93 Difference]: Finished difference Result 399 states and 411 transitions. [2018-04-11 15:11:10,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-04-11 15:11:10,627 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 74 [2018-04-11 15:11:10,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:11:10,627 INFO L225 Difference]: With dead ends: 399 [2018-04-11 15:11:10,628 INFO L226 Difference]: Without dead ends: 399 [2018-04-11 15:11:10,628 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=203, Invalid=2767, Unknown=0, NotChecked=0, Total=2970 [2018-04-11 15:11:10,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-04-11 15:11:10,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 148. [2018-04-11 15:11:10,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-04-11 15:11:10,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 160 transitions. [2018-04-11 15:11:10,629 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 160 transitions. Word has length 74 [2018-04-11 15:11:10,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:11:10,629 INFO L459 AbstractCegarLoop]: Abstraction has 148 states and 160 transitions. [2018-04-11 15:11:10,629 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-11 15:11:10,629 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 160 transitions. [2018-04-11 15:11:10,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-11 15:11:10,630 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:11:10,630 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:11:10,630 INFO L408 AbstractCegarLoop]: === Iteration 92 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:11:10,630 INFO L82 PathProgramCache]: Analyzing trace with hash -2128448701, now seen corresponding path program 42 times [2018-04-11 15:11:10,630 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:11:10,630 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:11:10,630 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:10,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:11:10,630 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:10,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:10,637 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:11:10,639 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:11:10,640 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:11:10,640 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:11:10,640 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:11:10,682 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-04-11 15:11:10,682 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:11:10,687 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:11:10,711 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:11:10,711 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:10,714 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:11:10,714 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:10,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:10,717 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:11:10,725 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:10,726 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:10,726 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:11:10,726 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:10,732 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:11:10,732 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:10,735 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:11:10,735 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:11:10,973 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:11:10,973 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:11:10,973 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-11 15:11:10,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-11 15:11:10,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-11 15:11:10,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=600, Unknown=0, NotChecked=0, Total=650 [2018-04-11 15:11:10,973 INFO L87 Difference]: Start difference. First operand 148 states and 160 transitions. Second operand 26 states. [2018-04-11 15:11:11,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:11:11,805 INFO L93 Difference]: Finished difference Result 424 states and 436 transitions. [2018-04-11 15:11:11,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 15:11:11,811 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 74 [2018-04-11 15:11:11,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:11:11,812 INFO L225 Difference]: With dead ends: 424 [2018-04-11 15:11:11,812 INFO L226 Difference]: Without dead ends: 424 [2018-04-11 15:11:11,813 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=168, Invalid=2088, Unknown=0, NotChecked=0, Total=2256 [2018-04-11 15:11:11,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2018-04-11 15:11:11,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 148. [2018-04-11 15:11:11,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-04-11 15:11:11,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 160 transitions. [2018-04-11 15:11:11,815 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 160 transitions. Word has length 74 [2018-04-11 15:11:11,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:11:11,815 INFO L459 AbstractCegarLoop]: Abstraction has 148 states and 160 transitions. [2018-04-11 15:11:11,815 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-11 15:11:11,815 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 160 transitions. [2018-04-11 15:11:11,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-11 15:11:11,815 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:11:11,815 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:11:11,815 INFO L408 AbstractCegarLoop]: === Iteration 93 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:11:11,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1666329356, now seen corresponding path program 43 times [2018-04-11 15:11:11,815 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:11:11,815 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:11:11,816 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:11,816 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:11:11,816 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:11,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:11,824 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:11:11,826 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:11:11,826 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:11:11,826 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:11:11,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:11:11,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:11,852 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:11:11,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:11:11,854 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:11,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:11:11,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:11,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:11,861 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:11:11,871 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:11,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:11:11,872 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:11,878 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:11,879 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:11,879 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:11:11,879 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:11,883 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:11:11,883 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:11:12,142 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 0 proven. 167 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:11:12,142 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:11:12,142 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-11 15:11:12,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 15:11:12,142 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 15:11:12,142 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=552, Unknown=0, NotChecked=0, Total=600 [2018-04-11 15:11:12,142 INFO L87 Difference]: Start difference. First operand 148 states and 160 transitions. Second operand 25 states. [2018-04-11 15:11:13,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:11:13,090 INFO L93 Difference]: Finished difference Result 444 states and 456 transitions. [2018-04-11 15:11:13,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 15:11:13,090 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 74 [2018-04-11 15:11:13,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:11:13,091 INFO L225 Difference]: With dead ends: 444 [2018-04-11 15:11:13,091 INFO L226 Difference]: Without dead ends: 444 [2018-04-11 15:11:13,091 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=158, Invalid=1912, Unknown=0, NotChecked=0, Total=2070 [2018-04-11 15:11:13,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2018-04-11 15:11:13,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 148. [2018-04-11 15:11:13,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-04-11 15:11:13,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 160 transitions. [2018-04-11 15:11:13,092 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 160 transitions. Word has length 74 [2018-04-11 15:11:13,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:11:13,093 INFO L459 AbstractCegarLoop]: Abstraction has 148 states and 160 transitions. [2018-04-11 15:11:13,093 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 15:11:13,093 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 160 transitions. [2018-04-11 15:11:13,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-11 15:11:13,093 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:11:13,093 INFO L355 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:11:13,093 INFO L408 AbstractCegarLoop]: === Iteration 94 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:11:13,093 INFO L82 PathProgramCache]: Analyzing trace with hash 2023684515, now seen corresponding path program 44 times [2018-04-11 15:11:13,093 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:11:13,093 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:11:13,094 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:13,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:11:13,094 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:13,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:13,101 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:11:13,102 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:11:13,102 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:11:13,102 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:11:13,103 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:11:13,119 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:11:13,120 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:11:13,124 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:11:13,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:11:13,126 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:13,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:11:13,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:13,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:13,139 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:11:13,147 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:13,148 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:11:13,148 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:13,153 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:13,153 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:13,153 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:11:13,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:13,156 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:11:13,156 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:11:13,389 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 193 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:11:13,389 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:11:13,389 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-11 15:11:13,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 15:11:13,389 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 15:11:13,390 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552 [2018-04-11 15:11:13,390 INFO L87 Difference]: Start difference. First operand 148 states and 160 transitions. Second operand 24 states. [2018-04-11 15:11:14,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:11:14,281 INFO L93 Difference]: Finished difference Result 459 states and 471 transitions. [2018-04-11 15:11:14,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 15:11:14,281 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 74 [2018-04-11 15:11:14,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:11:14,282 INFO L225 Difference]: With dead ends: 459 [2018-04-11 15:11:14,282 INFO L226 Difference]: Without dead ends: 459 [2018-04-11 15:11:14,282 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=148, Invalid=1744, Unknown=0, NotChecked=0, Total=1892 [2018-04-11 15:11:14,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-04-11 15:11:14,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 148. [2018-04-11 15:11:14,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-04-11 15:11:14,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 160 transitions. [2018-04-11 15:11:14,283 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 160 transitions. Word has length 74 [2018-04-11 15:11:14,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:11:14,283 INFO L459 AbstractCegarLoop]: Abstraction has 148 states and 160 transitions. [2018-04-11 15:11:14,283 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 15:11:14,284 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 160 transitions. [2018-04-11 15:11:14,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-11 15:11:14,284 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:11:14,284 INFO L355 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:11:14,284 INFO L408 AbstractCegarLoop]: === Iteration 95 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:11:14,284 INFO L82 PathProgramCache]: Analyzing trace with hash -84727636, now seen corresponding path program 45 times [2018-04-11 15:11:14,284 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:11:14,285 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:11:14,285 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:14,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:11:14,285 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:14,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:14,297 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:11:14,300 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:11:14,300 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:11:14,300 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:11:14,301 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:11:14,342 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-04-11 15:11:14,342 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:11:14,348 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:11:14,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:11:14,350 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:14,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:11:14,353 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:14,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:14,356 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:11:14,364 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:14,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:11:14,365 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:14,370 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:14,371 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:14,371 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:11:14,371 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:14,375 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:11:14,375 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:11:14,579 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 0 proven. 229 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:11:14,580 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:11:14,580 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-04-11 15:11:14,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-04-11 15:11:14,580 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-04-11 15:11:14,580 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=462, Unknown=0, NotChecked=0, Total=506 [2018-04-11 15:11:14,580 INFO L87 Difference]: Start difference. First operand 148 states and 160 transitions. Second operand 23 states. [2018-04-11 15:11:15,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:11:15,442 INFO L93 Difference]: Finished difference Result 470 states and 482 transitions. [2018-04-11 15:11:15,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-04-11 15:11:15,442 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 74 [2018-04-11 15:11:15,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:11:15,443 INFO L225 Difference]: With dead ends: 470 [2018-04-11 15:11:15,443 INFO L226 Difference]: Without dead ends: 470 [2018-04-11 15:11:15,443 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=1584, Unknown=0, NotChecked=0, Total=1722 [2018-04-11 15:11:15,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-04-11 15:11:15,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 148. [2018-04-11 15:11:15,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-04-11 15:11:15,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 160 transitions. [2018-04-11 15:11:15,445 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 160 transitions. Word has length 74 [2018-04-11 15:11:15,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:11:15,445 INFO L459 AbstractCegarLoop]: Abstraction has 148 states and 160 transitions. [2018-04-11 15:11:15,445 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-04-11 15:11:15,445 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 160 transitions. [2018-04-11 15:11:15,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-11 15:11:15,445 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:11:15,445 INFO L355 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:11:15,445 INFO L408 AbstractCegarLoop]: === Iteration 96 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:11:15,446 INFO L82 PathProgramCache]: Analyzing trace with hash -293734397, now seen corresponding path program 10 times [2018-04-11 15:11:15,446 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:11:15,446 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:11:15,446 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:15,446 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:11:15,446 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:15,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:15,455 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:11:15,480 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:11:15,480 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:11:15,480 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:11:15,480 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:11:15,504 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:11:15,504 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:11:15,509 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:11:15,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:11:15,511 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:15,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:11:15,514 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:15,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:15,517 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:11:15,524 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:15,525 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:11:15,525 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:15,531 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:15,531 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:15,531 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:11:15,532 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:15,535 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:11:15,535 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:11:15,714 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:11:15,714 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:11:15,714 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-11 15:11:15,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 15:11:15,715 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 15:11:15,715 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2018-04-11 15:11:15,715 INFO L87 Difference]: Start difference. First operand 148 states and 160 transitions. Second operand 22 states. [2018-04-11 15:11:16,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:11:16,479 INFO L93 Difference]: Finished difference Result 483 states and 496 transitions. [2018-04-11 15:11:16,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 15:11:16,479 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 74 [2018-04-11 15:11:16,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:11:16,480 INFO L225 Difference]: With dead ends: 483 [2018-04-11 15:11:16,480 INFO L226 Difference]: Without dead ends: 483 [2018-04-11 15:11:16,480 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=1436, Unknown=0, NotChecked=0, Total=1560 [2018-04-11 15:11:16,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-04-11 15:11:16,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 149. [2018-04-11 15:11:16,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-04-11 15:11:16,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 162 transitions. [2018-04-11 15:11:16,482 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 162 transitions. Word has length 74 [2018-04-11 15:11:16,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:11:16,482 INFO L459 AbstractCegarLoop]: Abstraction has 149 states and 162 transitions. [2018-04-11 15:11:16,482 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 15:11:16,482 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 162 transitions. [2018-04-11 15:11:16,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-04-11 15:11:16,483 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:11:16,483 INFO L355 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:11:16,483 INFO L408 AbstractCegarLoop]: === Iteration 97 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:11:16,483 INFO L82 PathProgramCache]: Analyzing trace with hash -275845027, now seen corresponding path program 11 times [2018-04-11 15:11:16,483 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:11:16,483 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:11:16,483 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:16,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:11:16,483 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:16,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:16,491 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:11:16,493 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:11:16,493 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:11:16,493 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:11:16,493 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:11:16,534 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-04-11 15:11:16,534 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:11:16,539 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:11:16,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:11:16,541 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:16,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:11:16,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:16,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:16,546 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:11:16,561 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:16,561 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:16,561 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:11:16,562 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:16,567 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:11:16,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:16,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:11:16,572 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:23 [2018-04-11 15:11:16,637 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:11:16,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:16,640 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:11:16,640 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:11 [2018-04-11 15:11:16,751 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:11:16,751 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:11:16,751 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-04-11 15:11:16,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-04-11 15:11:16,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-04-11 15:11:16,752 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2018-04-11 15:11:16,752 INFO L87 Difference]: Start difference. First operand 149 states and 162 transitions. Second operand 20 states. [2018-04-11 15:11:17,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:11:17,404 INFO L93 Difference]: Finished difference Result 485 states and 499 transitions. [2018-04-11 15:11:17,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-04-11 15:11:17,404 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 74 [2018-04-11 15:11:17,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:11:17,405 INFO L225 Difference]: With dead ends: 485 [2018-04-11 15:11:17,405 INFO L226 Difference]: Without dead ends: 485 [2018-04-11 15:11:17,405 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=1153, Unknown=0, NotChecked=0, Total=1260 [2018-04-11 15:11:17,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-04-11 15:11:17,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 153. [2018-04-11 15:11:17,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-04-11 15:11:17,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 166 transitions. [2018-04-11 15:11:17,407 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 166 transitions. Word has length 74 [2018-04-11 15:11:17,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:11:17,407 INFO L459 AbstractCegarLoop]: Abstraction has 153 states and 166 transitions. [2018-04-11 15:11:17,407 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-04-11 15:11:17,407 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 166 transitions. [2018-04-11 15:11:17,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-04-11 15:11:17,407 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:11:17,407 INFO L355 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 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:11:17,407 INFO L408 AbstractCegarLoop]: === Iteration 98 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:11:17,407 INFO L82 PathProgramCache]: Analyzing trace with hash 759866056, now seen corresponding path program 11 times [2018-04-11 15:11:17,407 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:11:17,408 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:11:17,408 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:17,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:11:17,408 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:17,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:17,413 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:11:17,428 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:11:17,428 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:11:17,428 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:11:17,429 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:11:17,447 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-04-11 15:11:17,447 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:11:17,450 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:11:17,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:11:17,452 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:17,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:11:17,464 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:17,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:17,467 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:11:17,478 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:17,478 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:17,479 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:11:17,479 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:17,497 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:11:17,497 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:17,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:11:17,502 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:23 [2018-04-11 15:11:17,680 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:11:17,681 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:17,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:17,683 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:11 [2018-04-11 15:11:18,047 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:11:18,047 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:11:18,047 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-04-11 15:11:18,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-11 15:11:18,048 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-11 15:11:18,048 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=1188, Unknown=0, NotChecked=0, Total=1260 [2018-04-11 15:11:18,048 INFO L87 Difference]: Start difference. First operand 153 states and 166 transitions. Second operand 36 states. [2018-04-11 15:11:19,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:11:19,792 INFO L93 Difference]: Finished difference Result 214 states and 227 transitions. [2018-04-11 15:11:19,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-11 15:11:19,792 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 79 [2018-04-11 15:11:19,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:11:19,793 INFO L225 Difference]: With dead ends: 214 [2018-04-11 15:11:19,793 INFO L226 Difference]: Without dead ends: 214 [2018-04-11 15:11:19,793 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=269, Invalid=4423, Unknown=0, NotChecked=0, Total=4692 [2018-04-11 15:11:19,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-04-11 15:11:19,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 158. [2018-04-11 15:11:19,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-04-11 15:11:19,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 171 transitions. [2018-04-11 15:11:19,794 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 171 transitions. Word has length 79 [2018-04-11 15:11:19,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:11:19,794 INFO L459 AbstractCegarLoop]: Abstraction has 158 states and 171 transitions. [2018-04-11 15:11:19,794 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-11 15:11:19,794 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 171 transitions. [2018-04-11 15:11:19,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-04-11 15:11:19,794 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:11:19,795 INFO L355 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:11:19,795 INFO L408 AbstractCegarLoop]: === Iteration 99 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:11:19,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1774361697, now seen corresponding path program 46 times [2018-04-11 15:11:19,795 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:11:19,795 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:11:19,795 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:19,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:11:19,795 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:19,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:19,801 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:11:19,819 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:11:19,819 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:11:19,819 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:11:19,819 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:11:19,832 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:11:19,832 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:11:19,835 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:11:19,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:11:19,837 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:19,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:11:19,841 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:19,844 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:19,844 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:11:19,851 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:19,852 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:11:19,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:19,858 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:19,858 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:19,858 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:11:19,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:19,861 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:11:19,861 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:11:20,323 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:11:20,323 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:11:20,323 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-04-11 15:11:20,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-04-11 15:11:20,324 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-04-11 15:11:20,324 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1121, Unknown=0, NotChecked=0, Total=1190 [2018-04-11 15:11:20,324 INFO L87 Difference]: Start difference. First operand 158 states and 171 transitions. Second operand 35 states. [2018-04-11 15:11:21,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:11:21,561 INFO L93 Difference]: Finished difference Result 269 states and 282 transitions. [2018-04-11 15:11:21,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-11 15:11:21,561 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 79 [2018-04-11 15:11:21,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:11:21,562 INFO L225 Difference]: With dead ends: 269 [2018-04-11 15:11:21,562 INFO L226 Difference]: Without dead ends: 269 [2018-04-11 15:11:21,562 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=258, Invalid=4164, Unknown=0, NotChecked=0, Total=4422 [2018-04-11 15:11:21,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-04-11 15:11:21,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 158. [2018-04-11 15:11:21,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-04-11 15:11:21,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 171 transitions. [2018-04-11 15:11:21,563 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 171 transitions. Word has length 79 [2018-04-11 15:11:21,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:11:21,563 INFO L459 AbstractCegarLoop]: Abstraction has 158 states and 171 transitions. [2018-04-11 15:11:21,563 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-04-11 15:11:21,563 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 171 transitions. [2018-04-11 15:11:21,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-04-11 15:11:21,564 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:11:21,564 INFO L355 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:11:21,564 INFO L408 AbstractCegarLoop]: === Iteration 100 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:11:21,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1637699178, now seen corresponding path program 47 times [2018-04-11 15:11:21,564 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:11:21,564 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:11:21,564 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:21,565 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:11:21,565 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:21,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:21,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:11:21,595 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:11:21,595 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:11:21,595 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:11:21,595 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:11:21,619 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-04-11 15:11:21,619 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:11:21,622 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:11:21,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:11:21,624 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:21,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:11:21,627 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:21,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:21,630 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:11:21,638 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:21,638 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:11:21,639 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:21,645 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:21,646 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:21,646 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:11:21,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:21,652 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:11:21,652 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:23 [2018-04-11 15:11:22,359 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:11:22,359 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:22,369 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:11:22,369 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:58 [2018-04-11 15:11:22,524 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:11:22,524 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:11:22,524 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-04-11 15:11:22,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-11 15:11:22,524 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-11 15:11:22,525 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1185, Unknown=0, NotChecked=0, Total=1260 [2018-04-11 15:11:22,525 INFO L87 Difference]: Start difference. First operand 158 states and 171 transitions. Second operand 36 states. [2018-04-11 15:11:24,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:11:24,911 INFO L93 Difference]: Finished difference Result 319 states and 332 transitions. [2018-04-11 15:11:24,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-11 15:11:24,911 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 79 [2018-04-11 15:11:24,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:11:24,912 INFO L225 Difference]: With dead ends: 319 [2018-04-11 15:11:24,912 INFO L226 Difference]: Without dead ends: 319 [2018-04-11 15:11:24,912 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 638 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=265, Invalid=4291, Unknown=0, NotChecked=0, Total=4556 [2018-04-11 15:11:24,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-04-11 15:11:24,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 158. [2018-04-11 15:11:24,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-04-11 15:11:24,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 171 transitions. [2018-04-11 15:11:24,914 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 171 transitions. Word has length 79 [2018-04-11 15:11:24,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:11:24,914 INFO L459 AbstractCegarLoop]: Abstraction has 158 states and 171 transitions. [2018-04-11 15:11:24,914 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-11 15:11:24,914 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 171 transitions. [2018-04-11 15:11:24,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-04-11 15:11:24,914 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:11:24,914 INFO L355 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:11:24,914 INFO L408 AbstractCegarLoop]: === Iteration 101 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:11:24,914 INFO L82 PathProgramCache]: Analyzing trace with hash -799294783, now seen corresponding path program 48 times [2018-04-11 15:11:24,914 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:11:24,914 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:11:24,915 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:24,915 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:11:24,915 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:24,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:24,921 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:11:24,932 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:11:24,932 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:11:24,932 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:11:24,933 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:11:24,960 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-04-11 15:11:24,960 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:11:24,965 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:11:24,967 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:11:24,967 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:24,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:11:24,971 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:24,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:24,973 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:11:24,981 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:24,982 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:24,982 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:11:24,982 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:24,987 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:11:24,987 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:24,990 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:11:24,990 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:11:25,049 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 7 treesize of output 5 [2018-04-11 15:11:25,050 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:11:25,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:25,050 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:25,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-04-11 15:11:25,054 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:21 [2018-04-11 15:11:25,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2018-04-11 15:11:25,130 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:25,132 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:11:25,132 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2018-04-11 15:11:25,414 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 0 proven. 202 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:11:25,414 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:11:25,414 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-04-11 15:11:25,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-11 15:11:25,415 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-11 15:11:25,415 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=989, Unknown=0, NotChecked=0, Total=1056 [2018-04-11 15:11:25,415 INFO L87 Difference]: Start difference. First operand 158 states and 171 transitions. Second operand 33 states. [2018-04-11 15:11:26,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:11:26,674 INFO L93 Difference]: Finished difference Result 364 states and 377 transitions. [2018-04-11 15:11:26,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-11 15:11:26,674 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 79 [2018-04-11 15:11:26,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:11:26,675 INFO L225 Difference]: With dead ends: 364 [2018-04-11 15:11:26,675 INFO L226 Difference]: Without dead ends: 364 [2018-04-11 15:11:26,675 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=230, Invalid=3430, Unknown=0, NotChecked=0, Total=3660 [2018-04-11 15:11:26,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-04-11 15:11:26,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 158. [2018-04-11 15:11:26,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-04-11 15:11:26,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 171 transitions. [2018-04-11 15:11:26,677 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 171 transitions. Word has length 79 [2018-04-11 15:11:26,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:11:26,677 INFO L459 AbstractCegarLoop]: Abstraction has 158 states and 171 transitions. [2018-04-11 15:11:26,677 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-11 15:11:26,677 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 171 transitions. [2018-04-11 15:11:26,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-04-11 15:11:26,677 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:11:26,677 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:11:26,677 INFO L408 AbstractCegarLoop]: === Iteration 102 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:11:26,677 INFO L82 PathProgramCache]: Analyzing trace with hash 10662922, now seen corresponding path program 49 times [2018-04-11 15:11:26,677 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:11:26,677 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:11:26,678 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:26,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:11:26,678 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:26,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:26,685 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:11:26,686 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:11:26,686 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:11:26,687 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:11:26,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:11:26,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:26,713 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:11:26,716 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:11:26,716 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:26,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:11:26,721 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:26,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:26,724 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:11:26,733 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:26,733 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:11:26,734 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:26,739 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:26,739 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:26,739 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:11:26,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:26,742 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:11:26,742 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:11:27,131 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 183 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:11:27,131 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:11:27,131 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-04-11 15:11:27,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-11 15:11:27,132 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-11 15:11:27,132 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=870, Unknown=0, NotChecked=0, Total=930 [2018-04-11 15:11:27,132 INFO L87 Difference]: Start difference. First operand 158 states and 171 transitions. Second operand 31 states. [2018-04-11 15:11:28,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:11:28,378 INFO L93 Difference]: Finished difference Result 404 states and 417 transitions. [2018-04-11 15:11:28,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-11 15:11:28,379 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 79 [2018-04-11 15:11:28,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:11:28,380 INFO L225 Difference]: With dead ends: 404 [2018-04-11 15:11:28,380 INFO L226 Difference]: Without dead ends: 404 [2018-04-11 15:11:28,380 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=221, Invalid=3201, Unknown=0, NotChecked=0, Total=3422 [2018-04-11 15:11:28,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2018-04-11 15:11:28,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 158. [2018-04-11 15:11:28,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-04-11 15:11:28,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 171 transitions. [2018-04-11 15:11:28,383 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 171 transitions. Word has length 79 [2018-04-11 15:11:28,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:11:28,383 INFO L459 AbstractCegarLoop]: Abstraction has 158 states and 171 transitions. [2018-04-11 15:11:28,383 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-11 15:11:28,383 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 171 transitions. [2018-04-11 15:11:28,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-04-11 15:11:28,384 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:11:28,384 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:11:28,384 INFO L408 AbstractCegarLoop]: === Iteration 103 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:11:28,384 INFO L82 PathProgramCache]: Analyzing trace with hash -72003295, now seen corresponding path program 50 times [2018-04-11 15:11:28,384 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:11:28,384 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:11:28,385 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:28,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:11:28,385 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:28,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:28,393 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:11:28,396 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:11:28,396 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:11:28,396 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:11:28,396 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:11:28,418 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:11:28,418 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:11:28,422 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:11:28,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:11:28,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:28,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:11:28,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:28,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:28,434 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:11:28,442 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:28,443 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:28,443 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:11:28,443 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:28,447 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:11:28,447 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:28,451 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:11:28,451 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:11:28,946 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:11:28,947 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:11:28,947 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-04-11 15:11:28,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-11 15:11:28,947 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-11 15:11:28,947 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=756, Unknown=0, NotChecked=0, Total=812 [2018-04-11 15:11:28,947 INFO L87 Difference]: Start difference. First operand 158 states and 171 transitions. Second operand 29 states. [2018-04-11 15:11:30,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:11:30,389 INFO L93 Difference]: Finished difference Result 439 states and 452 transitions. [2018-04-11 15:11:30,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-04-11 15:11:30,389 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 79 [2018-04-11 15:11:30,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:11:30,390 INFO L225 Difference]: With dead ends: 439 [2018-04-11 15:11:30,390 INFO L226 Difference]: Without dead ends: 439 [2018-04-11 15:11:30,390 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=194, Invalid=2668, Unknown=0, NotChecked=0, Total=2862 [2018-04-11 15:11:30,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2018-04-11 15:11:30,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 158. [2018-04-11 15:11:30,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-04-11 15:11:30,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 171 transitions. [2018-04-11 15:11:30,391 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 171 transitions. Word has length 79 [2018-04-11 15:11:30,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:11:30,392 INFO L459 AbstractCegarLoop]: Abstraction has 158 states and 171 transitions. [2018-04-11 15:11:30,392 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-11 15:11:30,392 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 171 transitions. [2018-04-11 15:11:30,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-04-11 15:11:30,392 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:11:30,392 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:11:30,392 INFO L408 AbstractCegarLoop]: === Iteration 104 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:11:30,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1837325910, now seen corresponding path program 51 times [2018-04-11 15:11:30,392 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:11:30,392 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:11:30,393 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:30,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:11:30,393 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:30,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:30,400 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:11:30,402 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:11:30,402 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:11:30,402 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:11:30,402 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:11:30,460 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-04-11 15:11:30,460 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:11:30,468 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:11:30,470 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:11:30,470 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:30,482 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:11:30,482 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:30,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:30,485 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:11:30,495 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:30,495 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:30,496 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:11:30,496 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:30,501 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:11:30,501 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:30,505 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:11:30,505 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:11:30,827 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:11:30,828 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:11:30,828 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-11 15:11:30,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-11 15:11:30,828 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-11 15:11:30,828 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2018-04-11 15:11:30,828 INFO L87 Difference]: Start difference. First operand 158 states and 171 transitions. Second operand 28 states. [2018-04-11 15:11:31,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:11:31,843 INFO L93 Difference]: Finished difference Result 469 states and 482 transitions. [2018-04-11 15:11:31,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-11 15:11:31,843 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 79 [2018-04-11 15:11:31,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:11:31,844 INFO L225 Difference]: With dead ends: 469 [2018-04-11 15:11:31,844 INFO L226 Difference]: Without dead ends: 469 [2018-04-11 15:11:31,844 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=184, Invalid=2468, Unknown=0, NotChecked=0, Total=2652 [2018-04-11 15:11:31,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2018-04-11 15:11:31,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 158. [2018-04-11 15:11:31,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-04-11 15:11:31,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 171 transitions. [2018-04-11 15:11:31,845 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 171 transitions. Word has length 79 [2018-04-11 15:11:31,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:11:31,846 INFO L459 AbstractCegarLoop]: Abstraction has 158 states and 171 transitions. [2018-04-11 15:11:31,846 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-11 15:11:31,846 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 171 transitions. [2018-04-11 15:11:31,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-04-11 15:11:31,846 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:11:31,846 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:11:31,846 INFO L408 AbstractCegarLoop]: === Iteration 105 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:11:31,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1401249665, now seen corresponding path program 52 times [2018-04-11 15:11:31,846 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:11:31,846 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:11:31,846 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:31,847 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:11:31,847 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:31,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:31,854 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:11:31,855 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:11:31,855 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:11:31,856 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:11:31,856 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:11:31,875 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:11:31,876 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:11:31,879 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:11:31,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:11:31,881 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:31,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:11:31,884 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:31,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:31,886 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:11:31,894 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:31,903 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:31,903 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:11:31,903 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:31,908 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:11:31,908 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:31,911 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:11:31,911 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:11:32,193 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:11:32,193 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:11:32,193 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-11 15:11:32,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-11 15:11:32,193 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-11 15:11:32,193 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=701, Unknown=0, NotChecked=0, Total=756 [2018-04-11 15:11:32,194 INFO L87 Difference]: Start difference. First operand 158 states and 171 transitions. Second operand 28 states. [2018-04-11 15:11:33,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:11:33,199 INFO L93 Difference]: Finished difference Result 494 states and 507 transitions. [2018-04-11 15:11:33,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-11 15:11:33,200 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 79 [2018-04-11 15:11:33,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:11:33,200 INFO L225 Difference]: With dead ends: 494 [2018-04-11 15:11:33,200 INFO L226 Difference]: Without dead ends: 494 [2018-04-11 15:11:33,200 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=185, Invalid=2467, Unknown=0, NotChecked=0, Total=2652 [2018-04-11 15:11:33,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2018-04-11 15:11:33,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 158. [2018-04-11 15:11:33,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-04-11 15:11:33,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 171 transitions. [2018-04-11 15:11:33,202 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 171 transitions. Word has length 79 [2018-04-11 15:11:33,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:11:33,202 INFO L459 AbstractCegarLoop]: Abstraction has 158 states and 171 transitions. [2018-04-11 15:11:33,202 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-11 15:11:33,202 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 171 transitions. [2018-04-11 15:11:33,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-04-11 15:11:33,202 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:11:33,202 INFO L355 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:11:33,202 INFO L408 AbstractCegarLoop]: === Iteration 106 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:11:33,202 INFO L82 PathProgramCache]: Analyzing trace with hash 901060426, now seen corresponding path program 53 times [2018-04-11 15:11:33,202 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:11:33,202 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:11:33,203 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:33,203 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:11:33,203 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:33,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:33,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:11:33,212 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:11:33,212 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:11:33,212 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:11:33,212 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:11:33,235 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-04-11 15:11:33,235 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:11:33,239 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:11:33,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:11:33,243 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:33,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:11:33,247 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:33,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:33,249 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:11:33,263 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:33,264 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:11:33,264 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:33,271 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:33,272 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:33,272 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:11:33,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:33,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:11:33,278 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:23 [2018-04-11 15:11:33,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 4 [2018-04-11 15:11:33,335 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:33,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:33,338 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:11 [2018-04-11 15:11:33,665 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:11:33,665 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:11:33,666 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-11 15:11:33,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-11 15:11:33,666 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-11 15:11:33,666 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=700, Unknown=0, NotChecked=0, Total=756 [2018-04-11 15:11:33,666 INFO L87 Difference]: Start difference. First operand 158 states and 171 transitions. Second operand 28 states. [2018-04-11 15:11:35,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:11:35,028 INFO L93 Difference]: Finished difference Result 514 states and 527 transitions. [2018-04-11 15:11:35,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-11 15:11:35,028 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 79 [2018-04-11 15:11:35,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:11:35,029 INFO L225 Difference]: With dead ends: 514 [2018-04-11 15:11:35,029 INFO L226 Difference]: Without dead ends: 514 [2018-04-11 15:11:35,029 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=178, Invalid=2474, Unknown=0, NotChecked=0, Total=2652 [2018-04-11 15:11:35,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2018-04-11 15:11:35,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 158. [2018-04-11 15:11:35,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-04-11 15:11:35,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 171 transitions. [2018-04-11 15:11:35,031 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 171 transitions. Word has length 79 [2018-04-11 15:11:35,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:11:35,032 INFO L459 AbstractCegarLoop]: Abstraction has 158 states and 171 transitions. [2018-04-11 15:11:35,032 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-11 15:11:35,032 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 171 transitions. [2018-04-11 15:11:35,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-04-11 15:11:35,032 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:11:35,032 INFO L355 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:11:35,032 INFO L408 AbstractCegarLoop]: === Iteration 107 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:11:35,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1258415585, now seen corresponding path program 54 times [2018-04-11 15:11:35,032 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:11:35,032 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:11:35,033 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:35,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:11:35,033 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:35,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:35,041 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:11:35,043 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:11:35,043 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:11:35,043 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:11:35,043 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:11:35,104 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-04-11 15:11:35,104 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:11:35,112 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:11:35,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:11:35,114 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:35,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:11:35,118 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:35,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:35,120 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:11:35,128 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:35,129 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:11:35,129 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:35,136 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:35,137 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:35,137 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:11:35,137 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:35,141 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:11:35,141 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:11:35,407 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 0 proven. 238 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:11:35,407 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:11:35,407 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-04-11 15:11:35,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-04-11 15:11:35,407 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-04-11 15:11:35,408 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=552, Unknown=0, NotChecked=0, Total=600 [2018-04-11 15:11:35,408 INFO L87 Difference]: Start difference. First operand 158 states and 171 transitions. Second operand 25 states. [2018-04-11 15:11:36,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:11:36,368 INFO L93 Difference]: Finished difference Result 529 states and 542 transitions. [2018-04-11 15:11:36,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 15:11:36,368 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 79 [2018-04-11 15:11:36,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:11:36,369 INFO L225 Difference]: With dead ends: 529 [2018-04-11 15:11:36,369 INFO L226 Difference]: Without dead ends: 529 [2018-04-11 15:11:36,369 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=154, Invalid=1916, Unknown=0, NotChecked=0, Total=2070 [2018-04-11 15:11:36,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-04-11 15:11:36,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 158. [2018-04-11 15:11:36,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-04-11 15:11:36,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 171 transitions. [2018-04-11 15:11:36,370 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 171 transitions. Word has length 79 [2018-04-11 15:11:36,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:11:36,371 INFO L459 AbstractCegarLoop]: Abstraction has 158 states and 171 transitions. [2018-04-11 15:11:36,371 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-04-11 15:11:36,371 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 171 transitions. [2018-04-11 15:11:36,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-04-11 15:11:36,371 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:11:36,371 INFO L355 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:11:36,371 INFO L408 AbstractCegarLoop]: === Iteration 108 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:11:36,371 INFO L82 PathProgramCache]: Analyzing trace with hash -849996566, now seen corresponding path program 55 times [2018-04-11 15:11:36,371 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:11:36,371 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:11:36,371 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:36,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:11:36,372 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:36,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:36,379 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:11:36,381 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:11:36,381 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:11:36,381 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:11:36,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:11:36,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:36,412 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:11:36,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:11:36,431 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:36,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:11:36,439 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:36,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:36,441 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:11:36,449 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:36,450 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:11:36,450 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:36,455 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:36,455 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:36,456 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:11:36,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:36,458 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:11:36,459 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:11:36,675 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 0 proven. 279 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:11:36,675 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:11:36,675 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-11 15:11:36,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 15:11:36,676 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 15:11:36,676 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552 [2018-04-11 15:11:36,676 INFO L87 Difference]: Start difference. First operand 158 states and 171 transitions. Second operand 24 states. [2018-04-11 15:11:37,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:11:37,588 INFO L93 Difference]: Finished difference Result 540 states and 553 transitions. [2018-04-11 15:11:37,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 15:11:37,589 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 79 [2018-04-11 15:11:37,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:11:37,589 INFO L225 Difference]: With dead ends: 540 [2018-04-11 15:11:37,589 INFO L226 Difference]: Without dead ends: 540 [2018-04-11 15:11:37,589 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=1752, Unknown=0, NotChecked=0, Total=1892 [2018-04-11 15:11:37,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2018-04-11 15:11:37,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 158. [2018-04-11 15:11:37,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-04-11 15:11:37,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 171 transitions. [2018-04-11 15:11:37,591 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 171 transitions. Word has length 79 [2018-04-11 15:11:37,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:11:37,591 INFO L459 AbstractCegarLoop]: Abstraction has 158 states and 171 transitions. [2018-04-11 15:11:37,591 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 15:11:37,591 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 171 transitions. [2018-04-11 15:11:37,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-04-11 15:11:37,591 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:11:37,591 INFO L355 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:11:37,591 INFO L408 AbstractCegarLoop]: === Iteration 109 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:11:37,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1059003327, now seen corresponding path program 11 times [2018-04-11 15:11:37,591 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:11:37,591 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:11:37,592 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:37,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:11:37,592 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:37,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:37,601 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:11:37,637 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:11:37,637 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:11:37,637 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:11:37,637 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:11:37,679 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-04-11 15:11:37,679 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:11:37,684 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:11:37,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:11:37,693 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:37,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:11:37,697 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:37,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:37,699 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:11:37,708 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:37,708 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:37,709 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:11:37,709 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:37,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:11:37,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:37,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:11:37,719 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:23 [2018-04-11 15:11:37,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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:11:37,809 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:37,837 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:11:37,837 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:11 [2018-04-11 15:11:38,056 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:11:38,057 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:11:38,057 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-11 15:11:38,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 15:11:38,057 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 15:11:38,057 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=505, Unknown=0, NotChecked=0, Total=552 [2018-04-11 15:11:38,057 INFO L87 Difference]: Start difference. First operand 158 states and 171 transitions. Second operand 24 states. [2018-04-11 15:11:39,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:11:39,115 INFO L93 Difference]: Finished difference Result 553 states and 567 transitions. [2018-04-11 15:11:39,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-04-11 15:11:39,115 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 79 [2018-04-11 15:11:39,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:11:39,115 INFO L225 Difference]: With dead ends: 553 [2018-04-11 15:11:39,115 INFO L226 Difference]: Without dead ends: 553 [2018-04-11 15:11:39,116 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=144, Invalid=1836, Unknown=0, NotChecked=0, Total=1980 [2018-04-11 15:11:39,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2018-04-11 15:11:39,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 159. [2018-04-11 15:11:39,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-04-11 15:11:39,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 173 transitions. [2018-04-11 15:11:39,117 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 173 transitions. Word has length 79 [2018-04-11 15:11:39,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:11:39,117 INFO L459 AbstractCegarLoop]: Abstraction has 159 states and 173 transitions. [2018-04-11 15:11:39,117 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 15:11:39,117 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 173 transitions. [2018-04-11 15:11:39,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-04-11 15:11:39,117 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:11:39,118 INFO L355 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:11:39,118 INFO L408 AbstractCegarLoop]: === Iteration 110 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:11:39,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1041113957, now seen corresponding path program 12 times [2018-04-11 15:11:39,118 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:11:39,118 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:11:39,118 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:39,118 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:11:39,119 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:39,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:39,134 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:11:39,136 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:11:39,137 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:11:39,137 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:11:39,137 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:11:39,219 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-04-11 15:11:39,220 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:11:39,228 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:11:39,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:11:39,230 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:39,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:11:39,234 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:39,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:39,237 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:11:39,245 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:39,246 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:39,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:11:39,246 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:39,251 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:11:39,251 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:39,256 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:11:39,256 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:11:39,429 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:11:39,430 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:11:39,430 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-04-11 15:11:39,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-04-11 15:11:39,430 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-04-11 15:11:39,430 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=380, Unknown=0, NotChecked=0, Total=420 [2018-04-11 15:11:39,430 INFO L87 Difference]: Start difference. First operand 159 states and 173 transitions. Second operand 21 states. [2018-04-11 15:11:40,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:11:40,095 INFO L93 Difference]: Finished difference Result 555 states and 570 transitions. [2018-04-11 15:11:40,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-04-11 15:11:40,095 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 79 [2018-04-11 15:11:40,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:11:40,096 INFO L225 Difference]: With dead ends: 555 [2018-04-11 15:11:40,096 INFO L226 Difference]: Without dead ends: 555 [2018-04-11 15:11:40,096 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=1294, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 15:11:40,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2018-04-11 15:11:40,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 163. [2018-04-11 15:11:40,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-04-11 15:11:40,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 177 transitions. [2018-04-11 15:11:40,097 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 177 transitions. Word has length 79 [2018-04-11 15:11:40,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:11:40,097 INFO L459 AbstractCegarLoop]: Abstraction has 163 states and 177 transitions. [2018-04-11 15:11:40,097 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-04-11 15:11:40,098 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 177 transitions. [2018-04-11 15:11:40,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-04-11 15:11:40,098 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:11:40,098 INFO L355 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 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:11:40,098 INFO L408 AbstractCegarLoop]: === Iteration 111 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:11:40,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1443781957, now seen corresponding path program 12 times [2018-04-11 15:11:40,098 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:11:40,098 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:11:40,098 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:40,098 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:11:40,099 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:40,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:40,105 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:11:40,157 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:11:40,157 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:11:40,157 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:11:40,157 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:11:40,193 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-04-11 15:11:40,193 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:11:40,199 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:11:40,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:11:40,202 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:40,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:40,205 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-11 15:11:40,227 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:11:40,228 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:11:40,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-04-11 15:11:40,234 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:24 [2018-04-11 15:11:41,073 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:11:41,073 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:11:41,073 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-04-11 15:11:41,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-11 15:11:41,074 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-11 15:11:41,074 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1331, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 15:11:41,074 INFO L87 Difference]: Start difference. First operand 163 states and 177 transitions. Second operand 38 states. [2018-04-11 15:11:43,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:11:43,928 INFO L93 Difference]: Finished difference Result 234 states and 248 transitions. [2018-04-11 15:11:43,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-11 15:11:43,928 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 84 [2018-04-11 15:11:43,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:11:43,929 INFO L225 Difference]: With dead ends: 234 [2018-04-11 15:11:43,929 INFO L226 Difference]: Without dead ends: 234 [2018-04-11 15:11:43,929 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 694 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=284, Invalid=4972, Unknown=0, NotChecked=0, Total=5256 [2018-04-11 15:11:43,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-04-11 15:11:43,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 168. [2018-04-11 15:11:43,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-11 15:11:43,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 182 transitions. [2018-04-11 15:11:43,930 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 182 transitions. Word has length 84 [2018-04-11 15:11:43,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:11:43,930 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 182 transitions. [2018-04-11 15:11:43,930 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-11 15:11:43,930 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 182 transitions. [2018-04-11 15:11:43,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-04-11 15:11:43,930 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:11:43,931 INFO L355 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 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:11:43,931 INFO L408 AbstractCegarLoop]: === Iteration 112 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:11:43,931 INFO L82 PathProgramCache]: Analyzing trace with hash -2012151677, now seen corresponding path program 5 times [2018-04-11 15:11:43,931 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:11:43,931 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:11:43,931 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:43,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:11:43,931 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:43,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:43,937 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:11:43,954 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:11:43,954 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:11:43,954 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:11:43,954 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:11:43,971 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-04-11 15:11:43,971 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:11:43,974 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:11:43,975 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:11:43,976 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:43,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:11:43,979 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:43,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:43,982 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:11:43,994 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:43,994 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:11:43,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:44,001 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:44,002 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:44,002 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:11:44,002 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:44,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-04-11 15:11:44,007 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:31, output treesize:23 [2018-04-11 15:11:44,150 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:11:44,150 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:44,153 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:11:44,154 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:11 [2018-04-11 15:11:44,595 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:11:44,596 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:11:44,596 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-04-11 15:11:44,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-04-11 15:11:44,596 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-04-11 15:11:44,596 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=1330, Unknown=0, NotChecked=0, Total=1406 [2018-04-11 15:11:44,596 INFO L87 Difference]: Start difference. First operand 168 states and 182 transitions. Second operand 38 states. [2018-04-11 15:11:46,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:11:46,490 INFO L93 Difference]: Finished difference Result 293 states and 307 transitions. [2018-04-11 15:11:46,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-04-11 15:11:46,490 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 84 [2018-04-11 15:11:46,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:11:46,491 INFO L225 Difference]: With dead ends: 293 [2018-04-11 15:11:46,491 INFO L226 Difference]: Without dead ends: 293 [2018-04-11 15:11:46,491 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=285, Invalid=4971, Unknown=0, NotChecked=0, Total=5256 [2018-04-11 15:11:46,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-04-11 15:11:46,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 168. [2018-04-11 15:11:46,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-11 15:11:46,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 182 transitions. [2018-04-11 15:11:46,492 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 182 transitions. Word has length 84 [2018-04-11 15:11:46,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:11:46,492 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 182 transitions. [2018-04-11 15:11:46,492 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-04-11 15:11:46,492 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 182 transitions. [2018-04-11 15:11:46,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-04-11 15:11:46,492 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:11:46,492 INFO L355 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:11:46,493 INFO L408 AbstractCegarLoop]: === Iteration 113 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:11:46,493 INFO L82 PathProgramCache]: Analyzing trace with hash 935295820, now seen corresponding path program 56 times [2018-04-11 15:11:46,493 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:11:46,493 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:11:46,493 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:46,493 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:11:46,493 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:46,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:46,499 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:11:46,550 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:11:46,551 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:11:46,551 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:11:46,551 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:11:46,565 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:11:46,565 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:11:46,568 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:11:46,570 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:11:46,570 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:46,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:11:46,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:46,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:46,575 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:11:46,583 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:46,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:11:46,584 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:46,589 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:46,590 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:46,590 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:11:46,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:46,593 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:11:46,593 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:11:47,506 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:11:47,506 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:11:47,506 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-04-11 15:11:47,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-11 15:11:47,506 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-11 15:11:47,506 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=1190, Unknown=0, NotChecked=0, Total=1260 [2018-04-11 15:11:47,507 INFO L87 Difference]: Start difference. First operand 168 states and 182 transitions. Second operand 36 states. [2018-04-11 15:11:49,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:11:49,605 INFO L93 Difference]: Finished difference Result 289 states and 303 transitions. [2018-04-11 15:11:49,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-04-11 15:11:49,605 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 84 [2018-04-11 15:11:49,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:11:49,606 INFO L225 Difference]: With dead ends: 289 [2018-04-11 15:11:49,606 INFO L226 Difference]: Without dead ends: 289 [2018-04-11 15:11:49,606 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 500 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=258, Invalid=4298, Unknown=0, NotChecked=0, Total=4556 [2018-04-11 15:11:49,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-04-11 15:11:49,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 168. [2018-04-11 15:11:49,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-11 15:11:49,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 182 transitions. [2018-04-11 15:11:49,607 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 182 transitions. Word has length 84 [2018-04-11 15:11:49,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:11:49,607 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 182 transitions. [2018-04-11 15:11:49,607 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-11 15:11:49,607 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 182 transitions. [2018-04-11 15:11:49,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-04-11 15:11:49,607 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:11:49,608 INFO L355 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:11:49,608 INFO L408 AbstractCegarLoop]: === Iteration 114 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:11:49,608 INFO L82 PathProgramCache]: Analyzing trace with hash -434133277, now seen corresponding path program 57 times [2018-04-11 15:11:49,608 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:11:49,608 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:11:49,608 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:49,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:11:49,608 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:49,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:49,614 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:11:49,637 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:11:49,637 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:11:49,637 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:11:49,637 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:11:49,667 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-04-11 15:11:49,667 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:11:49,673 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:11:49,674 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:11:49,675 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:49,678 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:11:49,678 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:49,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:49,680 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:11:49,688 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:49,689 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:11:49,689 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:49,694 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:49,695 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:49,695 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:11:49,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:49,698 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:11:49,698 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:11:50,090 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:11:50,090 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:11:50,090 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-04-11 15:11:50,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-11 15:11:50,090 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-11 15:11:50,090 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=1056, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 15:11:50,091 INFO L87 Difference]: Start difference. First operand 168 states and 182 transitions. Second operand 34 states. [2018-04-11 15:11:51,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:11:51,193 INFO L93 Difference]: Finished difference Result 344 states and 358 transitions. [2018-04-11 15:11:51,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-04-11 15:11:51,194 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 84 [2018-04-11 15:11:51,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:11:51,194 INFO L225 Difference]: With dead ends: 344 [2018-04-11 15:11:51,194 INFO L226 Difference]: Without dead ends: 344 [2018-04-11 15:11:51,194 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=240, Invalid=3792, Unknown=0, NotChecked=0, Total=4032 [2018-04-11 15:11:51,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-04-11 15:11:51,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 168. [2018-04-11 15:11:51,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-11 15:11:51,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 182 transitions. [2018-04-11 15:11:51,196 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 182 transitions. Word has length 84 [2018-04-11 15:11:51,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:11:51,196 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 182 transitions. [2018-04-11 15:11:51,196 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-11 15:11:51,196 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 182 transitions. [2018-04-11 15:11:51,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-04-11 15:11:51,196 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:11:51,196 INFO L355 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:11:51,196 INFO L408 AbstractCegarLoop]: === Iteration 115 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:11:51,196 INFO L82 PathProgramCache]: Analyzing trace with hash -570795796, now seen corresponding path program 58 times [2018-04-11 15:11:51,196 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:11:51,196 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:11:51,197 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:51,197 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:11:51,197 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:51,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:51,203 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:11:51,263 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:11:51,263 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:11:51,263 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:11:51,264 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:11:51,280 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:11:51,280 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:11:51,283 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:11:51,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:11:51,285 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:51,288 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:11:51,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:51,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:51,290 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:11:51,299 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:51,299 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:51,299 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:11:51,299 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:51,303 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:11:51,303 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:51,306 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:11:51,306 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:11:51,686 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:11:51,686 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:11:51,686 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-04-11 15:11:51,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-04-11 15:11:51,686 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-04-11 15:11:51,686 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=992, Unknown=0, NotChecked=0, Total=1056 [2018-04-11 15:11:51,686 INFO L87 Difference]: Start difference. First operand 168 states and 182 transitions. Second operand 33 states. [2018-04-11 15:11:52,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:11:52,809 INFO L93 Difference]: Finished difference Result 394 states and 408 transitions. [2018-04-11 15:11:52,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-04-11 15:11:52,809 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 84 [2018-04-11 15:11:52,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:11:52,810 INFO L225 Difference]: With dead ends: 394 [2018-04-11 15:11:52,810 INFO L226 Difference]: Without dead ends: 394 [2018-04-11 15:11:52,810 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=230, Invalid=3552, Unknown=0, NotChecked=0, Total=3782 [2018-04-11 15:11:52,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-04-11 15:11:52,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 168. [2018-04-11 15:11:52,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-11 15:11:52,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 182 transitions. [2018-04-11 15:11:52,811 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 182 transitions. Word has length 84 [2018-04-11 15:11:52,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:11:52,812 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 182 transitions. [2018-04-11 15:11:52,812 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-04-11 15:11:52,812 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 182 transitions. [2018-04-11 15:11:52,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-04-11 15:11:52,812 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:11:52,812 INFO L355 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:11:52,812 INFO L408 AbstractCegarLoop]: === Iteration 116 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:11:52,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1287177539, now seen corresponding path program 59 times [2018-04-11 15:11:52,812 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:11:52,812 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:11:52,812 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:52,813 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:11:52,813 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:52,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:52,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:11:52,821 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:11:52,821 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:11:52,821 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:11:52,821 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:11:52,875 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-04-11 15:11:52,876 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:11:52,883 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:11:52,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:11:52,886 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:52,889 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:11:52,889 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:52,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:52,892 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:11:52,900 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:52,900 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:52,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-04-11 15:11:52,900 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:52,904 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:11:52,904 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:52,907 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:11:52,907 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:11:53,027 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:11:53,027 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:53,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:53,029 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:14 [2018-04-11 15:11:53,355 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:11:53,356 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:11:53,356 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-04-11 15:11:53,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-04-11 15:11:53,356 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-04-11 15:11:53,356 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1055, Unknown=0, NotChecked=0, Total=1122 [2018-04-11 15:11:53,356 INFO L87 Difference]: Start difference. First operand 168 states and 182 transitions. Second operand 34 states. [2018-04-11 15:11:54,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:11:54,715 INFO L93 Difference]: Finished difference Result 439 states and 453 transitions. [2018-04-11 15:11:54,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-04-11 15:11:54,715 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 84 [2018-04-11 15:11:54,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:11:54,716 INFO L225 Difference]: With dead ends: 439 [2018-04-11 15:11:54,716 INFO L226 Difference]: Without dead ends: 439 [2018-04-11 15:11:54,716 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=244, Invalid=3916, Unknown=0, NotChecked=0, Total=4160 [2018-04-11 15:11:54,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2018-04-11 15:11:54,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 168. [2018-04-11 15:11:54,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-11 15:11:54,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 182 transitions. [2018-04-11 15:11:54,717 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 182 transitions. Word has length 84 [2018-04-11 15:11:54,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:11:54,717 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 182 transitions. [2018-04-11 15:11:54,717 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-04-11 15:11:54,718 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 182 transitions. [2018-04-11 15:11:54,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-04-11 15:11:54,718 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:11:54,718 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:11:54,718 INFO L408 AbstractCegarLoop]: === Iteration 117 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:11:54,718 INFO L82 PathProgramCache]: Analyzing trace with hash 2097135244, now seen corresponding path program 60 times [2018-04-11 15:11:54,718 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:11:54,718 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:11:54,718 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:54,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:11:54,718 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:54,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:54,725 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:11:54,727 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:11:54,727 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:11:54,727 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:11:54,727 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:11:54,774 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-04-11 15:11:54,774 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:11:54,781 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:11:54,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:11:54,783 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:54,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:11:54,786 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:54,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:54,789 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:11:54,796 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:54,797 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:11:54,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:54,802 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:54,803 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:54,803 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:11:54,803 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:54,806 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:11:54,806 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:11:55,175 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 0 proven. 208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:11:55,175 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:11:55,175 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-04-11 15:11:55,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-11 15:11:55,175 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-11 15:11:55,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=870, Unknown=0, NotChecked=0, Total=930 [2018-04-11 15:11:55,175 INFO L87 Difference]: Start difference. First operand 168 states and 182 transitions. Second operand 31 states. [2018-04-11 15:11:56,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:11:56,307 INFO L93 Difference]: Finished difference Result 479 states and 493 transitions. [2018-04-11 15:11:56,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-11 15:11:56,307 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 84 [2018-04-11 15:11:56,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:11:56,308 INFO L225 Difference]: With dead ends: 479 [2018-04-11 15:11:56,308 INFO L226 Difference]: Without dead ends: 479 [2018-04-11 15:11:56,308 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=210, Invalid=3096, Unknown=0, NotChecked=0, Total=3306 [2018-04-11 15:11:56,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2018-04-11 15:11:56,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 168. [2018-04-11 15:11:56,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-11 15:11:56,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 182 transitions. [2018-04-11 15:11:56,309 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 182 transitions. Word has length 84 [2018-04-11 15:11:56,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:11:56,310 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 182 transitions. [2018-04-11 15:11:56,310 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-11 15:11:56,310 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 182 transitions. [2018-04-11 15:11:56,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-04-11 15:11:56,310 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:11:56,310 INFO L355 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 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:11:56,310 INFO L408 AbstractCegarLoop]: === Iteration 118 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:11:56,310 INFO L82 PathProgramCache]: Analyzing trace with hash 2014469027, now seen corresponding path program 61 times [2018-04-11 15:11:56,310 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:11:56,310 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:11:56,310 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:56,311 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:11:56,311 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:56,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:56,318 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:11:56,320 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:11:56,320 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:11:56,320 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:11:56,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:11:56,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:56,345 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:11:56,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:11:56,347 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:56,350 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:11:56,350 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:56,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:56,352 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:11:56,360 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:56,361 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:11:56,361 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:56,366 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:56,366 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:56,367 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:11:56,367 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:56,370 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:11:56,370 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:11:56,684 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 204 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:11:56,684 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:11:56,685 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-04-11 15:11:56,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-11 15:11:56,685 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-11 15:11:56,685 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=869, Unknown=0, NotChecked=0, Total=930 [2018-04-11 15:11:56,685 INFO L87 Difference]: Start difference. First operand 168 states and 182 transitions. Second operand 31 states. [2018-04-11 15:11:57,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:11:57,840 INFO L93 Difference]: Finished difference Result 514 states and 528 transitions. [2018-04-11 15:11:57,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-11 15:11:57,840 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 84 [2018-04-11 15:11:57,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:11:57,841 INFO L225 Difference]: With dead ends: 514 [2018-04-11 15:11:57,841 INFO L226 Difference]: Without dead ends: 514 [2018-04-11 15:11:57,841 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=211, Invalid=3095, Unknown=0, NotChecked=0, Total=3306 [2018-04-11 15:11:57,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2018-04-11 15:11:57,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 168. [2018-04-11 15:11:57,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-11 15:11:57,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 182 transitions. [2018-04-11 15:11:57,843 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 182 transitions. Word has length 84 [2018-04-11 15:11:57,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:11:57,843 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 182 transitions. [2018-04-11 15:11:57,843 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-11 15:11:57,843 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 182 transitions. [2018-04-11 15:11:57,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-04-11 15:11:57,843 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:11:57,843 INFO L355 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:11:57,843 INFO L408 AbstractCegarLoop]: === Iteration 119 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:11:57,843 INFO L82 PathProgramCache]: Analyzing trace with hash 249146412, now seen corresponding path program 62 times [2018-04-11 15:11:57,843 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:11:57,843 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:11:57,844 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:57,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:11:57,844 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:57,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:57,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:11:57,853 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:11:57,853 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:11:57,853 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:11:57,853 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:11:57,869 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:11:57,869 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:11:57,873 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:11:57,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:11:57,875 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:57,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:11:57,878 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:57,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:11:57,880 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:11:57,888 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:57,889 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:11:57,889 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:57,894 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:57,894 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:11:57,894 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:11:57,895 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:11:57,897 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:11:57,897 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:11:58,382 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:11:58,382 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:11:58,382 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-04-11 15:11:58,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-04-11 15:11:58,382 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-04-11 15:11:58,383 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=870, Unknown=0, NotChecked=0, Total=930 [2018-04-11 15:11:58,383 INFO L87 Difference]: Start difference. First operand 168 states and 182 transitions. Second operand 31 states. [2018-04-11 15:11:59,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:11:59,982 INFO L93 Difference]: Finished difference Result 544 states and 558 transitions. [2018-04-11 15:11:59,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-04-11 15:11:59,983 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 84 [2018-04-11 15:11:59,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:11:59,983 INFO L225 Difference]: With dead ends: 544 [2018-04-11 15:11:59,983 INFO L226 Difference]: Without dead ends: 544 [2018-04-11 15:11:59,983 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=211, Invalid=3211, Unknown=0, NotChecked=0, Total=3422 [2018-04-11 15:11:59,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2018-04-11 15:11:59,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 168. [2018-04-11 15:11:59,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-11 15:11:59,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 182 transitions. [2018-04-11 15:11:59,985 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 182 transitions. Word has length 84 [2018-04-11 15:11:59,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:11:59,985 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 182 transitions. [2018-04-11 15:11:59,985 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-04-11 15:11:59,985 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 182 transitions. [2018-04-11 15:11:59,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-04-11 15:11:59,985 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:11:59,985 INFO L355 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:11:59,985 INFO L408 AbstractCegarLoop]: === Iteration 120 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:11:59,985 INFO L82 PathProgramCache]: Analyzing trace with hash -807245309, now seen corresponding path program 63 times [2018-04-11 15:11:59,985 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:11:59,985 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:11:59,986 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:59,986 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:11:59,986 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:11:59,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:11:59,994 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-04-11 15:11:59,995 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:11:59,995 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:11:59,996 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:11:59,996 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:12:00,039 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-04-11 15:12:00,039 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:12:00,045 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:12:00,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:12:00,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:00,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:00,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:00,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:00,062 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:12:00,071 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:00,072 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:00,072 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:00,072 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:00,076 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:00,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:00,080 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:00,080 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:12:00,382 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:12:00,382 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:12:00,382 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-04-11 15:12:00,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-04-11 15:12:00,383 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-04-11 15:12:00,383 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=702, Unknown=0, NotChecked=0, Total=756 [2018-04-11 15:12:00,383 INFO L87 Difference]: Start difference. First operand 168 states and 182 transitions. Second operand 28 states. [2018-04-11 15:12:01,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:12:01,708 INFO L93 Difference]: Finished difference Result 569 states and 583 transitions. [2018-04-11 15:12:01,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-04-11 15:12:01,709 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 84 [2018-04-11 15:12:01,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:12:01,710 INFO L225 Difference]: With dead ends: 569 [2018-04-11 15:12:01,710 INFO L226 Difference]: Without dead ends: 569 [2018-04-11 15:12:01,710 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=180, Invalid=2472, Unknown=0, NotChecked=0, Total=2652 [2018-04-11 15:12:01,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2018-04-11 15:12:01,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 168. [2018-04-11 15:12:01,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-11 15:12:01,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 182 transitions. [2018-04-11 15:12:01,713 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 182 transitions. Word has length 84 [2018-04-11 15:12:01,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:12:01,713 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 182 transitions. [2018-04-11 15:12:01,713 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-04-11 15:12:01,713 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 182 transitions. [2018-04-11 15:12:01,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-04-11 15:12:01,713 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:12:01,713 INFO L355 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:12:01,713 INFO L408 AbstractCegarLoop]: === Iteration 121 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:12:01,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1307434548, now seen corresponding path program 64 times [2018-04-11 15:12:01,714 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:12:01,714 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:12:01,714 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:01,714 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:12:01,715 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:01,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:12:01,730 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:01,734 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:12:01,734 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:12:01,734 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:12:01,734 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:12:01,786 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:12:01,786 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:12:01,791 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:12:01,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:01,793 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:01,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:01,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:01,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:01,801 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:12:01,837 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:01,838 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:01,838 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:01,839 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:01,845 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:01,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:01,851 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:01,851 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:12:02,380 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 252 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:12:02,380 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:12:02,380 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-04-11 15:12:02,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-04-11 15:12:02,381 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-04-11 15:12:02,381 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=650, Unknown=0, NotChecked=0, Total=702 [2018-04-11 15:12:02,381 INFO L87 Difference]: Start difference. First operand 168 states and 182 transitions. Second operand 27 states. [2018-04-11 15:12:03,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:12:03,612 INFO L93 Difference]: Finished difference Result 589 states and 603 transitions. [2018-04-11 15:12:03,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-04-11 15:12:03,612 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 84 [2018-04-11 15:12:03,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:12:03,613 INFO L225 Difference]: With dead ends: 589 [2018-04-11 15:12:03,613 INFO L226 Difference]: Without dead ends: 589 [2018-04-11 15:12:03,613 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=170, Invalid=2280, Unknown=0, NotChecked=0, Total=2450 [2018-04-11 15:12:03,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2018-04-11 15:12:03,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 168. [2018-04-11 15:12:03,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-11 15:12:03,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 182 transitions. [2018-04-11 15:12:03,615 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 182 transitions. Word has length 84 [2018-04-11 15:12:03,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:12:03,615 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 182 transitions. [2018-04-11 15:12:03,615 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-04-11 15:12:03,615 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 182 transitions. [2018-04-11 15:12:03,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-04-11 15:12:03,616 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:12:03,616 INFO L355 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:12:03,616 INFO L408 AbstractCegarLoop]: === Iteration 122 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:12:03,616 INFO L82 PathProgramCache]: Analyzing trace with hash -950079389, now seen corresponding path program 65 times [2018-04-11 15:12:03,616 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:12:03,616 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:12:03,616 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:03,616 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:12:03,616 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:03,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:12:03,625 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:03,627 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:12:03,628 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:12:03,628 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:12:03,628 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-04-11 15:12:03,682 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-04-11 15:12:03,682 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:12:03,690 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:12:03,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:03,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:03,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:03,695 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:03,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:03,698 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:12:03,707 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:03,707 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:03,708 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:12:03,708 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:03,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:12:03,715 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:03,719 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:03,720 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:23 [2018-04-11 15:12:03,805 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:12:03,806 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:03,809 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:03,809 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:14 [2018-04-11 15:12:04,124 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:12:04,125 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:12:04,125 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-04-11 15:12:04,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-04-11 15:12:04,125 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-04-11 15:12:04,125 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=754, Unknown=0, NotChecked=0, Total=812 [2018-04-11 15:12:04,125 INFO L87 Difference]: Start difference. First operand 168 states and 182 transitions. Second operand 29 states. [2018-04-11 15:12:05,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:12:05,629 INFO L93 Difference]: Finished difference Result 604 states and 618 transitions. [2018-04-11 15:12:05,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-04-11 15:12:05,629 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 84 [2018-04-11 15:12:05,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:12:05,630 INFO L225 Difference]: With dead ends: 604 [2018-04-11 15:12:05,630 INFO L226 Difference]: Without dead ends: 604 [2018-04-11 15:12:05,630 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=198, Invalid=2882, Unknown=0, NotChecked=0, Total=3080 [2018-04-11 15:12:05,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2018-04-11 15:12:05,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 168. [2018-04-11 15:12:05,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-11 15:12:05,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 182 transitions. [2018-04-11 15:12:05,633 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 182 transitions. Word has length 84 [2018-04-11 15:12:05,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:12:05,633 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 182 transitions. [2018-04-11 15:12:05,634 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-04-11 15:12:05,634 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 182 transitions. [2018-04-11 15:12:05,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-04-11 15:12:05,634 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:12:05,634 INFO L355 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:12:05,634 INFO L408 AbstractCegarLoop]: === Iteration 123 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:12:05,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1236475756, now seen corresponding path program 66 times [2018-04-11 15:12:05,647 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:12:05,647 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:12:05,647 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:05,647 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:12:05,647 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:05,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:12:05,666 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:05,668 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:12:05,668 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:12:05,668 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:12:05,669 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:12:05,841 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2018-04-11 15:12:05,841 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:12:05,850 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:12:05,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:05,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:05,856 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:05,856 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:05,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:05,859 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:12:05,869 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:05,870 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:05,871 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:05,877 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:05,878 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:05,878 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:05,878 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:05,882 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:05,882 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:12:05,967 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:05,967 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:05,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:05,969 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:11 [2018-04-11 15:12:06,147 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:12:06,147 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:12:06,147 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-04-11 15:12:06,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-04-11 15:12:06,147 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-04-11 15:12:06,147 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2018-04-11 15:12:06,147 INFO L87 Difference]: Start difference. First operand 168 states and 182 transitions. Second operand 26 states. [2018-04-11 15:12:07,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:12:07,301 INFO L93 Difference]: Finished difference Result 615 states and 629 transitions. [2018-04-11 15:12:07,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-04-11 15:12:07,301 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 84 [2018-04-11 15:12:07,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:12:07,302 INFO L225 Difference]: With dead ends: 615 [2018-04-11 15:12:07,302 INFO L226 Difference]: Without dead ends: 615 [2018-04-11 15:12:07,302 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=155, Invalid=2101, Unknown=0, NotChecked=0, Total=2256 [2018-04-11 15:12:07,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2018-04-11 15:12:07,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 168. [2018-04-11 15:12:07,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-04-11 15:12:07,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 182 transitions. [2018-04-11 15:12:07,304 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 182 transitions. Word has length 84 [2018-04-11 15:12:07,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:12:07,304 INFO L459 AbstractCegarLoop]: Abstraction has 168 states and 182 transitions. [2018-04-11 15:12:07,304 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-04-11 15:12:07,304 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 182 transitions. [2018-04-11 15:12:07,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-04-11 15:12:07,305 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:12:07,305 INFO L355 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 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:07,305 INFO L408 AbstractCegarLoop]: === Iteration 124 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:12:07,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1027468995, now seen corresponding path program 12 times [2018-04-11 15:12:07,305 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:12:07,305 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:12:07,305 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:07,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:12:07,306 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:07,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:12:07,316 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:07,323 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:12:07,323 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:12:07,324 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:12:07,324 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:12:07,420 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-04-11 15:12:07,421 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:12:07,436 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:12:07,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:12:07,445 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:07,477 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:07,478 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:07,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:07,482 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:12:07,496 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:07,497 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:07,497 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:07,504 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:07,504 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:07,505 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:07,505 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:07,508 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:07,508 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:12:07,747 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 390 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:12:07,747 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:12:07,747 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-04-11 15:12:07,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-04-11 15:12:07,747 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-04-11 15:12:07,747 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=506, Unknown=0, NotChecked=0, Total=552 [2018-04-11 15:12:07,747 INFO L87 Difference]: Start difference. First operand 168 states and 182 transitions. Second operand 24 states. [2018-04-11 15:12:08,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:12:08,720 INFO L93 Difference]: Finished difference Result 628 states and 643 transitions. [2018-04-11 15:12:08,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-04-11 15:12:08,721 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 84 [2018-04-11 15:12:08,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:12:08,721 INFO L225 Difference]: With dead ends: 628 [2018-04-11 15:12:08,721 INFO L226 Difference]: Without dead ends: 628 [2018-04-11 15:12:08,722 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=1756, Unknown=0, NotChecked=0, Total=1892 [2018-04-11 15:12:08,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2018-04-11 15:12:08,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 169. [2018-04-11 15:12:08,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-04-11 15:12:08,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 184 transitions. [2018-04-11 15:12:08,723 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 184 transitions. Word has length 84 [2018-04-11 15:12:08,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:12:08,723 INFO L459 AbstractCegarLoop]: Abstraction has 169 states and 184 transitions. [2018-04-11 15:12:08,723 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-04-11 15:12:08,723 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 184 transitions. [2018-04-11 15:12:08,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-04-11 15:12:08,724 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:12:08,724 INFO L355 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:12:08,724 INFO L408 AbstractCegarLoop]: === Iteration 125 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:12:08,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1045358365, now seen corresponding path program 13 times [2018-04-11 15:12:08,724 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:12:08,724 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:12:08,724 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:08,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:12:08,724 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:08,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:12:08,734 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:08,735 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:12:08,736 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:12:08,736 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:12:08,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:12:08,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:12:08,787 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:12:08,789 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:08,789 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:08,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:08,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:08,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:08,800 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:12:08,807 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:08,808 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:08,808 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:08,813 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:08,813 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:08,814 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:08,814 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:08,818 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:08,818 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:12:09,001 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:12:09,001 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:12:09,001 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-04-11 15:12:09,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-04-11 15:12:09,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-04-11 15:12:09,002 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2018-04-11 15:12:09,002 INFO L87 Difference]: Start difference. First operand 169 states and 184 transitions. Second operand 22 states. [2018-04-11 15:12:09,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:12:09,861 INFO L93 Difference]: Finished difference Result 630 states and 646 transitions. [2018-04-11 15:12:09,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-04-11 15:12:09,861 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 84 [2018-04-11 15:12:09,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:12:09,862 INFO L225 Difference]: With dead ends: 630 [2018-04-11 15:12:09,863 INFO L226 Difference]: Without dead ends: 630 [2018-04-11 15:12:09,863 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=1442, Unknown=0, NotChecked=0, Total=1560 [2018-04-11 15:12:09,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2018-04-11 15:12:09,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 173. [2018-04-11 15:12:09,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-04-11 15:12:09,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 188 transitions. [2018-04-11 15:12:09,865 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 188 transitions. Word has length 84 [2018-04-11 15:12:09,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:12:09,865 INFO L459 AbstractCegarLoop]: Abstraction has 173 states and 188 transitions. [2018-04-11 15:12:09,866 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-04-11 15:12:09,866 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 188 transitions. [2018-04-11 15:12:09,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-04-11 15:12:09,866 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:12:09,866 INFO L355 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 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:09,866 INFO L408 AbstractCegarLoop]: === Iteration 126 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:12:09,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1776068840, now seen corresponding path program 13 times [2018-04-11 15:12:09,866 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:12:09,867 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:12:09,867 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:09,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:12:09,867 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:09,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:12:09,878 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:09,961 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:12:09,961 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:12:09,961 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:12:09,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:12:09,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:12:09,988 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:12:09,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:09,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:09,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:09,994 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-04-11 15:12:10,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-04-11 15:12:10,009 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-04-11 15:12:10,017 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 2 xjuncts. [2018-04-11 15:12:10,018 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:36 [2018-04-11 15:12:11,204 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:12:11,204 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:12:11,204 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-04-11 15:12:11,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-04-11 15:12:11,204 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-04-11 15:12:11,205 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1637, Unknown=0, NotChecked=0, Total=1722 [2018-04-11 15:12:11,205 INFO L87 Difference]: Start difference. First operand 173 states and 188 transitions. Second operand 42 states. [2018-04-11 15:12:15,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:12:15,042 INFO L93 Difference]: Finished difference Result 249 states and 264 transitions. [2018-04-11 15:12:15,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-04-11 15:12:15,042 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 89 [2018-04-11 15:12:15,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:12:15,043 INFO L225 Difference]: With dead ends: 249 [2018-04-11 15:12:15,043 INFO L226 Difference]: Without dead ends: 249 [2018-04-11 15:12:15,043 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 947 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=314, Invalid=6006, Unknown=0, NotChecked=0, Total=6320 [2018-04-11 15:12:15,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-04-11 15:12:15,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 178. [2018-04-11 15:12:15,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-04-11 15:12:15,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 193 transitions. [2018-04-11 15:12:15,044 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 193 transitions. Word has length 89 [2018-04-11 15:12:15,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:12:15,044 INFO L459 AbstractCegarLoop]: Abstraction has 178 states and 193 transitions. [2018-04-11 15:12:15,044 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-04-11 15:12:15,044 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 193 transitions. [2018-04-11 15:12:15,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-04-11 15:12:15,044 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:12:15,044 INFO L355 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 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:15,045 INFO L408 AbstractCegarLoop]: === Iteration 127 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:12:15,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1194042262, now seen corresponding path program 6 times [2018-04-11 15:12:15,045 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:12:15,045 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:12:15,045 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:15,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:12:15,045 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:15,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:12:15,051 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:15,097 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:12:15,097 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:12:15,098 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:12:15,098 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-04-11 15:12:15,138 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2018-04-11 15:12:15,138 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:12:15,143 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:12:15,144 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:12:15,144 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:15,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:12:15,148 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:15,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:15,151 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:12:15,159 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:15,160 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:15,160 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:15,160 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:15,165 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:15,165 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:15,168 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:15,168 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:12:15,748 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:12:15,748 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:12:15,748 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-04-11 15:12:15,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-04-11 15:12:15,748 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-04-11 15:12:15,748 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=1406, Unknown=0, NotChecked=0, Total=1482 [2018-04-11 15:12:15,748 INFO L87 Difference]: Start difference. First operand 178 states and 193 transitions. Second operand 39 states. [2018-04-11 15:12:17,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:12:17,292 INFO L93 Difference]: Finished difference Result 313 states and 328 transitions. [2018-04-11 15:12:17,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-04-11 15:12:17,292 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 89 [2018-04-11 15:12:17,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:12:17,293 INFO L225 Difference]: With dead ends: 313 [2018-04-11 15:12:17,293 INFO L226 Difference]: Without dead ends: 313 [2018-04-11 15:12:17,293 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=293, Invalid=5257, Unknown=0, NotChecked=0, Total=5550 [2018-04-11 15:12:17,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-04-11 15:12:17,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 178. [2018-04-11 15:12:17,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-04-11 15:12:17,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 193 transitions. [2018-04-11 15:12:17,294 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 193 transitions. Word has length 89 [2018-04-11 15:12:17,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:12:17,295 INFO L459 AbstractCegarLoop]: Abstraction has 178 states and 193 transitions. [2018-04-11 15:12:17,295 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-04-11 15:12:17,295 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 193 transitions. [2018-04-11 15:12:17,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-04-11 15:12:17,295 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:12:17,295 INFO L355 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:12:17,295 INFO L408 AbstractCegarLoop]: === Iteration 128 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:12:17,295 INFO L82 PathProgramCache]: Analyzing trace with hash 740308801, now seen corresponding path program 67 times [2018-04-11 15:12:17,295 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:12:17,295 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:12:17,296 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:17,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:12:17,296 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:17,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:12:17,303 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:17,328 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:12:17,329 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:12:17,329 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:12:17,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:12:17,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:12:17,354 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:12:17,356 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:17,356 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:17,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:17,360 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:17,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:17,363 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:12:17,372 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:17,373 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:17,373 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:17,379 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:17,380 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:17,380 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:17,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:17,384 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:17,384 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:12:18,499 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 0 proven. 383 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:12:18,499 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:12:18,499 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-04-11 15:12:18,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-11 15:12:18,500 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-11 15:12:18,500 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=1260, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 15:12:18,500 INFO L87 Difference]: Start difference. First operand 178 states and 193 transitions. Second operand 37 states. [2018-04-11 15:12:20,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:12:20,871 INFO L93 Difference]: Finished difference Result 309 states and 324 transitions. [2018-04-11 15:12:20,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-11 15:12:20,871 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 89 [2018-04-11 15:12:20,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:12:20,872 INFO L225 Difference]: With dead ends: 309 [2018-04-11 15:12:20,872 INFO L226 Difference]: Without dead ends: 309 [2018-04-11 15:12:20,872 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=262, Invalid=4568, Unknown=0, NotChecked=0, Total=4830 [2018-04-11 15:12:20,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-04-11 15:12:20,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 178. [2018-04-11 15:12:20,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-04-11 15:12:20,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 193 transitions. [2018-04-11 15:12:20,873 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 193 transitions. Word has length 89 [2018-04-11 15:12:20,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:12:20,875 INFO L459 AbstractCegarLoop]: Abstraction has 178 states and 193 transitions. [2018-04-11 15:12:20,875 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-11 15:12:20,875 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 193 transitions. [2018-04-11 15:12:20,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-04-11 15:12:20,875 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:12:20,875 INFO L355 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:12:20,875 INFO L408 AbstractCegarLoop]: === Iteration 129 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:12:20,876 INFO L82 PathProgramCache]: Analyzing trace with hash -607210998, now seen corresponding path program 68 times [2018-04-11 15:12:20,876 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:12:20,876 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:12:20,876 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:20,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-04-11 15:12:20,876 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:20,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:12:20,883 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:20,933 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:12:20,933 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:12:20,933 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:12:20,934 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-04-11 15:12:20,951 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-04-11 15:12:20,951 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:12:20,955 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:12:20,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:12:20,957 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:20,960 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:20,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:20,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:20,962 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:12:20,970 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:20,970 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:20,971 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:20,976 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:20,976 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:20,977 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:20,977 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:20,980 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:20,980 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 [2018-04-11 15:12:21,965 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 334 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:12:21,965 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:12:21,965 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-04-11 15:12:21,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-04-11 15:12:21,966 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-04-11 15:12:21,966 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=1260, Unknown=0, NotChecked=0, Total=1332 [2018-04-11 15:12:21,966 INFO L87 Difference]: Start difference. First operand 178 states and 193 transitions. Second operand 37 states. [2018-04-11 15:12:24,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:12:24,307 INFO L93 Difference]: Finished difference Result 369 states and 384 transitions. [2018-04-11 15:12:24,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-11 15:12:24,307 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 89 [2018-04-11 15:12:24,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:12:24,308 INFO L225 Difference]: With dead ends: 369 [2018-04-11 15:12:24,308 INFO L226 Difference]: Without dead ends: 369 [2018-04-11 15:12:24,308 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=264, Invalid=4566, Unknown=0, NotChecked=0, Total=4830 [2018-04-11 15:12:24,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-04-11 15:12:24,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 178. [2018-04-11 15:12:24,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-04-11 15:12:24,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 193 transitions. [2018-04-11 15:12:24,310 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 193 transitions. Word has length 89 [2018-04-11 15:12:24,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:12:24,310 INFO L459 AbstractCegarLoop]: Abstraction has 178 states and 193 transitions. [2018-04-11 15:12:24,310 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-04-11 15:12:24,310 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 193 transitions. [2018-04-11 15:12:24,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-04-11 15:12:24,310 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:12:24,310 INFO L355 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:12:24,310 INFO L408 AbstractCegarLoop]: === Iteration 130 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:12:24,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1976640095, now seen corresponding path program 69 times [2018-04-11 15:12:24,311 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:12:24,311 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:12:24,311 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:24,311 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:12:24,311 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:24,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:12:24,319 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:24,378 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:12:24,378 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:12:24,378 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:12:24,378 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-04-11 15:12:24,440 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-04-11 15:12:24,440 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:12:24,447 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:12:24,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:24,449 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:24,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out 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:24,454 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:24,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:24,457 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:12:24,465 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:24,466 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:24,466 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:24,472 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:24,473 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:24,473 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:24,473 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:24,485 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:24,486 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-04-11 15:12:24,972 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-04-11 15:12:24,972 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-04-11 15:12:24,972 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-04-11 15:12:24,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-04-11 15:12:24,972 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-04-11 15:12:24,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-04-11 15:12:24,973 INFO L87 Difference]: Start difference. First operand 178 states and 193 transitions. Second operand 36 states. [2018-04-11 15:12:26,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-04-11 15:12:26,479 INFO L93 Difference]: Finished difference Result 424 states and 439 transitions. [2018-04-11 15:12:26,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-04-11 15:12:26,479 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 89 [2018-04-11 15:12:26,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-04-11 15:12:26,480 INFO L225 Difference]: With dead ends: 424 [2018-04-11 15:12:26,480 INFO L226 Difference]: Without dead ends: 424 [2018-04-11 15:12:26,480 INFO L567 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=260, Invalid=4432, Unknown=0, NotChecked=0, Total=4692 [2018-04-11 15:12:26,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2018-04-11 15:12:26,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 178. [2018-04-11 15:12:26,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-04-11 15:12:26,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 193 transitions. [2018-04-11 15:12:26,482 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 193 transitions. Word has length 89 [2018-04-11 15:12:26,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-04-11 15:12:26,482 INFO L459 AbstractCegarLoop]: Abstraction has 178 states and 193 transitions. [2018-04-11 15:12:26,482 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-04-11 15:12:26,482 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 193 transitions. [2018-04-11 15:12:26,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-04-11 15:12:26,482 INFO L347 BasicCegarLoop]: Found error trace [2018-04-11 15:12:26,482 INFO L355 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-04-11 15:12:26,482 INFO L408 AbstractCegarLoop]: === Iteration 131 === [cstrncpyErr3RequiresViolation, cstrncpyErr5RequiresViolation, cstrncpyErr4RequiresViolation, cstrncpyErr2RequiresViolation, cstrncpyErr0RequiresViolation, cstrncpyErr1RequiresViolation, mainErr1RequiresViolation, mainErr2EnsuresViolationMEMORY_LEAK, mainErr0RequiresViolation]=== [2018-04-11 15:12:26,482 INFO L82 PathProgramCache]: Analyzing trace with hash -2113302614, now seen corresponding path program 70 times [2018-04-11 15:12:26,482 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS_NO_ARRAY [2018-04-11 15:12:26,482 INFO L68 tionRefinementEngine]: Using refinement strategy SmtInterpolRefinementStrategy [2018-04-11 15:12:26,483 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:26,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-04-11 15:12:26,483 INFO L119 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-04-11 15:12:26,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-04-11 15:12:26,490 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:26,492 INFO L431 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown lemma type! [2018-04-11 15:12:26,492 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-04-11 15:12:26,492 INFO L213 ckRefinementStrategy]: Switched to mode SMTINTERPOL_FP [2018-04-11 15:12:26,493 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-04-11 15:12:26,523 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-04-11 15:12:26,523 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-04-11 15:12:26,527 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-04-11 15:12:26,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:26,529 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:26,533 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-04-11 15:12:26,533 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:26,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-04-11 15:12:26,539 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-04-11 15:12:26,548 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:26,549 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:26,549 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:26,555 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:26,556 INFO L700 Elim1Store]: detected not equals via solver [2018-04-11 15:12:26,556 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:26,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-04-11 15:12:26,559 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:26,559 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:25, output treesize:9 Received shutdown request... [2018-04-11 15:12:26,797 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-04-11 15:12:26,797 WARN L519 AbstractCegarLoop]: Verification canceled [2018-04-11 15:12:26,800 WARN L197 ceAbstractionStarter]: Timeout [2018-04-11 15:12:26,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.04 03:12:26 BoogieIcfgContainer [2018-04-11 15:12:26,800 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-04-11 15:12:26,801 INFO L168 Benchmark]: Toolchain (without parser) took 168431.65 ms. Allocated memory was 401.1 MB in the beginning and 1.0 GB in the end (delta: 610.8 MB). Free memory was 331.9 MB in the beginning and 619.1 MB in the end (delta: -287.3 MB). Peak memory consumption was 323.5 MB. Max. memory is 5.3 GB. [2018-04-11 15:12:26,802 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 401.1 MB. Free memory is still 359.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-04-11 15:12:26,802 INFO L168 Benchmark]: CACSL2BoogieTranslator took 233.64 ms. Allocated memory is still 401.1 MB. Free memory was 331.9 MB in the beginning and 308.1 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:12:26,802 INFO L168 Benchmark]: Boogie Preprocessor took 37.61 ms. Allocated memory is still 401.1 MB. Free memory was 308.1 MB in the beginning and 305.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-04-11 15:12:26,802 INFO L168 Benchmark]: RCFGBuilder took 366.43 ms. Allocated memory was 401.1 MB in the beginning and 586.7 MB in the end (delta: 185.6 MB). Free memory was 305.4 MB in the beginning and 522.6 MB in the end (delta: -217.2 MB). Peak memory consumption was 25.4 MB. Max. memory is 5.3 GB. [2018-04-11 15:12:26,802 INFO L168 Benchmark]: TraceAbstraction took 167790.77 ms. Allocated memory was 586.7 MB in the beginning and 1.0 GB in the end (delta: 425.2 MB). Free memory was 522.6 MB in the beginning and 619.1 MB in the end (delta: -96.5 MB). Peak memory consumption was 328.7 MB. Max. memory is 5.3 GB. [2018-04-11 15:12:26,804 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 401.1 MB. Free memory is still 359.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 233.64 ms. Allocated memory is still 401.1 MB. Free memory was 331.9 MB in the beginning and 308.1 MB in the end (delta: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 37.61 ms. Allocated memory is still 401.1 MB. Free memory was 308.1 MB in the beginning and 305.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 366.43 ms. Allocated memory was 401.1 MB in the beginning and 586.7 MB in the end (delta: 185.6 MB). Free memory was 305.4 MB in the beginning and 522.6 MB in the end (delta: -217.2 MB). Peak memory consumption was 25.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 167790.77 ms. Allocated memory was 586.7 MB in the beginning and 1.0 GB in the end (delta: 425.2 MB). Free memory was 522.6 MB in the beginning and 619.1 MB in the end (delta: -96.5 MB). Peak memory consumption was 328.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 22 known predicates. - TimeoutResultAtElement [Line: 552]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 22 known predicates. - TimeoutResultAtElement [Line: 552]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 552). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 22 known predicates. - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 22 known predicates. - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 22 known predicates. - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 548). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 22 known predicates. - TimeoutResultAtElement [Line: 569]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 569). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 22 known predicates. - TimeoutResultAtElement [Line: 558]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 558). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 22 known predicates. - TimeoutResultAtElement [Line: 569]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 569). Cancelled while BasicCegarLoop was analyzing trace of length 90 with TraceHistMax 10, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 22 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 52 locations, 9 error locations. TIMEOUT Result, 167.7s OverallTime, 131 OverallIterations, 14 TraceHistogramMax, 114.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6203 SDtfs, 15188 SDslu, 104777 SDs, 0 SdLazy, 144157 SolverSat, 2960 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 47.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9872 GetRequests, 4683 SyntacticMatches, 10 SemanticMatches, 5179 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 30363 ImplicationChecksByTransitivity, 95.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=178occurred in iteration=126, 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.2s AutomataMinimizationTime, 130 MinimizatonAttempts, 19410 StatesRemovedByMinimization, 124 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 4.2s SatisfiabilityAnalysisTime, 47.5s InterpolantComputationTime, 15098 NumberOfCodeBlocks, 15080 NumberOfCodeBlocksAsserted, 666 NumberOfCheckSat, 7532 ConstructedInterpolants, 784 QuantifiedInterpolants, 8028194 SizeOfPredicates, 3875 NumberOfNonLiveVariables, 41453 ConjunctsInSsa, 15087 ConjunctsInUnsatCore, 131 InterpolantComputations, 14 PerfectInterpolantSequences, 10/18336 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/cstrncpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-04-11_15-12-26-810.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/cstrncpy-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-04-11_15-12-26-810.csv Completed graceful shutdown